J-STAGE Home  >  Publications - Top  > Bibliographic Information

IEICE Transactions on Information and Systems
Vol. E99.D (2016) No. 11 pp. 2821-2823

Language:

http://doi.org/10.1587/transinf.2016EDL8099

Regular Section

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.

Copyright © 2016 The Institute of Electronics, Information and Communication Engineers

Article Tools

Share this Article