An efficient VLSI dictionary machine

Authors:
Arun K. Somani;Vinod K. Agarwal
Affiliations:
Dept. of Electrical Engineering, McGill University, 3480 University Street, Montreal, CANADA, H3A 2A7;Dept. of Electrical Engineering, McGill University, 3480 University Street, Montreal, CANADA, H3A 2A7
Venue:
ISCA '84 Proceedings of the 11th annual international symposium on Computer architecture
Year:
1984

Citing 3
Cited 3

The Power of a One-Dimensional Vector of Processors

WG '80 Proceedings of the International Workshop on Graphtheoretic Concepts in Computer Science
A cellular computer to implement the kalman filter algorithm

A cellular computer to implement the kalman filter algorithm
Area-efficient vlsi computation

Area-efficient vlsi computation

Survey on special purpose computer architectures for AI

ACM SIGART Bulletin
Concurrent Access of Priority Queues

IEEE Transactions on Computers
The de Bruijn Multiprocessor Network: A Versatile Parallel Processing and Sorting Network for VLSI

IEEE Transactions on Computers

Quantified Score

Hi-index	0.01

Visualization

Abstract

A binary tree machine which can handle all the dictionary machine and priority queue operations as well as some other data queries is designed in this paper. This machine supports operations like Insert, Delete, Extract-Min/Max, Membership and Near and their redundant forms. If the number of keys present in the tree is n, then each of the operations takes O(log n) steps, and can be fed into the tree in a pipeline manner at a constant rate. A machine with N&equil;2**s-1 processors can store upto N-s data elements. The output is generated at a fixed interval. It does not use any horizontal wires as in some previous designs. Moreover, this approach does not require any sorted-order, is potentially applicable to non-binary tree structures, and is significantly simpler to implement than all the previous designs.