Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
A mergeable double-ended priority queue
The Computer Journal - Special issue on data structures
Parallel algorithms for priority queue operations
Theoretical Computer Science
Optimal and Load Balanced Mapping of Parallel Priority Queues in Hypercubes
IEEE Transactions on Parallel and Distributed Systems
Fast and Efficient Operations on Parallel Priority Queues
ISAAC '94 Proceedings of the 5th International Symposium on Algorithms and Computation
| Hi-index | 0.00 |
We present an efficient mapping of a min-max-pair heap of size N on a hypercube multicomputer of p processors in such a way the load on each processor's local memory is balanced and no additional communication overhead is incurred for implementation of the single insertion, deletemin and deletemax operations. Our novel approach is based on an optimal mapping of the paths of a binary heap into a hypercube such that in O((log N)/p + log p) time we can compute the Hamiltonian-Suffix, which is defined as a pipelined suffix-minima computation on an O(log N)-length heap path embedded into the Hamiltonian path of the hypercube according to the binary reflected Gray codes. However, the binary tree underlying the heap data structure is not altered by the mapping process.