Optimal parallel initialization algorithms for a class of priority queues
- 1 January 1991
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 2 (4) , 423-429
- https://doi.org/10.1109/71.97899
Abstract
No abstract availableThis publication has 15 references indexed in Scilit:
- Parallel priority queuesInformation Processing Letters, 1991
- Design and analysis of simultaneous access priority queuesJournal of Parallel and Distributed Computing, 1990
- Building heaps fastJournal of Algorithms, 1989
- A note on the construction of the data structure “deap”Information Processing Letters, 1989
- Concurrent operations on priority queuesCommunications of the ACM, 1989
- The deap—a double-ended heap to implement double-ended priority queuesInformation Processing Letters, 1987
- Bounds for min-max heapsBIT Numerical Mathematics, 1987
- Heaps on HeapsSIAM Journal on Computing, 1986
- Priority queue administration by sublist indexThe Computer Journal, 1979
- Heaps applied to event driven mechanismsCommunications of the ACM, 1976