IEICE Transactions on Information and Systems
Online ISSN : 1745-1361
Print ISSN : 0916-8532
Regular Section
Set-to-Set Disjoint Paths Routing in Torus-Connected Cycles
Antoine BOSSARDKeiichi KANEKO
Author information
JOURNALS FREE ACCESS

2016 Volume E99.D Issue 11 Pages 2821-2823

Details
Abstract

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.

Information related to the author
© 2016 The Institute of Electronics, Information and Communication Engineers
Previous article Next article
feedback
Top