Name
Abstract | ||
|---|---|---|
In this paper, we propose a dictionary machine emulation using a novel VLSI tree structure that operates on the dictionary using a blocking technique. We show that dictionary machine operations can be performed through the implementation of a number of processing and communication tasks overlapped on a simple structure. By manipulating the key-records bit serially, and storing them in an external memory rather than within the layers of the structure, we show that the size of the dictionary is limited only by the capacity of the external memory. This structure, which consists of multiple units, can be implemented in VLSI onto a single-chip. The key advantage of our structure is that it provides a means of implementing a high speed and low cost dictionary machine with virtually unlimited capacity; thus, eliminating the need for multiple chips should the dictionary expand. We have that an exhaustive search on a 2048 key-record dictionary can be performed in 29.78us. |
Year | DOI | Venue |
|---|---|---|
1998 | 10.1109/GLSV.1998.665213 | Great Lakes Symposium on VLSI |
Keywords | Field | DocType |
chip,emulation,exhaustive search,data structures,network topology,tree data structures,external memory,computer architecture,very large scale integration,tree structure,virtual machines,vlsi,hardware,dictionaries | Data structure,Virtual machine,Brute-force search,Computer science,Tree (data structure),Electronic engineering,Emulation,Tree structure,Very-large-scale integration,Auxiliary memory | Conference |
ISSN | ISBN | Citations |
1066-1395 | 0-8186-8409-7 | 0 |
PageRank | References | Authors |
0.34 | 0 | 2 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Adger E. Harvin III | 1 | 0 | 0.34 |
| Jose G. Delgado-Frias | 2 | 23 | 8.75 |