
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Sajal K. Das, M. Cristina Pinotti, Falguni Sarkar, "Optimal and Load Balanced Mapping of Parallel Priority Queues in Hypercubes," IEEE Transactions on Parallel and Distributed Systems, vol. 7, no. 6, pp. 555564, June, 1996.  
BibTex  x  
@article{ 10.1109/71.506694, author = {Sajal K. Das and M. Cristina Pinotti and Falguni Sarkar}, title = {Optimal and Load Balanced Mapping of Parallel Priority Queues in Hypercubes}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {7}, number = {6}, issn = {10459219}, year = {1996}, pages = {555564}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.506694}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Parallel and Distributed Systems TI  Optimal and Load Balanced Mapping of Parallel Priority Queues in Hypercubes IS  6 SN  10459219 SP555 EP564 EPD  555564 A1  Sajal K. Das, A1  M. Cristina Pinotti, A1  Falguni Sarkar, PY  1996 KW  Hamiltonian path KW  heap KW  hypercube KW  load balance KW  priority queue KW  slopetree KW  bbandwidth slopeheap KW  speedup. VL  7 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—In this paper, we efficiently map a priority queue on the hypercube architecture in a load balanced manner, with no additional communication overhead, and present optimal parallel algorithms for performing insert and deletemin operations. Two implementations for such operations are proposed on the singleport hypercube model. In a
The second implementation is more scalable since it uses a larger number of processors, and attains a "nearly" optimal speedup on the single hypercube. Namely, the insertion of log
[1] M. Jabri and B. Flower, “Weight Perturbation: An Optimal Architecture and Learning Technique for Analog VLSI Feedforward and Recurrent Multilayer Networks,” IEEE Trans. Neural Networks, Vol. 3, No. 1, Jan. 1992, pp. 154157.
[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. 279287,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. 34, pp. 281299, 1994.
[4] S.K. Das, F. Sarkar, and M.C. Pinotti, "Optimal Parallel Priority Queues in Distributed Memory Hypercubes," Technical Report CRPDC9423, Dept. of Computer Sciences, Univ. of North Texas, Denton, Dec. 1994.
[5] S.K. Das, F. Sarkar, and M.C. Pinotti, "ConflictFree Path Access of Trees in Parallel Memory Systems with Applications to Distributed Heap Implementation," Proc. Int'l Conf. Parallel Processing, pp. 164167,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. 8798, 1992.
[8] G.H. Gonnet and J.I. Munro, "Heaps on Heaps," SIAM J. Computing, vol. 15, pp. 964971, 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. 689700, July 1994.
[10] J. J'aJ'a, An Introduction to Parallel Algorithms.New York: AddisonWesley, 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. 374380, 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. 423430, 1991.
[14] M.C. Pinotti and G. Pucci, "Parallel Priority Queues," Information Processing Letters, vol. 40, pp. 3340, 1991.
[15] M.C. Pinotti and G. Pucci, "Parallel Algorithms for Priority Queue Operations," Theoretical Computer Science, vol. 148, no. 1, pp. 171180, 1995.
[16] V. Rao and V. Kumar,“Concurrent access of priority queues,” IEEE Trans. Computers, vol. 37, no. 12, pp. 1,6571,665, 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. 490496, 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. 97103, Jan. 1992.