Abstract
The star graph, though an attractive alternative to the hypercube, has a poor network bandwidth due to a lower number of channels compared to that in an equivalent hypercube. In order to alleviate this drawback, this paper presents a generalization of the star graph topology with a richer connectivity, called theenhanced-star. We also examine some topological properties of the proposed network. Some useful functions such as multi-node broadcasting, scattering, total exchange, and group communication, in the enhanced-star are also addressed. We show these operations can be completed faster in the enhanced-star (compared to the star).
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Akers, S.B., Harel, D., Krishnamurthy, B.: The star graph: an attractive alternative to the hypercube. In: Proceedings of the International Conference on Parallel Processing, St. Charles, IL, pp. 393–400 (1987)
Akers, S.B., Krishnamurthy, B.: A group-theoretic model for symmetric interconnection networks. IEEE Transaction on Computers 38(4), 555–566 (1989)
Fragopoulou, P., Akl, S.G.: Optimal communication algorithm on star graphs using spanning tree constructions. Journal of Parallel and Distributed Computing 24, 55–71 (1995)
Akl, S.G., Qiu, K.: A novel routing scheme on the star and pancake networks and its applications. Parallel Computing 19(1), 95–101 (1993)
Latifi, S.: On fault diameter of star graphs. Information Processing Letters 46, 143–150 (1993)
Day, K., Tripathi, A.: A comparative study of topological properties of hypercube and star graphs. IEEE Trans. on Parallel and Distributed Systems 5(1), 31–38 (1994)
Latifi, S., Bagherzadeh, N.: Incomplete star: an incrementally scalable network based on the star graph. IEEE Trans. on Parallel and Distributed Systems 5(1), 97–102 (1994)
Azevedo, M.M., Bagherzadeh, N., Latifi, S.: Broadcasting algorithms for the star-connected cycles interconnection network. Journal of Parallel and Distributed Computing 25, 209–222 (1995)
Yeh, C., Varvarigos, E.: Macro-star networks: efficient low-degree alternatives to star graphs. IEEE Trans. on Parallel and Distributed Systems 9(10) (1998)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Tajozzakerin, H.R., Sarbazi-Azad, H. (2004). Enhanced-Star: A New Topology Based on the Star Graph. In: Cao, J., Yang, L.T., Guo, M., Lau, F. (eds) Parallel and Distributed Processing and Applications. ISPA 2004. Lecture Notes in Computer Science, vol 3358. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30566-8_117
Download citation
DOI: https://doi.org/10.1007/978-3-540-30566-8_117
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-24128-7
Online ISBN: 978-3-540-30566-8
eBook Packages: Computer ScienceComputer Science (R0)