ACM Computing Surveys (CSUR)
Min-max heaps and generalized priority queues
Communications of the ACM
SIAM Journal on Computing
Designing efficient algorithms for parallel computers
Designing efficient algorithms for parallel computers
The Deap—A double-ended heap to implement double-ended priority queues
Information Processing Letters
Computer algorithms: introduction to design and analysis (2nd ed.)
Computer algorithms: introduction to design and analysis (2nd ed.)
Concurrent Access of Priority Queues
IEEE Transactions on Computers
Concurrent operations on priority queues
Communications of the ACM
Journal of Algorithms
A note on the construction of data structure “deap”
Information Processing Letters
Disk scheduling: FCFS vs.SSTF revisited
Communications of the ACM
Heaps applied to event driven mechanisms
Communications of the ACM
Computer Architecture and Parallel Processing
Computer Architecture and Parallel Processing
Parallel processing for some network optimization problems
Parallel processing for some network optimization problems
Lock bypassing: an efficient algorithm for concurrently accessing priority heaps
Journal of Experimental Algorithmics (JEA)
A note on constructing binary heaps with periodic networks
Information Processing Letters
Optimal and Load Balanced Mapping of Parallel Priority Queues in Hypercubes
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
An adaptive parallel algorithm for inducing a priority queue structure on an n-element array is presented. The algorithm is extended to provide optimal parallel construction algorithms for three other heap-like structures useful in implementing double-ended priority queues, namely min-max heaps, deeps, and min-max-pair heaps. It is shown that an n-element array can be made into a heap, a deap, a min-max heap, or a min-max-pairheap in O(log n+(n/p)) time using no more than n/log n processors, in the exclusive-read-exclusive-write parallel random-access machine model.