Hiroki Nagashima
ABSTRACT
The twisted crossed cube is a variant of the hypercube. It is promising as a topology of interconnection networks for massively parallel systems. In this paper, we propose an algorithm that constructs n disjoint paths between an arbitrary pair of nodes in an n-dimensional twisted crossed cube. We also prove that the algorithm is correct, its time complexity is O(n2), and the lengths of the paths constructed are at most 4n --- 8. In addition, we conducted a computer experiment to evaluate our algorithm. Experimental results showed that the maximum path lengths are at most 3n + 1.
- Antoine Bossard. 2014. A set-to-set disjoint paths routing algorithm in hyper-star graphs. ISCA International Journal of Computers and Their Applications 21, 1 (March 2014), 76--82.Google Scholar
- Antoine Bossard and Keiichi Kaneko. 2012. Node-to-Set Disjoint-path Routing in Hierarchical Cubic Networks. Comput. J. 55, 12 (Dec. 2012), 1440--1446. Google ScholarDigital Library
- Antoine Bossard and Keiichi Kaneko. 2012. The Set-to-Set Disjoint-Path Problem in Perfect Hierarchical Hypercubes. Comput. J. 55, 6 (June 2012), 769--775. Google ScholarDigital Library
- Antoine Bossard and Keiichi Kaneko. 2014. Set-to-Set Disjoint Paths Routing in Hierarchical Cubic Networks. Comput. J. 57, 2 (Feb. 2014), 332--337.Google Scholar
- Antoine Bossard and Keiichi Kaneko. 2014. Time Optimal Node-to-Set Disjoint Paths Routing in Hypercubes. Journal of Information Science and Engineering 30, 4 (July 2014), 1087--1093.Google Scholar
- Antoine Bossard and Keiichi Kaneko. 2015. A Node-to-Set Disjoint Paths Routing Algorithm in Torus-Connected Cycles. ISCA International Journal of Computers and their Applications 22, 1 (Jan. 2015), 22--30.Google Scholar
- Antoine Bossard and Keiichi Kaneko. 2016. A Set-to-Set Disjoint Paths Routing Algorithm in a Torus-Connected Cycles Network. In Proceedings of the 31st ISCA International Conference on Computers and Their Applications. 81--88.Google Scholar
- Antoine Bossard, Keiichi Kaneko, and Shietung Peng. 2015. Node-to-Set Disjoint Paths Routing in a Metacube. International Journal of High Performance Computing and Networking 8, 4 (Nov. 2015), 315--323. Google ScholarDigital Library
- M. Dietzfelbinger, S. Madhavapeddy, and Ivan H. Sudborough. 1991. Three Disjoint Path Paradigms in Star Networks. In Proceedings of the IEEE Symposium on Parallel and Distributed Processing. 400--406. Google ScholarDigital Library
- Qian-Ping Gu and Shietung Peng. 1996. Set-To-Set Fault Tolerant Routing in Star Graphs. IEICE Transactions on Information and Systems E79-D, 4 (April 1996), 282--289.Google Scholar
- Qian-Ping Gu and Shietung Peng. 1997. Node-to-Set Disjoint Paths Problem in Star Graphs. Inform. Process. Lett. 62, 4 (April 1997), 201--207. Google ScholarDigital Library
- Qian-Ping Gu and Shietung Peng. 1998. Node-to-Set and Setto-Set Cluster Fault Tolerant Routing in Hypercubes. Parallel Comput. 24, 8 (1998), 1245--1261. Google ScholarDigital Library
- Yukihiro Hamada, Feng Bao, Aohan Mei, and Yoshihide Igarashi. 1996. Nonadaptive Fault-Tolerant File Transmission in Rotator Graphs. IEICE Transactions on Fundamentals E79-A, 4 (April 1996), 477--482.Google Scholar
- Keiichi Kaneko. 2003. An Algorithm for Node-to-Set Disjoint Paths Problem in Burnt Pancake Graphs. IEICE Transactions on Information and Systems E86-D, 12 (Dec. 2003), 2588--2594.Google Scholar
- Keiichi Kaneko and Antoine Bossard. 2017. A Set-to-Set Disjoint Paths Routing Algorithm in Tori. International Journal of Networking and Computing 7, 2 (July 2017), 173--186.Google ScholarCross Ref
- Keiichi Kaneko and Naoki Sawada. 2007. An Algorithm for Node-to-Node Disjoint Paths Problem in Burnt Pancake Graphs. IEICE Transactions on Information and Systems E90-D, 1 (Jan. 2007), 306--313. Google ScholarDigital Library
- Keiichi Kaneko and Yasuto Suzuki. 2001. An Algorithm for Node-to-Set Disjoint Paths Problem in Rotator Graphs. IEICE Transactions on Information and Systems E84-D, 9 (Sept. 2001), 1155--1163.Google Scholar
- David Kocík, Yuki Hirai, and Keiichi Kaneko. 2016. Node-to-Set Disjoint Paths Problem in a Möbius Cube. IEICE Transactions on Information and Systems E99-D, 3 (March 2016), 708--713.Google Scholar
- David Kocík and Keiichi Kaneko. 2017. Node-to-Node Disjoint Paths Problem in a Möbius Cube. IEICE Transactions on Information and Systems E100-D, 8 (Aug. 2017), 1837--1843.Google Scholar
- S. Madhavapeddy and Ivan Hal Sudborough. 1990. A Topological Property of Hypercubes --- Node Disjoint Paths. In Proceedings of the Second IEEE Symposium on Parallel and Distributed Processing. 532--539. Google ScholarDigital Library
- Yasuto Suzuki and Keiichi Kaneko. 2003. An Algorithm for Node-Disjoint Paths in Pancake Graphs. IEICE Transactions on Information & Systems E86-D, 3 (March 2003), 610--615.Google Scholar
- Yasuto Suzuki and Keiichi Kaneko. 2008. The Container Problem in Bubble-Sort Graphs. IEICE Transactions on Information and Systems E91-D, 4 (April 2008), 1003--1009. Google ScholarDigital Library
- Xinyang Wang, Jianrong Liang, Deyu Qi, and Weiwei Lin. 2016. The twisted crossed cube. Concurrency and Computation: Practice and Experience 28 (2016), 1507--1526. Google ScholarDigital Library
Index Terms
- Node-to-node Disjoint Paths in Twisted Crossed Cubes
Recommendations
Fault-tolerant Routing Methods in Crossed Cubes
IAIT '18: Proceedings of the 10th International Conference on Advances in Information TechnologyIn this study, we propose two methods for fault-tolerant routing in the crossed cube. The first method, Method 1, at each node that has the message to the destination node, its neighbor nodes into the set of the forward neighbor nodes, the set of the ...
Node-pancyclicity and edge-pancyclicity of crossed cubes
Crossed cubes are important variants of the hypercubes. It has been proven that crossed cubes have attractive properties in Hamiltonian connectivity and pancyclicity. In this paper, we study two stronger features of crossed cubes. We prove that the n-...
The Möbius Cubes
The Möbius cubes are hypercube variants that give better performance with the same number of links and processors. We show that the diameter of the Möbius cubes is about one half the diameter of the equivalent hypercube, and that the average number of ...
Comments