Optimal and load balanced mapping of parallel priority queues in hypercubes

IEEE Transactions on Parallel and Distributed Systems

Volumn 7, Issue 6, 1996, Pages 555-564

  Das, Sajal K ^a,b   Pinotti, M Cristina ^a,d   Sarkar, Falguni ^c  

^a IEEE

^b Center for Advanced Research and Technology   (United States)

^c NORTEL NETWORKS   (United States)

^d ISTI CNR   (Italy)

Author keywords

B bandwidth slope heap; Hamiltonian path; Heap; Hypercube; Load balance; Priority queue; Slope tree; Speed up

Indexed keywords

ALGORITHMS; BANDWIDTH; COMPUTER ARCHITECTURE; MATHEMATICAL MODELS; PARALLEL ALGORITHMS; QUEUEING THEORY; TREES (MATHEMATICS);

HAMILTONIAN PATH; HYPERCUBE ARCHITECTURE; LOAD BALANCING; PARALLEL PRIORITY QUEUES;

PARALLEL PROCESSING SYSTEMS;

EID: 0030164306     PISSN: 10459219     EISSN: None     Source Type: Journal    
DOI: 10.1109/71.506694     Document Type: Article

References (18)

1. S. Carlsson, "An Optimal Algorithm for Deleting the Root of a Heap," Information Processing Letters, vol. 37, pp. 117-120, 1991.
2. D.Z. Chen, and X. Hu, "Fast and Efficient Operations on Parallel Priority Queues," Proc. Fifth Ann. Int'l Symp. Algorithms and Computation, pp. 279-287, Beijing, Aug. 1994.
3. S.K. Das, W.-B. Horng, and G.S. Moon, "An Efficient Algorithm for Managing a Parallel Heap," J. Parallel Algorithms and Applications, vol. 4, nos. 3-4, pp. 281-299, 1994.
4. S.K. Das, F. Sarkar, and M.C. Pinotti, "Optimal Parallel Priority Queues in Distributed Memory Hypercubes," Technical Report CRPDC-94-23, Dept. of Computer Sciences, Univ. of North Texas, Denton, Dec. 1994.
5. S.K. Das, F. Sarkar, and M.C. Pinotti, "Conflict-Free Path Access of Trees in Parallel Memory Systems with Applications to Distributed Heap Implementation," Proc. Int'l Conf. Parallel Processing, pp. 164-167, Oconomowoc, Wis., Aug. 1995.
6. J. Denes and A.D. Keedwell, Latin Squares and Their Applications. Academic Press, 1974.
7. N. Deo and S. Prasad, "An Optimal Parallel Priority Queue," J. Supercomputing, vol. 6, pp. 87-98, 1992.
8. G.H. Gonnet and J.I. Munro, "Heaps on Heaps," SIAM J. Computing, vol. 15, pp. 964-971, 1986.
9. A.K. Gupta and A.G. Phoutiou, "Load Balanced Priority Queue Implementations on Distributed Memory Parallel Machines," Lecture Notes in Computer Science, vol. 817, pp. 689-700, July 1994.
10. J. JáJá, An Introduction to Parallel Algorithms. Addison-Wesley, 1992.
11. F.T. Leighton, Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. San Mateo, Calif.: Morgan Kaufmann, 1992.
12. E.W. Mayr and C.G. Plaxton, "Pipelined Parallel Prefix Computations, and Sorting on a Pipelined Hypercube," J. Parallel and Distributed Computing, vol. 17, pp. 374-380, 1993.
13. S. Olariu and Z. Wen, "Optimal Initialization Algorithms for a Class of Priority Queue," IEEE Trans. Parallel and Distributed Systems, vol. 2, no. 4, pp. 423-430, 1991.
14. M.C. Pinotti and G. Pucci, "Parallel Priority Queues," Information Processing Letters, vol. 40, pp. 33-40, 1991.
15. M.C. Pinotti and G. Pucci, "Parallel Algorithms for Priority Queue Operations," Theoretical Computer Science, vol. 148, no. 1, pp. 171-180, 1995.
16. N.S. Rao and V. Kumar, "Concurrent Access of Priority Queues," IEEE Trans. Computers, vol. 37, no. 12, pp. 1,657-1,665, Dec. 1988.
17. A. Ranade, S. Cheng, E. Deprit, J. Jones, and S. Shih, "Parallelism and Locality in Priority Queues," Proc. Sixth IEEE Symp. Parallel and Distributed Processing, pp. 490-496, Oct. 1994.
18. P.J. Varman and K. Doshi, "Sorting with Linear Speedup on a Pipelined Hypercube," IEEE Trans. Computers, vol. 41, no. 1, pp. 97-103, Jan. 1992.