This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
A Dictionary Machine (for VLSI)
September 1982 (vol. 31 no. 9)
pp. 892-897
T.A. Ottmann, Institut f?r Angewandte Informatik, University of Karlsruhe
We present the design of a dictionary machine that is suitable for VLSI implementation, and we discuss how to realize this implementation efficiently. The machine supports the operations of SEARCH, INSERT, DELETE, and EXTRACTMIN on an arbitrary ordered set. Each of these operations takes time O(log n), where n is the number of entries present when the operation is performed. Moreover, arbitrary sequences of these instructions can be pipelined through the machine at a constant rate (i.e., independent of n and the capacity of the machine). The time O(log n) is an improvement over previous VLSI designs of dictionary machines which require time O(log N) per operation, where N is the maximum number of keys that can be stored.
Index Terms:
VLSI complexity, Algorithms for VLSI, dictionary search, pipelining, search tree, systolic array
Citation:
T.A. Ottmann, A.L. Rosenberg, L.J. Stockmeyer, "A Dictionary Machine (for VLSI)," IEEE Transactions on Computers, vol. 31, no. 9, pp. 892-897, Sept. 1982, doi:10.1109/TC.1982.1676104
Usage of this product signifies your acceptance of the Terms of Use.