Abstract
Recently, an explosive increase of demand on space- and time-consuming computation makes the research activities of massively parallel systems enthusiastic. Because in a massively parallel system a huge number of processors cooperate to process tasks by communicating among others, it forms an interconnection network, which is a network that interconnects the processors. By replacing a processor and a link with a vertex and an edge, respectively, many problems regarding communication and/or routing in interconnection networks are reducible to the problems in the graph theory. There have been many topologies proposed for interconnection networks of the massively parallel systems. The hypercube is the most popular topology and many variants were proposed so far. The bicube is a such topology, which can connect the same number of vertices with the same number degree as the hypercube while its diameter is almost half of that of the hypercube keeping the vertex-symmetric property. Therefore, we focus on the bicube and propose a shortest-path routing algorithm. We give a proof of correctness of the algorithm and demonstrate its execution.
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
References
P. Cull, S.M. Larson, The Möbius cubes. IEEE Trans. Comput. 44(5), 647–659 (1995)
K. Efe, The crossed cube architecture for parallel computing. IEEE Trans. Parallel Distrib. Syst. 3(5), 513–524 (1992)
P.A.J. Hilbers, M.R. Koopman, J.L.A. van de Snepscheut, The twisted cube, in Volume I: Parallel Architectures on PARLE: Parallel Architectures and Languages Europe (Springer, London, 1987), pp. 152–159. http://dl.acm.org/citation.cfm?id=25489.25499
H.S. Lim, J.H. Park, H.C. Kim, The bicube: an interconnection of two hypercubes. Int. J. Comput. Math. 92(1), 29–40 (2015)
C.L. Seitz, The cosmic cube. Commun. ACM 28(1), 22–33 (1985)
X. Wang, J. Liang, D. Qi, W. Lin, The twisted crossed cube. Concurrency Comput. Pract. Exp. 28, 1507–1526 (2016)
X. Yang, D.J. Evans, G.M. Megson, The locally twisted cubes. Int. J. Comput. Math. 82(4), 401–413 (2005)
W.J. Zhou, J.X. Fan, X.H. Jia, S.K. Zhang, The spined cube: a new hypercube variant with smaller diameter. Inf. Process. Lett. 111(12), 561–567 (2011)
A. Bossard, K. Kaneko, Time optimal node-to-set disjoint paths routing in hypercubes. J. Inf. Sci. Eng. 30(4), 1087–1093 (2014)
D.T. Duong, K. Kaneko, Fault-tolerant routing based on approximate directed routable probabilities for hypercubes. Futur. Gener. Comput. Syst. 37, 88–96 (2014). https://doi.org/10.1016/j.future.2013.12.003. http://www.sciencedirect.com/science/article/pii/S0167739X13002677
Z. Liu, J. Fan, X. Jia, Complete binary trees embeddings in Möbius cubes. J. Comput. Syst. Sci. 82(2), 260–281 (2016). https://doi.org/10.1016/j.jcss.2015.09.004. http://www.sciencedirect.com/science/article/pii/S0022000015001026
D. KocÃk, Y. Hirai, K. Kaneko, Node-to-set disjoint paths problem in a Möbius cube. IEICE Trans. Inf. Syst. E99-D(3), 708–713 (2016)
D. KocÃk, K. Kaneko, Node-to-node disjoint paths problem in a Möbius cube. IEICE Trans. Inf. Syst. E100-D(8), 1837–1843 (2017)
K. Satoh, K. Mouri, K. Kaneko, A fully adaptive minimal routing algorithm in a crossed cube, in Proceedings of 2018 International Conference on Parallel and Distributed Processing Techniques and Applications (2018), pp. 183–189
B. Cheng, J. Fan, Q. Lyu, J. Zhou, Z. Liu, Constructing independent spanning trees with height n on the n-dimensional crossed cube. Futur. Gener. Comput. Syst. 87, 404–415 (2018). https://doi.org/10.1016/j.future.2018.02.010. http://www.sciencedirect.com/science/article/pii/S0167739X18302723
C.P. Chang, J.N. Wang, L.H. Hsu, Topological properties of twisted cube. Inf. Sci. 113(1–2), 147–167 (1999)
W.T. Huang, J.J. Tan, C.N. Hung, L.H. Hsu, Fault-tolerant hamiltonicity of twisted cubes. J. Parallel Distrib. Comput. 62(4), 591–604 (2002). https://doi.org/10.1006/jpdc.2001.1813. http://www.sciencedirect.com/science/article/pii/S0743731501918131
H. Nagashima, K. Mouri, K. Kaneko, Node-to-node disjoint paths in twisted crossed cubes, in Proceedings of the 10th International Conference on Advances in Information Technology (2018), pp. 5:1–5:8. https://doi.org/10.1145/3291280.3291785
Z. Liu, J. Fan, J. Zhou, B. Cheng, X. Jia, Fault-tolerant embedding of complete binary trees in locally twisted cubes. J. Parallel Distrib. Comput. 101, 69–78 (2017). https://doi.org/10.1016/j.jpdc.2016.11.005. http://www.sciencedirect.com/science/article/pii/S0743731516301496
Y. Takano, K. Kaneko, Stochastic fault-tolerant routing in locally twisted cubes, in Proceedings of the 2017 6th ICT International Student Project Conference, pp. 1–4 (2017). https://doi.org/10.1109/ICT-ISPC.2017.8075317
K. Satoh, K. Kaneko, P.T.H. Hanh, H.T.T. Binh, Shortest-path routing in spined cubes, in Proceedings of the 2017 6th ICT International Student Project Conference (2017), pp. 1–4. https://doi.org/10.1109/ICT-ISPC.2017.8075349
Acknowledgements
The authors would like to express special thanks to the reviewers for their insightful comments and suggestions. This study was partly supported by a Grant-in-Aid for Scientific Research (C) of the Japan Society for the Promotion of Science under Grant No. 20K11729.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2021 Springer Nature Switzerland AG
About this paper
Cite this paper
Okada, M., Kaneko, K. (2021). A Shortest-Path Routing Algorithm in Bicubes. In: Arabnia, H.R., et al. Advances in Parallel & Distributed Processing, and Applications. Transactions on Computational Science and Computational Intelligence. Springer, Cham. https://doi.org/10.1007/978-3-030-69984-0_38
Download citation
DOI: https://doi.org/10.1007/978-3-030-69984-0_38
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-69983-3
Online ISBN: 978-3-030-69984-0
eBook Packages: Computer ScienceComputer Science (R0)