|
| This Article | ||
| ||
| Share | ||
| Bibliographic References | ||
| Add to: | ||
| | ||
| Search | ||
| ||
| ASCII Text | x | ||
| M.J. Atallah, S. Rao Kosaraju, "A Generalized Dictionary Machine for VLSI," IEEE Transactions on Computers, vol. 34, no. 2, pp. 151-155, February, 1985. | |||
| BibTex | x | ||
| @article{ 10.1109/TC.1985.1676551, author = {M.J. Atallah and S. Rao Kosaraju}, title = {A Generalized Dictionary Machine for VLSI}, journal ={IEEE Transactions on Computers}, volume = {34}, number = {2}, issn = {0018-9340}, year = {1985}, pages = {151-155}, doi = {http://doi.ieeecomputersociety.org/10.1109/TC.1985.1676551}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, } | |||
| RefWorks Procite/RefMan/Endnote | x | ||
| TY - JOUR JO - IEEE Transactions on Computers TI - A Generalized Dictionary Machine for VLSI IS - 2 SN - 0018-9340 SP151 EP155 EPD - 151-155 A1 - M.J. Atallah, A1 - S. Rao Kosaraju, PY - 1985 KW - VLSI KW - Dictionary operations KW - parallel processing KW - pipe-lining KW - tree machine VL - 34 JA - IEEE Transactions on Computers ER - | |||
We show that a machine in which the processors are interconnected as a binary tree can support all the dictionary and priority queue operations as well as some other data queries. Every one of the operations takes O(log n) steps where n is the number of keys present. A sequence of operations can be pipe-lined at a constant rate. In previous designs, either an operation required O(log N) steps where N is the total capacity of the machine, i.e., the maximum number of keys that can be stored in it, or O(log n) performance was achieved at the expense of additional wires.
Index Terms:
VLSI, Dictionary operations, parallel processing, pipe-lining, tree machine
Citation:
M.J. Atallah, S. Rao Kosaraju, "A Generalized Dictionary Machine for VLSI," IEEE Transactions on Computers, vol. 34, no. 2, pp. 151-155, Feb. 1985, doi:10.1109/TC.1985.1676551
Usage of this product signifies your acceptance of the Terms of Use.

