Complexity issues in VLSI: optimal layouts for the shuffle-exchange graph and other networks
Complexity issues in VLSI: optimal layouts for the shuffle-exchange graph and other networks
An Efficient Unsorted VLSI Dictionary Machine
IEEE Transactions on Computers
A minimum area VLSI network for O(log n) time sorting
IEEE Transactions on Computers
Journal of Parallel and Distributed Computing
Optimal VLSI Dictionary Machines Without Compress Instructions
IEEE Transactions on Computers
Design and analysis of simultaneous access priority queues
Journal of Parallel and Distributed Computing
Concurrent manipulation of binary search trees
ACM Transactions on Database Systems (TODS)
Parallel permutation and sorting algorithms and a new generalized connection network
Journal of the ACM (JACM)
ACM Transactions on Programming Languages and Systems (TOPLAS)
Computational Aspects of VLSI
| Hi-index | 0.00 |
A simultaneous access design of a dictionary machine which supports insert, delete, andsearch operations is presented. The design is able to handle p accesses simultaneouslyand allows redundant accesses to occur. In the design, processors performing insert ordelete operations are free to perform other tasks after submitting their accesses to thedesign; processors that perform search operations get their response in O(log N) time.Compared to all sequential access designs of a dictionary which require O(p) time toprocess p accesses, the presented design provides much higher throughput; specifically,O(p/log p) times better. It also provides a fast mechanism to avoid the sequential accessbottleneck in any large multiprocessor system.