Randomized Priority Queues for Fast Parallel Access
- 1 February 1998
- journal article
- Published by Elsevier in Journal of Parallel and Distributed Computing
- Vol. 49 (1), 86-97
- https://doi.org/10.1006/jpdc.1998.1429
Abstract
No abstract availableThis publication has 5 references indexed in Scilit:
- An Inherent Bottleneck in Distributed CountingJournal of Parallel and Distributed Computing, 1998
- Optimal and load balanced mapping of parallel priority queues in hypercubesIEEE Transactions on Parallel and Distributed Systems, 1996
- Randomized parallel algorithms for backtrack search and branch-and-bound computationJournal of the ACM, 1993
- Concurrent access of priority queuesIEEE Transactions on Computers, 1988
- Probabilistic Parallel Algorithms for Sorting and SelectionSIAM Journal on Computing, 1985