Dictionary machine (for VLSI)

Journal Article · Wed Sep 01 00:00:00 EDT 1982 · IEEE Trans. Comput.; (United States)

DOI:https://doi.org/10.1109/TC.1982.1676104· OSTI ID:6232221

Ottmann, T A; Rosenberg, A L; Stockmeyer, L J

The authors present the design of a dictionary machine that is suitable for VLSI implementation, and discusses how to realize this implementation efficiently. The machine supports the operations of search, insert, delete, and extractment on an arbitrary ordered set. Each of these operations takes time o(logn), 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(logn) 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. 10 references.

• Research Organization: Univ. of Karlsruhe, Germany, F.R.
• OSTI ID: 6232221
• Journal Information: IEEE Trans. Comput.; (United States), Vol. 9
• Country of Publication: United States
• Language: English

Related Subjects

99 GENERAL AND MISCELLANEOUS//MATHEMATICS, COMPUTING, AND INFORMATION SCIENCE
DATA BASE MANAGEMENT
COMPUTERS
INTEGRATED CIRCUITS
ELECTRONIC CIRCUITS
MANAGEMENT
MICROELECTRONIC CIRCUITS
990200* - Mathematics & Computers