Design and analysis of the rotational binary graph as an alternative to hypercube and Torus
- 9 Downloads
Network cost is equal to degree × diameter and is one of the important measurements when evaluating graphs. Torus and hypercube are very well-known graphs. When these graphs expand, a Torus has an advantage in that its degree does not increase. A hypercube has a shorter diameter than that of other graphs, because when the graph expands, the diameter increases by 1. Hypercube Qn has 2n nodes, and its diameter is n. We propose the rotational binary graph (RBG), which has the advantages of both hypercube and Torus. RBGn has 2n nodes and a degree of 4. The diameter of RBGn would be 1.5n + 1. In this paper, we first examine the topology properties of RBG. Second, we construct a binary spanning tree in RBG. Third, we compare other graphs to RBG considering network cost specifically. Fourth, we suggest a broadcast algorithm with a time complexity of 2n − 2. Finally, we prove that RBGn embedded into hypercube Qn results in dilation n, and expansion 1, and congestion 7.
KeywordsRotational binary graph Graph Interconnection network Torus Hypercube
This research was supported by Basic Science Research Program through the National Research Foundation of Korea (NRF) funded by the Ministry of Education (2017R1D1A3B03032173).
- 3.McDonald N, Adriana F, Davis A, Isaev M, Kim J, Gibson D (2018) SuperSim: extensible flit-level simulation of large-scale interconnection networks. In: 2018 IEEE International Symposium on Performance Analysis of Systems and Software (ISPASS). IEEE, pp 87–98Google Scholar
- 5.Rahman MMH, Mohammed NMA, Adamu AI, Dhiren KB, Yasuyuki M, Yasushi I (2019) A New static cost-effective parameter for interconnection networks of massively parallel computer systems. In: Soft computing data analytics. Springer, Singapore, pp 147–155Google Scholar
- 18.Parhami B, Yeh CH (2000) Why network diameter is still important. In: Proceedings of International Conference on Communications in Computing, pp 271–274Google Scholar
- 22.Seo JH, Lee H (2016) Embedding algorithm among half pancake, pancake, and star graphs. Int J Softw Eng Appl 10(3):191–204Google Scholar