The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Introduction to VLSI Systems
Bounds on minimax edge length for complete binary trees
STOC '81 Proceedings of the thirteenth annual ACM symposium on Theory of computing
An Efficient Implementation of Search Trees on O(log N) Processors
An Efficient Implementation of Search Trees on O(log N) Processors
Area-efficient vlsi computation
Area-efficient vlsi computation
Survey on special purpose computer architectures for AI
ACM SIGART Bulletin
Systolic Tree Implementation of Data Structures
IEEE Transactions on Computers
Optimal VLSI Dictionary Machines Without Compress Instructions
IEEE Transactions on Computers
An Efficient Dictionary Machine Using Hexagonal Processor Arrays
IEEE Transactions on Parallel and Distributed Systems
Algorithms for Search Trees on Message-Passing Architectures
IEEE Transactions on Parallel and Distributed Systems
An Efficient Implementation of Search Trees on [lg N + 1] Processors
IEEE Transactions on Computers
| Hi-index | 0.01 |
A number of tree-structured multiprocessor designs have been proposed for performing a group of dictionary operations (INSERT, DELETE, EXTRACTMIN, NEAR, etc.) on a set of keys. These designs typically use one processor for each key stored and operate with constant throughput, assuming unit time to communicate and compare keys. This assumption breaks down in applications with long keys. This paper describes a machine which uses a number of processors proportional to the maximum length of a key to achieve constant throughput, regardless of key length. This design has important practical advantages over the family of tree-structured machines, and demonstrates that processor-intensive VLSI structures are not always the best route to a high-performance system.