Abstract
In the past years, various network architectures for parallel computers have been proposed, for instance, hyper cubes or star graphs. These classes of networks are known as Cayley graphs. In recent years, there have been some proposals of new families of interconnection net-works, namely, constant degree networks. In this paper, we propose a new interconnection network named extended star graphs, and we prove the extended star graphs have hypercube’s structure. We also propose routing algorithms for node-to-node communication on extended star graphs. Based on the algorithms, we obtain an upper bound 2n − 1 on the diameter for the n-th order extended star graph.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
S. Lakshmivarahan, Jung-Sing Jwo and S.K. Dhall. Symmetry in interconnection networks based on Cayley graphs of permutation groups: A survey Parallel Computing, No.19, pp.361–407, 1993.
P. Vadapalli, P.K. Srimani. A new family of Cayley graph interconnection networks of constant degree four IEEE Transactions on Parallel and Distributed Systems 7(1) pp.26–32, 1996.
Mohamed Benmaiza, Abderezal Touzene. One-to-all broadcast algorithm for constant degree 4 Cayley graphs Parallel Computing, No.25, pp.249–264, 1999.
J. Jwo. Analysis of interconnection networks based on Caley graphs related to permutation groups, ph.D. Dissertation, School of Electrical Engineering and Computer Science, University of Oklahoma. 1991.
S. Lakshmivarahan, Jung-Sing Jwo and S.K. Dhall. Embedding of cycles and grids in star graphs. Journal of Circuits, Systems, and Computers, Vol. 1 No. 1, pp43–74, 1991.
P. Vadapalli, P.K. Srimani. Trivalent Cayley graphs for interconnection networks. Information Processing Letters 54, pp329–335, 1995.
P. Vadapalli, P.K. Srimani. Shortest routing in trivalent Cayley graph network. Information Processing Letters 57, pp183–188, 1996.
S. Latifi, P.K. Srimani. A New Fixid Degree Regular Network for Parallel Processing., 1996.
S. B. Akers, D. Harel, B. Krishnamurthy. The Star Graph: An Attractive Alternative to the n-Cube. Proc. Internat. Conf. on Parallel Processing pp393–400, 1987.
Y. Saad, M. H. Schultz. Topological Properties of Hypercubes. IEEE Transactions on computers, vol. 37 NO. 7, pp393–400, 1988.
M. Shinotake. New Routing Algorithms for Extended Star Graphs. University of Aizu March, 2001.
S. Watanabe. A Proplsal of a new Network Topology and Its Fundamental Properties. University of Aizu March, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Watanabe, S., Okawa, S. (2003). An Extended Star Graph: A Proposal of a New Network Topology and Its Fundamental Properties. In: Guo, M., Yang, L.T. (eds) Parallel and Distributed Processing and Applications. ISPA 2003. Lecture Notes in Computer Science, vol 2745. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-37619-4_23
Download citation
DOI: https://doi.org/10.1007/3-540-37619-4_23
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40523-8
Online ISBN: 978-3-540-37619-4
eBook Packages: Springer Book Archive