Set-to-Set Disjoint Paths Routing in Torus-Connected Cycles

Antoine BOSSARD  Keiichi KANEKO  

IEICE TRANSACTIONS on Information and Systems   Vol.E99-D   No.11   pp.2821-2823
Publication Date: 2016/11/01
Publicized: 2016/08/10
Online ISSN: 1745-1361
DOI: 10.1587/transinf.2016EDL8099
Type of Manuscript: LETTER
Category: Dependable Computing
torus,  many-to-many,  parallel system,  fault-tolerance,  dependable,  supercomputer,  

Full Text: PDF>>
Buy this Article

Extending the very popular tori interconnection networks[1]-[3], Torus-Connected Cycles (TCC) have been proposed as a novel network topology for massively parallel systems [5]. Here, the set-to-set disjoint paths routing problem in a TCC is solved. In a TCC(k,n), it is proved that paths of lengths at most kn2+2n can be selected in O(kn2) time.