 
|
|
|
ボサール アントワーヌ
Antoine Bossard ボサール アントワーヌ 所属 神奈川大学 情報学部 計算機科学科 神奈川大学大学院 理学研究科 理学専攻（情報科学領域） 職種 教授 |
|
| 言語種別 | 英語 |
| 発行・発表の年月 | 2021/04 |
| 形態種別 | 学術雑誌 |
| 査読 | 査読あり |
| 標題 | On solving the decycling problem in a torus network |
| 執筆形態 | 単著 |
| 掲載誌名 | Wireless Communications and Mobile Computing |
| 掲載区分 | 国外 |
| 出版社・発行元 | Wiley-Hindawi |
| 巻・号・頁 | 2021,pp.5598173:1-5598173:6 |
| 著者・共著者 | A. Bossard |
| 概要 | [Full paper] [WoS SCIE, 2021: WoS IF=2.146, WoS Q3]
Modern supercomputers are massively parallel systems: they embody thousands of computing nodes, and sometimes several millions. The torus topology has proven popular for the interconnect of these high-performance systems. This network topology is used by the no.1 in the world supercomputer as of Nov. 2020, Fugaku. Given the high number of compute nodes in such systems, efficient parallel processing is critical to maximise the computing performance. It is well known that cycles harm the parallel processing capacity of systems: for instance, deadlocks and starvations are two notorious issues of parallel computing that are directly linked to the presence of cycles. Hence, network decycling is an important issue, and it has been extensively discussed in the literature. We describe a decycling algorithm for the 3-dimensional k-ary torus topology and compare it with established results, both theoretically and experimentally. |
| DOI | 10.1155/2021/5598173 |
Copyright © Kanagawa University. All Rights Reserved.