On Solving the Decycling Problem in a Torus Network
On Solving the Decycling Problem in a Torus Network
复制标题
解决环面网络中的退循环问题
DOI：
10.1155/2021/5598173
复制
发表时间：
2021
影响因子：
--
通讯作者：
Antoine Bossard
中科院分区：
文献类型：
--
作者：
Antoine Bossard;Antoine Bossard
现代超级计算机是大规模并行系统：它们包含数千个计算节点，有时甚至数百万个。事实证明，环面拓扑非常适合这些高性能系统的互连。值得注意的是，截至2020年11月，世界排名第一的超级计算机Fugaku采用了这种网络拓扑结构。考虑到此类系统中的计算节点数量很多，高效的并行处理对于最大化计算性能至关重要。众所周知，循环会损害系统的并行处理能力：例如，死锁和饥饿是并行计算中两个臭名昭著的问题，它们直接与循环的存在有关。因此，网络去循环是一个重要的问题，它已经在文献中广泛讨论。本文描述了一种三维k元环面拓扑的去循环算法，并将其与已有的理论和实验结果进行了比较。(This本文是Antoine Bossard（2020）的修订版）。
Modern supercomputers are massively parallel systems: they embody thousands of computing nodes and sometimes several millions. The torus topology has proven very popular for the interconnect of these high‐performance systems. Notably, this network topology is employed by the supercomputer ranked number one in the world as of November 2020, the supercomputer 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 in this paper a decycling algorithm for the 3‐dimensionalk‐ary torus topology and compare it with established results, both theoretically and experimentally. (This paper is a revised version of Antoine Bossard (2020)).