International Journal of Networking and Computing
Online ISSN : 2185-2847
Print ISSN : 2185-2839
ISSN-L : 2185-2839
Special Issue on the Fourth International Symposium on Computing and Networking
A Set-to-Set Disjoint Paths Routing Algorithm in Tori
Keiichi KanekoAntoine Bossard
Author information
JOURNAL OPEN ACCESS

2017 Volume 7 Issue 2 Pages 173-186

Details
Abstract
Numerous TOP500 supercomputers are based on a torus interconnection network. The torus topology is effectively one of the most popular interconnection networks for massively parallel systems due to its interesting topological properties such as symmetry and simplicity. For instance, the world-famous supercomputers Fujitsu K, IBM Blue Gene/L, IBM Blue Gene/P and Cray XT3 are all torus-based. In this paper, we propose an algorithm that constructs 2n mutually node-disjoint paths from a set S of 2n source nodes to a set D of 2n destination nodes in an n-dimensional k-ary torus Tn,k(n≥1, k≥3). This algorithm is then formally evaluated. We have proved that the paths selected by the proposed algorithm have lengths at most 2(k+1)n and can be obtained with a time complexity of O(kn3n3 log n).
Content from these authors
Previous article Next article
feedback
Top