Multilayer Hex-Cells: A New Class of Hex-Cell Interconnection Networks for Massively Parallel Systems
Mohammad Qatawneh
DOI: 10.4236/ijcns.2011.411086   PDF    HTML     6,602 Downloads   9,662 Views   Citations


Scalability is an important issue in the design of interconnection networks for massively parallel systems. In this paper a scalable class of interconnection network of Hex-Cell for massively parallel systems is introduced. It is called Multilayer Hex-Cell (MLH). A node addressing scheme and routing algorithm are also presented and discussed. An interesting feature of the proposed MLH is that it maintains a constant network degree regardless of the increase in the network size degree which facilitates modularity in building blocks of scalable systems. The new addressing node scheme makes the proposed routing algorithm simple and efficient in terms of that it needs a minimum number of calculations to reach the destination node. Moreover, the diameter of the proposed MLH is less than Hex-Cell network.

Share and Cite:

M. Qatawneh, "Multilayer Hex-Cells: A New Class of Hex-Cell Interconnection Networks for Massively Parallel Systems," International Journal of Communications, Network and System Sciences, Vol. 4 No. 11, 2011, pp. 704-708. doi: 10.4236/ijcns.2011.411086.

Conflicts of Interest

The authors declare no conflicts of interest.


[1] A. Mokhtar, “Multi-Level Hypercube Network,” Proceedings of the 5th International Conference in Parallel Processing Symposium, Anaheim, 30 April-2 May 1991, pp. 475-480.
[2] S. Huyn?, O. Jae-Chul and L. Hyeong-Ok, “Multiple Reduced Hypercube (MRH): A New Interconnection Network Reducing Both Diameter and Edge of Hypercube,” International Journal of Grid and Distributed Computing, Vol. 3, No. 1, 2010, pp. 19-30.
[3] Y. Liu and H. Jungang, “Double-Loop Hypercube: A New Scalable Interconnection Network for Massively Parallel Computing. Computing,” Proceedings of the ISECS International Colloquium on Computing, Communication, Control, and Management, Guangzhou, 3-4 August 2008, pp. 170-174. doi:10.1109/CCCM.2008.45
[4] T. Chan and Y. Saad, “Multigrid Algorithms on the Multiprocessor,” IEEE Transactions on Computers, Vol. C-35, No. 11, 2002, pp. 969-977. doi:10.1109/TC.1986.1676698
[5] S. Syed, K. Rizvi, M. Elleithy and A. Riasat, “An Efficient Routing Algorithm for Mesh-Hypercube (M-H) Networks,” Proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications, Las Vegas, 14-17 July 2008, pp. 69-75.
[6] C. Decayeux and D. Seme, “3D Hexagonal Network: Modeling, Topological Properties, Addressing Scheme, and Optimal Routing Algorithm,” IEEE Transaction on Parallel and Distributed Systems, Vol. 16, No. 9, 2005, pp. 875-884. doi:10.1109/TPDS.2005.100
[7] K. Day and A. Al-Ayyoub, “Topological Properties of OTIS-Networks,” IEEE Transactions on Parallel and Distributed Systems, Vol. 13, No. 4, 2002, pp. 359-366. doi:10.1109/71.995816
[8] A. Sharieh, M. Qatawneh, W. Almobaideen and A. Sliet, “Hex-Cell: Modeling, Topological Properties and Routing Algorithm,” European Journal of Scientific Research, Vol. 22, No. 2, 2008, pp. 457-468.

Copyright © 2024 by authors and Scientific Research Publishing Inc.

Creative Commons License

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.