Torus Pairwise Disjoint-Path Routing

• Published in: Sensors (Basel, Switzerland) Switzerland), 2018-11, Vol.18 (11), p.3912
• Main Authors: Bossard, Antoine, Kaneko, Keiichi
• Format: Article
• Language: English
• Subjects: algorithm; fault tolerance; interconnect; parallel processing; system dependability
• ISSN: 1424-8220; 1424-8220
• DOI: 10.3390/s18113912

Modern supercomputers include hundreds of thousands of processors and they are thus massively parallel systems. The interconnection network of a system is in charge of mutually connecting these processors. Recently, the torus has become a very popular interconnection network topology. For example, the Fujitsu K, IBM Blue Gene/L, IBM Blue Gene/P, and Cray Titan supercomputers all rely on this topology. The pairwise disjoint-path routing problem in a torus network is addressed in this paper. This fundamental problem consists of the selection of mutually vertex disjoint paths between given vertex pairs. Proposing a solution to this problem has critical implications, such as increased system dependability and more efficient data transfers, and provides concrete implementation of green and sustainable computing as well as security, privacy, and trust, for instance, for the Internet of Things (IoT). Then, the correctness and complexities of the proposed routing algorithm are formally established. Precisely, in an -dimensional -ary torus ( n < k , k ≥ 5 ), the proposed algorithm connects ( c ≤ n ) vertex pairs with mutually vertex-disjoint paths of lengths at most 2 k ( c - 1 ) + n ⌊ k / 2 ⌋ , and the worst-case time complexity of the algorithm is O ( n c 4 ) . Finally, empirical evaluation of the proposed algorithm is conducted in order to inspect its practical behavior.