Bimonthly    Since 1986
ISSN 1000-9000(Print)
CN 11-2296/TP
Indexed in:
Publication Details
Edited by: Editorial Board of Journal Of Computer Science and Technology
P.O. Box 2704, Beijing 100190, P.R. China
Sponsored by: Institute of Computing Technology, CAS & China Computer Federation
Undertaken by: Institute of Computing Technology, CAS
Distributed by:
China: All Local Post Offices
Other Countries: Springer
  • Table of Content
      10 October 1987, Volume 2 Issue 4 Previous Issue    Next Issue
    For Selected: View Abstracts Toggle Thumbnails
    Throughput Models of CSMA Network with Stations Uniformly Distributed along the Bus
    S. T. Chanson; L. Liang; A. Kumar
    Journal of Computer Science and Technology, 1987, 2 (4): 243-264. 
    Abstract   PDF(1002KB) ( 1389 )   Chinese Summary
    The distribution of station locations in a CSMA network can have significant effect on network throughput. In this paper, we develop an analytic model for unslotted, non-persistent CSMA bus network where the stations are uniformly distributed along the bus. We derive a closod form expression for throughput approximation, and discuss the fairness of CSMA protocol using the bus topology. Analytic and simulation results are presented and compared.
    References | Related Articles | Metrics
    A Tree-Structured Database Machine for Large Relational Database Systems
    Meng Liming; Xu Xiaofei; Chang Huiyou; Chen Guangxi; Hu Mingzeng; Li Sheng;
    Journal of Computer Science and Technology, 1987, 2 (4): 265-275. 
    Abstract   PDF(312KB) ( 1183 )   Chinese Summary
    This paper proposes a Tree-structured Database Machine (TDM), which is designed for supporting large relational database systems. The TDM aims at totally improving three level performance bottlenecks in relational database systems, i.e. data transfer bottleneck, data processing bottleneck, and multiquery optimization bottleneck. For reducing these bottlenecks, the TDM provides the approaches of data partition and data distribution upon data storages for concurrent data accesses, the tree-structured multipro…
    References | Related Articles | Metrics
    The Optimization of Distributed Join in C-POREL System
    Jin Hongping; Gu Junzhong;
    Journal of Computer Science and Technology, 1987, 2 (4): 276-286. 
    Abstract   PDF(526KB) ( 1052 )   Chinese Summary
    C-POREL is a distributed relational data base management system, with full distribution transparency. A relation can be horizontally fragmented into several subrelations allocated to different sites. When two or more fragmented relations appear in a join query, many-to- many semijoins between correspondent relations are usually needed in order to fully reduce relations involved. Distribution dependent attributes of a relational schema are defined in this paper. An optimization approach of distributed join w...
    References | Related Articles | Metrics
    Automatic Extraction of Words from Chinese Textual Data
    Wang Yongcheng;
    Journal of Computer Science and Technology, 1987, 2 (4): 287-291. 
    Abstract   PDF(249KB) ( 1030 )   Chinese Summary
    In addition to Chinese character I/O, one of the most important issues for Chinese information processing is automatic extraction of words from textual data. Having discussed the characteristics of Chinese words and sentences, we proved in this paper that this problem cannot be thoroughly resolved. Then, various algorithms for extraction of words from Chinese sentences are reviewed. Finally, a new algorithm is put forward, based on which a highly automatic Chinese information processing system has been deve…
    References | Related Articles | Metrics
    A Real-Time Interprocessor Synchronization Algorithm for Communication in Distributed Computer Systems
    Duan Ping; Cai Xiyao;
    Journal of Computer Science and Technology, 1987, 2 (4): 292-302. 
    Abstract   PDF(485KB) ( 1056 )   Chinese Summary
    A real-time synchronization algorithm for interprncessor communication is presented, which is based on the techniques of Reference 2, except that buffered communication is used. The upper and lower bounds of the mean response time of this algorithm is derived.
    References | Related Articles | Metrics
    A Systolic Approach for an Improvement of a Finite Field Multiplier
    Qi Yulu;
    Journal of Computer Science and Technology, 1987, 2 (4): 303-309. 
    Abstract   PDF(283KB) ( 1090 )   Chinese Summary
    This paper proposes a systolic finite multiplier, which appears to function reasonably. And it shows that systolic architecture is a useful design tool for compute- bound applications.
    References | Related Articles | Metrics
    An Online Diagnosable Fault-Tolerant Redundancy System
    Shi Weigeng; StephenY.H.Su;
    Journal of Computer Science and Technology, 1987, 2 (4): 310-321. 
    Abstract   PDF(517KB) ( 1007 )   Chinese Summary
    This paper presents an online diagnosable fault-tolerant system: N-unit t-fault tolerablesystem. The number of units N in the system can be either odd or even. The relationshipbetween N and t (the number of faulty units which can be tolerated) is presented. The approachof an optimum N- unit t-fault tolerable system is also given. As an example, a 4-unit 2-faulttolerable system is discussed. The reliability and mean time to failure of 4-unit 2-fault tolerablesystem are shown to be higher than 5MR (5-modular redundancy) and TMR (Triple ModulerRedundancy) system reliabilities. The amount of hardware components in a 4-unit t-faulttolerable system is simpler than 5MR. The complexity of switching circuit for N-unit t-faulttolerable system increases only linearly with respect of the number of modules. Our scheme isalso simpler than the hybrid redundancy system. Some theorems for the online diagnosis of N-unit t-fault systems are given and proved.
    References | Related Articles | Metrics
  Journal Online
Just Accepted
Top Cited Papers
Top 30 Most Read
Paper Lists of Areas
Special Issues
   ScholarOne Manuscripts
   Log In

User ID:


  Forgot your password?

Enter your e-mail address to receive your account information.

ISSN 1000-9000(Print)

CN 11-2296/TP

Editorial Board
Author Guidelines
Journal of Computer Science and Technology
Institute of Computing Technology, Chinese Academy of Sciences
P.O. Box 2704, Beijing 100190 P.R. China
E-mail: jcst@ict.ac.cn
  Copyright ©2015 JCST, All Rights Reserved