Systolic Tree Implementation of Data Structures
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), 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).
References
[1]
{1} M. Atallah and S. Kosaraju, "A generalized dictionary for VLSI," IEEE Trans. Comput., vol. C-34, pp. 151-155, 1985.
[2]
{2} J. Bentley and H. Kung, "A tree machine for searching problems," in Proc. 1979 Int. Conf. Parallel Processing, IEEE, 1979, pp. 265-266.
[3]
{3} M. Carey and C. Thompson, "An efficient implementation of search trees on ⌈log N + 1⌉ processors," IEEE Trans. Comput., vol. C-33, pp. 1038-1041, 1984.
[4]
{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]
{5} K. Culik II, O. Ibarra, and S. Yu, "Iterative tree arrays with logarithmic depth," Comput. Mathematics, vol. 20, pp. 187-204, 1986.
[6]
{6} A. Fisher, "Dictionary machines with a small number of processors," in Proc. 11th Annu. Int. Symp. Comput. Architecture, ACM, 1984, pp. 151-156.
[7]
{7} L. Guibas and F. Liang, "Systolic stacks, queues, and counters," in Proc. Conf. Advanced Res. VLSI, MIT, Cambridge, 1982.
[8]
{8} D. Knuth, The Art of Computer Programming, Vol. 1. Reading, MA: Addison-Wesley.
[9]
{9} C. Leiserson, "Systolic priority queues," Tech. Rep. CMU-CS-79- 115, Dep. Comput. Sci., Carnegie Mellon Univ., 1979.
[10]
{10} T. Ottman, A. Rosenberg, and L. Stockmeyer, "Dictionary machine for VLSI," IEEE Trans. Comput., vol. C-32, pp. 892-897, 1982.
[11]
{11} H. Schmeck and H. Schroder, "Dictionary machine for different models of VLSI," IEEE Trans. Comput., vol. C-34, pp. 472-475, 1985.
[12]
{12} A. Somani and V. Agarwal, "An efficient unsorted VLSI dictionary machine," IEEE Trans. Comput., vol. C-34, pp. 841-852, 1985.
[13]
{13} S. Song, "A highly concurrent tree machine for database applications," in Proc. 1980 Int. Conf. Parallel Processing, 1980, pp. 259- 268.
[14]
{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 of Data Structures
Recommendations
A Finite Capacity Queue with Nonrenewal Input and Exponential Dynamic Group Services
<P>In this article we consider a finite capacity queuing model in which jobs (or customers) arrive according to a nonrenewal process. The jobs are processed by a single server in groups of varying size, between a predetermined threshold value and the ...
On the Buffer Behavior with Poisson Arrivals, Priority Service, and Random Server Interruptions
A discrete buffered system with infinite buffer size, multiple Poisson arrival streams, priority service, and random server interruptions is considered. The queueing times of the data packets of different priority classes are derived using the concepts ...
Effective bandwidths of departure processes from queues with time varying capacities
INFOCOM '95: Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 3)-Volume - Volume 3In this paper, we consider a queue with a time varying capacity and identify the effective bandwidth of the stationary departure process from such a queue. Two important observations are made: (i) the effective bandwidths for the transient departure ...
Comments
Information & Contributors
Information
Published In
Copyright © Copyright © 1988 IEEE. All Rights Reserved.
Publisher
IEEE Computer Society
United States
Publication History
Published: 01 June 1988
Author Tags
Qualifiers
- Research-article
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 03 Sep 2024