Systolic tree implementation of data structures

Journal Article · Wed Jun 01 00:00:00 EDT 1988 · IEEE Trans. Comput.; (United States)

DOI:https://doi.org/10.1109/12.2211· OSTI ID:6984899

Chang, J H; Ibarra, O H; Chung, M J; Rao, K K

The authors present systolic tree architectures for data structures such as stacks, queues, dequeues, priority queues, and dictionary machines. The stack, queue, and dequeue have a unit response time and a unit pipeline interval. The priority queue also has a unit response time, but the pipeline interval is 2. The response time and pipeline interval for the dictionary machine are O(log n) and O(1), respectively, where n is the number of data elements currently residing in the tree. In each node of the tree, the mechanism for controlling the transmission and distribution of data is finite state. This feature makes the designs presented here suitable for VLSI. If there are n data elements in the data structure, the depth of the tree is O(log n).

• Research Organization: Dept. of Computer Science, Univ. of Minnesota, Minneapolis, MN (US)
• OSTI ID: 6984899
• Journal Information: IEEE Trans. Comput.; (United States), Vol. 37:6
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
COMPUTER ARCHITECTURE
GRAPHS
PARALLEL PROCESSING
QUEUES
DATA-FLOW PROCESSING
MEASURING METHODS
PROGRAMMING
990210* - Supercomputers- (1987-1989)