Abstract
We present load 1 embeddings of a k-dimensional hypercube Q k into an n-dimensional star graph S n . Dimension i links of Q k are mapped into paths of length at most d i in S n , where d i varies with i rather than being fixed. Our embeddings are an attractive alternative to previously known techniques, producing small average dilation and small average congestion without sacrificing expansion. We provide a thorough characterization of our embeddings, which spans several combinations of node mapping functions and routing algorithms in S n .
This research is supported in part by CNPq, Brazil, under the grant No. 200392/92-1.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Akers, S. B., Harel, D., Krishnamurthy, B.: The star graph: an attractive alternative to the n-cube. Proc. Int. Conf. Par. Proc. (1987) 393–400
Azevedo, M. M., Latifi, S., Bagherzadeh, N.: Low expansion packings and embeddings of hypercubes into star graphs. Proc. IEEE 15th Phoenix Conf. Comp. Comm. (1996) 115–122
Azevedo, M. M., Bagherzadeh, N., Latifi, S.: Variable-dilation embeddings of hypercubes into star graphs: performance metrics, mapping functions, and routing. Dept. Elec. & Comp. Engr. U. Cal., Irvine. Tech. Rep. ECE 96-05-01 (1996)
Chen, W.-K., Stallmann, M. F. M., Gehringer, E. F.: Hypercube embedding heuristics: an evaluation. Int. J. Par. Prog. 18 No. 6 (1989) 505–549
Hayes, J. P., Mudge, T.: Hypercube supercomputers. Proc. IEEE. 77 No. 12 (1989) 1829–1841
Jwo, J. S., Lakshmivarahan, S., Dhall, S. K.: Embedding of cycles and grids in star graphs. J. Circ., Sys., and Comp. 1 No. 1 (1991) 43–74
Nigam, M., Sahni, S., Krishnamurthy, B.: Embedding Hamiltonians and hypercubes in star interconnection networks. Proc. Int. Conf. Par. Proc. (1990) 340–343
Ranka, S., Wang, J.-C., Yeh, N.: Embedding meshes on the star graph. J. Par. Dist. Comp. 19 (1993) 131–135
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1996 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
de Azevedo, M.M., Bagherzadeh, N., Latifi, S. (1996). Variable-dilation embeddings of hypercubes into star graphs: Performance metrics, mapping functions, and routing. In: Bougé, L., Fraigniaud, P., Mignotte, A., Robert, Y. (eds) Euro-Par'96 Parallel Processing. Euro-Par 1996. Lecture Notes in Computer Science, vol 1123. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-61626-8_32
Download citation
DOI: https://doi.org/10.1007/3-540-61626-8_32
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-61626-9
Online ISBN: 978-3-540-70633-5
eBook Packages: Springer Book Archive