IEICE TRANSACTIONS on Information
Set-to-Set Disjoint Paths Routing in Torus-Connected Cycles
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information 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
Authors
Antoine BOSSARD
Kanagawa University
Keiichi KANEKO
Tokyo University of Agriculture and Technology
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Antoine BOSSARD, Keiichi KANEKO, "Set-to-Set Disjoint Paths Routing in Torus-Connected Cycles" in IEICE TRANSACTIONS on Information,
vol. E99-D, no. 11, pp. 2821-2823, November 2016, doi: 10.1587/transinf.2016EDL8099.
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.
URL: https://global.ieice.org/en_transactions/information/10.1587/transinf.2016EDL8099/_p
Copy
@ARTICLE{e99-d_11_2821,
author={Antoine BOSSARD, Keiichi KANEKO, },
journal={IEICE TRANSACTIONS on Information},
title={Set-to-Set Disjoint Paths Routing in Torus-Connected Cycles},
year={2016},
volume={E99-D},
number={11},
pages={2821-2823},
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.},
keywords={},
doi={10.1587/transinf.2016EDL8099},
ISSN={1745-1361},
month={November},}
Copy
TY - JOUR
TI - Set-to-Set Disjoint Paths Routing in Torus-Connected Cycles
T2 - IEICE TRANSACTIONS on Information
SP - 2821
EP - 2823
AU - Antoine BOSSARD
AU - Keiichi KANEKO
PY - 2016
DO - 10.1587/transinf.2016EDL8099
JO - IEICE TRANSACTIONS on Information
SN - 1745-1361
VL - E99-D
IS - 11
JA - IEICE TRANSACTIONS on Information
Y1 - November 2016
AB - 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.
ER -
English
