Managing a parallel heap efficiently
- 1 January 1991
- book chapter
- Published by Springer Nature
- p. 270-287
- https://doi.org/10.1007/bfb0035110
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Adaptive Bitonic Sorting: An Optimal Parallel Algorithm for Shared-Memory MachinesSIAM Journal on Computing, 1989
- Concurrent operations on priority queuesCommunications of the ACM, 1989
- Concurrent access of priority queuesIEEE Transactions on Computers, 1988
- Parallel Merge SortSIAM Journal on Computing, 1988
- Coping with Anomalies in Parallel Branch-and-Bound AlgorithmsIEEE Transactions on Computers, 1986
- Performance of parallel branch-and-bound algorithmsIEEE Transactions on Computers, 1985
- Anomalies in parallel branch-and-bound algorithmsCommunications of the ACM, 1984
- Parallel Prefix ComputationJournal of the ACM, 1980