研究者情報 | 神奈川大学

ボサール　アントワーヌ Antoine Bossard ボサール　アントワーヌ所属神奈川大学情報学部計算機科学科神奈川大学大学院理学研究科理学専攻（情報科学領域）職種教授
言語種別	英語
発行・発表の年月	2017/07
形態種別	学術雑誌
査読	査読あり
標題	A set-to-set disjoint paths routing algorithm in tori
執筆形態	共著
掲載誌名	International Journal of Networking and Computing
掲載区分	国内
巻・号・頁	7(2),pp.173-186
著者・共著者	K. Kaneko, A. Bossard
概要	[Full paper] [WoS IF=N/A] Numerous TOP500 supercomputers are based on a torus interconnection network. The torus topology is effectively one of the most popular interconnection networks for massively parallel systems due to its interesting topological properties such as symmetry and simplicity. For instance, the world-famous supercomputers Fujitsu K, IBM Blue Gene/L, IBM Blue Gene/P and Cray XT3 are all torus-based. In this paper, we propose an algorithm that constructs 2n mutuallynode-disjoint paths from a set S of 2n source nodes to a set D of 2n destination nodes in an n-dimensional k-ary torus T{n,k} (n>=1, k>=3). This algorithm is then formally evaluated. We have proved that the paths selected by the proposed algorithm have lengths at most 2(k+1)n and can be obtained with a time complexity of O(kn^3+n^3 log n).
DOI	10.15803/ijnc.7.2_173