Data structures and network algorithms
Data structures and network algorithms
Concurrent Access of Priority Queues
IEEE Transactions on Computers
Concurrent operations on priority queues
Communications of the ACM
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Implementing Abstract Data Structures in Hardware
MFCS '88 Proceedings of the Mathematical Foundations of Computer Science 1988
Parallelism in random access machines
STOC '78 Proceedings of the tenth annual ACM symposium on Theory of computing
Searching, Merging, and Sorting in Parallel Computation
IEEE Transactions on Computers
On a search problem related to branch-and-bound procedures
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
| Hi-index | 0.89 |
This paper introduces the Parallel Priority Queue (PPQ) abstract data type. A PPQ stores a set of integer-valued items andprovides operations such as insertion of n new items or deletion of the n smallest ones. Algorithms for realizing PPQ operations on an n-processor CREW-PRAM are based on two new data structures, the n-Bandwidth-Heap (n.-H) and the n-Bandwidth-Leftist-Heap (n-L), that are obtained as extensions of the well-known sequential binary-heap and leftist-heap, respectively. Using these structures, it is shown that insertion of n new items in a PPQ of m elements can be performed in parallel time O(h +log n), where h = log(m/n), while deletion of the n smallest items can be performed in time O(h+ log log n).