Optimal and load balanced mapping of parallel priority queues in hypercubes
- 1 June 1996
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Parallel and Distributed Systems
- Vol. 7 (6), 555-564
- https://doi.org/10.1109/71.506694
Abstract
No abstract availableThis publication has 13 references indexed in Scilit:
- Parallelism and locality in priority queuesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Parallel algorithms for priority queue operationsTheoretical Computer Science, 1995
- Fast and efficient operations on Parallel Priority QueuesLecture Notes in Computer Science, 1994
- AN EFFICIENT ALGORITHM FOR MANAGING A PARALLEL HEAP∗Parallel Algorithms and Applications, 1994
- Pipelined Parallel Prefix Computations, and Sorting on a Pipelined HypercubeJournal of Parallel and Distributed Computing, 1993
- Sorting with linear speedup on a pipelined hypercubeIEEE Transactions on Computers, 1992
- Parallel priority queuesInformation Processing Letters, 1991
- An optimal algorithm for deleting the root of a heapInformation Processing Letters, 1991
- Optimal parallel initialization algorithms for a class of priority queuesIEEE Transactions on Parallel and Distributed Systems, 1991
- Concurrent access of priority queuesIEEE Transactions on Computers, 1988