The Community for Technology Leaders
Green Image
ABSTRACT
Systolic tree architectures are presented 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), r
INDEX TERMS
systolic tree implementation; data transmission; data structures; stacks; queues; dequeues; dictionary machines; unit response time; unit pipeline interval; data elements; data structures; queueing theory; trees (mathematics).
CITATION
J.H. Chang, O.H. Ibarra, M.J. Chung, K.K. Rao, "Systolic Tree Implementation of Data Structures", IEEE Transactions on Computers, vol. 37, no. , pp. 727-735, June 1988, doi:10.1109/12.2211
99 ms
(Ver )