Issue No. 02 - February (1985 vol. 34)
M.J. Atallah , Department of Computer Science, Purdue University
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.
VLSI, Dictionary operations, parallel processing, pipe-lining, tree machine
M. Atallah and S. Rao Kosaraju, "A Generalized Dictionary Machine for VLSI," in IEEE Transactions on Computers, vol. 34, no. , pp. 151-155, 1985.