Abstract
In this paper, Multiple Reduced Hypercube(MRH), which is a new interconnection network based on a hypercube interconnection network, is suggested. Also, this paper demonstrates that MRH(n) proposed in this study is superior to the previously proposed hypercube interconnection networks and the hypercube transformation interconnection networks in terms of network cost(diameter × degree). In addition, several network properties(connectivity, routing algorithm, diameter, broadcasting) of MRH(n) are analyzed.
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., Krishnamurthy, B.: A Group-Theoretic Model for Symmertric Interconnection Network. IEEE. Trans. Computers 38(4), 555–565 (1989)
Doty, K.W.: New Designs for Dense Processor Interconnection Networks. IEEE. Trans. Computers 33(5), 447–450 (1984)
Duh, D.R., Chen, G.H., Fang, J.F.: Algorithms and Properties of a New Two-Level Network with Folded Hypercubes as Basic Modules. IEEE. Trans. Parallel Distributed syst. 6(7), 714–723 (1995)
El-Amawy, A., Latifi, S.: Properties and Performance of Folded Hypercubes. IEEE. Trans. Parallel Distributed syst. 2(1), 31–42 (1991)
Feng, T.-Y.: A Survey of Interconnection Networks. IEEE. Trans. Computers 14(12), 12–27 (1981)
Ghose, K., Desai, K.R.: Hierarchical Cubic Networks. IEEE. Trans. Parallel Distributed syst. 6(4), 427–436 (1995)
Gupta, A.K., Hambrusch, S.E.: Multiple Network Embeddings into Hypercubes. J. Parallel and Distributed Computing 19, 73–82 (1993)
Harary, F., Hayes, J.P., Wu, H.-J.: A Survey of the Theory of Hypercube Graphs. Comput. Math. Appl. 15, 277–289 (1988)
Leighton, F.T.: Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes. Morgan Kaufmann, San Francisco (1992)
Mendia, V.E., Sarkar, D.: Optimal Broadcasting on the Star Graph. IEEE. Trans. Parallel Distributed syst. 3(4), 389–396 (1992)
Park, J.-H.: Circulant Graphs and Their Application to Communication Networks. Ph.D. Thesis, Dept. of Computer Science, KAIST, Taejon Korea (1992)
Reed, D.A., Fujimoth, R.M.: Multicomputer Networks: Message-Based Parallel Processing. MIT Press, Cambridge (1987)
Vaidya, A.S., Rao, P.S.N., Shankar, S.R.: A Class of Hypercube-like Networks. In: Proc. of the 5th IEEE Symposium on Parallel and Distributed Processing, pp. 800–803 (1993)
Wu, A.Y.: Embedding of Tree Networks into Hypercubes. J. Parallel and Distributed Computing 2, 238–249 (1985)
Yun, S.-K., Park, K.-H.: Comments on ’Hierarchical Cubic Networks. IEEE. Trans. Parallel Distributed syst. 9(4), 410–414 (1998)
Tucker, L.W., Robertson, G.G.: Architecture and Application of the Connection Machine. IEEE. Trans. Computers 21(8), 26–38 (1988)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Sim, H., Oh, JC., Lee, HO. (2009). Multiple Reduced Hypercube MRH(n): A New Interconnection Network Reducing Both Diameter and Edge of Hypercube . In: Ślęzak, D., Kim, Th., Yau, S.S., Gervasi, O., Kang, BH. (eds) Grid and Distributed Computing. GDC 2009. Communications in Computer and Information Science, vol 63. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-10549-4_23
Download citation
DOI: https://doi.org/10.1007/978-3-642-10549-4_23
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-10548-7
Online ISBN: 978-3-642-10549-4
eBook Packages: Computer ScienceComputer Science (R0)