
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Marcelo Moraes de Azevedo, Nader Bagherzadeh, Shahram Latifi, "Low Expansion Packings and Embeddings of Hypercubes into Star Graphs: A PerformanceOriented Approach," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 3, pp. 261274, March, 1998.  
BibTex  x  
@article{ 10.1109/71.674318, author = {Marcelo Moraes de Azevedo and Nader Bagherzadeh and Shahram Latifi}, title = {Low Expansion Packings and Embeddings of Hypercubes into Star Graphs: A PerformanceOriented Approach}, journal ={IEEE Transactions on Parallel and Distributed Systems}, volume = {9}, number = {3}, issn = {10459219}, year = {1998}, pages = {261274}, doi = {http://doi.ieeecomputersociety.org/10.1109/71.674318}, 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  Low Expansion Packings and Embeddings of Hypercubes into Star Graphs: A PerformanceOriented Approach IS  3 SN  10459219 SP261 EP274 EPD  261274 A1  Marcelo Moraes de Azevedo, A1  Nader Bagherzadeh, A1  Shahram Latifi, PY  1998 KW  Graph embeddings KW  hypercubes KW  interconnection networks KW  routing KW  star graphs. VL  9 JA  IEEE Transactions on Parallel and Distributed Systems ER   
Abstract—We discuss the problem of packing hypercubes into an
We employ several performance metrics to show that, with our techniques, a star graph can efficiently execute heterogeneous workloads containing hypercube, mesh, and star graph algorithms. The characterization of our packings includes some important metrics which have not been addressed by previous research (namely, average dilation, average congestion, and congestion). Our packings consistently produce small average congestion and average dilation, which indicates that the induced communication slowdown is also small. We consider several combinations of node mapping functions and routing algorithms in
[1] S.B. Akers, D. Harel, and B. Krishnamurthy, "The Star Graph: An Attractive Alternative to the nCube," Proc. Int'l Conf. Parallel Processing, pp. 393400, 1987.
[2] W.K. Chen, M.F.M. Stallmann, and E.F. Gehringer, "Hypercube Embedding Heuristics: An Evaluation," Int'l J. Parallel Programming, vol. 18, no. 6, pp. 505549, 1989.
[3] W.J. Dally and C.I. Seitz, "The Torus Routing Chip," Distributed Computing, vol. 1, no. 4, pp. 187196, 1986.
[4] M.M. de Azevedo, "StarBased Interconnection Networks and FaultTolerant Clock Synchronization for Large Multicomputers," PhD dissertation, Univ. of California Irvine, 1997. Also available from Univ. Microfilms Int'l, Ann Arbor, Mich., Order No. 9712627.
[5] M.M. de Azevedo, S. Latifi, and N. Bagherzadeh, "Low Expansion Packings and Embeddings of Hypercubes into Star Graphs," Proc. 15th IEEE Int'l Phoenix Conf. Computers and Comm., pp. 115122, 1996.
[6] M.M. de Azevedo, N. Bagherzadeh, and S. Latifi, "VariableDilation Embeddings of Hypercubes into Star Graphs: Performance Metrics, Mapping Functions, and Routing," Proc. Second Int'l EuroPar Conf, Lecture Notes in Computer Science, vol. I, no. 1,123, pp. 247252. SpringerVerlag, 1996.
[7] P. Fragopoulou and S.G. Akl, "A Parallel Algorithm for Computing Fourier Transforms on the Star Graph," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 5, pp. 525531, May 1994.
[8] J.P. Hayes and T. Mudge, "Hypercube Supercomputers," Proc. IEEE, vol. 77, no. 12, pp. 1,8291,841, Dec. 1989.
[9] D. Hoelzeman and S. Bettayeb, "On the genus of star graphs," \it IEEE Trans. Computers, vol. 43, no. 6, pp. 755759, June 1994
[10] J.S. Jwo, S. Lakshmivarahan, and S.K. Dhall, "Embedding of Cycles and Grids in Star Graphs," J. Circuits, Systems, and Computers, vol. 1, no. 1, pp. 4374, 1991.
[11] D.E. Knuth, The Art of Computer Programming, vol. 1,Addison Wesley, second ed. 1973.
[12] S. Latifi, "Parallel Dimension Permutations on Star Graph," iIFIP Trans. A: Computer Science and Technology, vol. A23, pp. 191201, 1993.
[13] S. Latifi and N. Bagherzadeh, "Incomplete Star: An Incrementally Scalable Network Based on the Star Graph," IEEE Trans. Parallel and Distributed Systems, vol. 5, no. 1, pp. 97102, Jan. 1994.
[14] F.T. Leighton,Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes.San Mateo, Calif.: Morgan Kaufmann, 1992.
[15] A. Menn and A.K. Somani, "An Efficient Sorting Algorithm for the Star Graph Interconnection Network," Proc. Int'l Conf. Parallel Processing, vol. 3, pp. 18, 1990.
[16] L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, no. 2, pp. 6276, Feb. 1993.
[17] M. Nigam, S. Sahni, and B. Krishnamurthy, "Embedding Hamiltonians and Hypercubes in Star Interconnection Networks" Proc. Int'l Conf. Parallel Processing, vol. 3, pp. 340343, 1990.
[18] S. Ranka, J.C. Wang, and N. Yeh, "Embedding Meshes on the Star Graph," J. Parallel and Distributed Computing, vol. 19, no. 2, pp. 131135, Oct. 1993.