This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
An Efficient Unsorted VLSI Dictionary Machine
September 1985 (vol. 34 no. 9)
pp. 841-852
A.K. Somani, Department of Electrical Engineering, McGill University
A systolic binary tree machine which can handle all the dictionary machine and priority queue operations such as Insert, Delete, Extract-Min, Extract-Max, Member, and Near is designed in this paper. The operations can be fed into the tree machine in a pipeline manner at a constant rate and the output is correspondingly generated in a pipeline manner. Each processor in the machine stores at most one data element, which consists of a key value and a record associated with the key. The machine has optimal performance since if the number of data elements present in the tree is n, then each operation takes O(log n) steps. Unlike some recent designs, this machine does not use any links other than the binary tree links, provides optimal performance without the need to store data elements in any sorted order by exploiting dynamic rebalancing, has higher throughput, and keeps the logical last level of the tree on one physical level of the tree.
Index Terms:
VLSI complexity, Binary tree machines, dictionary machines, pipelining, priority queues, search machines, systolic systems, unsorted data structures, VLSI algorithms
Citation:
A.K. Somani, V.K. Agarwal, "An Efficient Unsorted VLSI Dictionary Machine," IEEE Transactions on Computers, vol. 34, no. 9, pp. 841-852, Sept. 1985, doi:10.1109/TC.1985.1676640
Usage of this product signifies your acceptance of the Terms of Use.