Set-to-Set Disjoint Paths Routing in Torus-Connected Cycles
Antoine Bossard, Keiichi Kaneko · IEICE Transactions on Information and Systems · 2016
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.