This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Low Expansion Packings and Embeddings of Hypercubes into Star Graphs: A Performance-Oriented Approach
March 1998 (vol. 9 no. 3)
pp. 261-274

Abstract—We discuss the problem of packing hypercubes into an n-dimensional star graph S(n), which consists of embedding a disjoint union of hypercubes U into S(n) with load one. Hypercubes in U have from $\lfloor n/2 \rfloor$ to $(n+1)\cdot \left\lfloor {\log_2\,n} \right\rfloor -2^{\left\lfloor {\log_2n} \right \rfloor +1}+2$ dimensions, i.e., they can be as large as any hypercube which can be embedded with dilation at most four into S(n). We show that U can be embedded into S(n) with optimal expansion, which contrasts with the growing expansion ratios of previously known techniques.

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 S(n), and obtain their corresponding performance metrics using either mathematical analysis or computer simulation.

[1] S.B. Akers, D. Harel, and B. Krishnamurthy, "The Star Graph: An Attractive Alternative to the n-Cube," Proc. Int'l Conf. Parallel Processing, pp. 393-400, 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. 505-549, 1989.
[3] W.J. Dally and C.I. Seitz, "The Torus Routing Chip," Distributed Computing, vol. 1, no. 4, pp. 187-196, 1986.
[4] M.M. de Azevedo, "Star-Based Interconnection Networks and Fault-Tolerant 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. 115-122, 1996.
[6] M.M. de Azevedo, N. Bagherzadeh, and S. Latifi, "Variable-Dilation Embeddings of Hypercubes into Star Graphs: Performance Metrics, Mapping Functions, and Routing," Proc. Second Int'l Euro-Par Conf, Lecture Notes in Computer Science, vol. I, no. 1,123, pp. 247-252. Springer-Verlag, 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. 525-531, May 1994.
[8] J.P. Hayes and T. Mudge, "Hypercube Supercomputers," Proc. IEEE, vol. 77, no. 12, pp. 1,829-1,841, Dec. 1989.
[9] D. Hoelzeman and S. Bettayeb, "On the genus of star graphs," \it IEEE Trans. Computers, vol. 43, no. 6, pp. 755-759, 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. 43-74, 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. 191-201, 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. 97-102, 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. 1-8, 1990.
[16] L.M. Ni and P.K. McKinley, "A Survey of Wormhole Routing Techniques in Direct Networks," Computer, vol. 26, no. 2, pp. 62-76, 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. 340-343, 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. 131-135, Oct. 1993.

Index Terms:
Graph embeddings, hypercubes, interconnection networks, routing, star graphs.
Citation:
Marcelo Moraes de Azevedo, Nader Bagherzadeh, Shahram Latifi, "Low Expansion Packings and Embeddings of Hypercubes into Star Graphs: A Performance-Oriented Approach," IEEE Transactions on Parallel and Distributed Systems, vol. 9, no. 3, pp. 261-274, March 1998, doi:10.1109/71.674318
Usage of this product signifies your acceptance of the Terms of Use.