This Article 
 Bibliographic References 
 Add to: 
Systolic Tree Implementation of Data Structures
June 1988 (vol. 37 no. 6)
pp. 727-735
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

[1] M. Atallah and S. Kosaraju, "A generalized dictionary for VLSI,"IEEE Trans. Comput., vol. C-34, pp. 151-155, 1985.
[2] J. Bentley and H. Kung, "A tree machine for searching problems," inProc. 1979 Int. Conf. Parallel Processing, IEEE, 1979, pp. 265-266.
[3] M. Carey and C. Thompson, "An efficient implementation of search trees on⌈logN+ 1⌉processors,"IEEE Trans. Comput., vol. C-33, pp. 1038-1041, 1984.
[4] J. Chang, M. Chung, O. Ibarra, and K. Rao, "Systolic tree implementation of data structures," Tech. Rep. TR 85-32, Univ. Minnesota, 1985.
[5] K. Culik II, O. Ibarra, and S. Yu, "Iterative tree arrays with logarithmic depth,"Comput. Mathematics, vol. 20, pp. 187-204, 1986.
[6] A. Fisher, "Dictionary machines with a small number of processors," inProc. 11th Annu. Int. Symp. Comput. Architecture, ACM, 1984, pp. 151-156.
[7] L. Guibas and F. Liang, "Systolic stacks, queues, and counters," inProc. Conf. Advanced Res. VLSI, MIT, Cambridge, 1982.
[8] D. E. Knuth,The Art of Computer Programming, Vol. 1. Reading, MA: Addison-Wesley, 1973.
[9] C. Leiserson, "Systolic priority queues," Tech. Rep. CMU-CS-79- 115, Dep. Comput. Sci., Carnegie Mellon Univ., 1979.
[10] T. Ottman, A. Rosenberg, and L. Stockmeyer, "Dictionary machine for VLSI,"IEEE Trans. Comput., vol. C-32, pp. 892-897, 1982.
[11] H. Schmeck and H. Schroder, "Dictionary machine for different models of VLSI,"IEEE Trans. Comput., vol. C-34, pp. 472-475, 1985.
[12] A. K. Somani and V. K. Agarwal, "An efficient unsorted VLSI dictionary machine,"IEEE Trans. Comput., vol. C-34, pp. 841-852, Sept. 1985.
[13] S. Song, "A highly concurrent tree machine for database applications," inProc. 1980 Int. Conf. Parallel Processing, 1980, pp. 259- 268.
[14] Y. Tanaka, Y. Nozaka, and A. Masuyama, "Pipeline searching and sorting modules as components of data flow database computer,"Int. Federation Inform. Processing Proc., pp. 427-432, 1980.

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).
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. 6, pp. 727-735, June 1988, doi:10.1109/12.2211
Usage of this product signifies your acceptance of the Terms of Use.