|
|
ボサール アントワーヌ
Antoine Bossard ボサール アントワーヌ 所属 神奈川大学 情報学部 計算機科学科 神奈川大学大学院 理学研究科 理学専攻(情報科学領域) 職種 教授 |
|
言語種別 | 英語 |
発行・発表の年月 | 2020/06 |
形態種別 | 学術雑誌 |
査読 | 査読あり |
標題 | Cluster-fault tolerant routing in a torus |
執筆形態 | 共著 |
掲載誌名 | Sensors |
掲載区分 | 国外 |
巻・号・頁 | 20(11),pp.3286 |
著者・共著者 | A. Bossard and K. Kaneko |
概要 | [Full paper] [WoS SCIE, 2021: WoS IF=3.847, WoS Q2]
The number of Internet-connected devices grows very rapidly, and so is the number of sensors, thus inducing large sensor networks. The comparison with the huge number of processors of modern supercomputers is insightful. In such large networks, node faults necessarily arise, with faults often happening in clusters. The tolerance to faults, and especially cluster faults, is thus critical. The torus interconnect has been adopted by the major supercomputer manufacturers. Acknowledging and embracing these two technological and industrial aspects, we propose a node-to-node routing algorithm in an n-dimensional k-ary torus that is tolerant to faults. Not only is this algorithm tolerant to faulty nodes, it also tolerates faulty node clusters. It selects a fault-free path of length at most n(2k + \lfloor k/2\rfloor - 2) with an O(n^2 k^2 |F|) worst-case time complexity with F the set of faulty nodes induced by the faulty clusters. |
DOI | 10.3390/s20113286 |