A Generalized Dictionary Machine for VLSI
暂无分享,去创建一个
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 Ω(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.
[1] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[2] H. T. Kung,et al. Two papers on a tree-structured parallel computer , 1979 .
[3] Charles E. Leiserson. Systolic Priority Queues , 1979 .
[4] Arnold L. Rosenberg,et al. A Dictionary Machine (for VLSI) , 1982, IEEE Transactions on Computers.
[5] Charles E. Leiserson,et al. Area-Efficient VLSI Computation , 1983 .