Designing low‐diameter interconnection networks with multi‐ported host‐switch graphs
Designing low‐diameter interconnection networks with multi‐ported host‐switch graphs
复制标题
DOI：
10.1002/cpe.6115
复制
发表时间：
2020-12
期刊：
影响因子：
--
通讯作者：
Ryota Yasudo;K. Nakano;M. Koibuchi;Hiroki Matsutani;H. Amano
中科院分区：
文献类型：
--
作者：
Ryota Yasudo;K. Nakano;M. Koibuchi;Hiroki Matsutani;H. Amano
主机交换机图最初被提议为表示具有 1 端口主机和 Δ 端口交换机的计算机系统的网络拓扑的图。从理论和实践两个方面对它的直径、平均最短路径长度和实际应用的性能进行了研究。然而，在最近的高性能计算系统中，主机通过使用InfiniBand、NVSwitch或Omni-Path连接到多个交换机，因此它们提供高带宽。由于主机交换机图无法表示此类系统，因此本文扩展了主机交换机图，使其可以表示此类系统。因此，主机交换机图可以包括多端口主机。此外，我们建议使用多端口主机来减小直径。我们证明直径最小化相当于解决直径为三的二部图的度直径问题。我们的实验结果表明，与单端口主机的网络相比，我们可以大幅减小直径并增加带宽，并将 MPI 应用程序的性能提高高达 162%。
A host‐switch graph was originally proposed as a graph that represents a network topology of a computer systems with 1‐port host computers and Δ ‐port switches. It has been studied from both theoretical and practical aspects in terms of the diameter, the average shortest path length, and the performance of real applications. In recent high‐performance computing systems, however, a host computer is connected to multiple switches by using InfiniBand, NVSwitch, or Omni‐Path, and consequently they provide high bandwidths. Since a host‐switch graph cannot represent such systems, this article extends a host‐switch graph so that it can represent such systems. As a result, a host‐switch graph can include multi‐ported hosts. Furthermore, we propose to use multi‐port hosts for reducing the diameter. We show that the diameter minimization is equivalent to solving the degree diameter problem for bipartite graphs of diameter three. Our experimental results show that we can drastically reduce the diameter as well as increasing the bandwidth and improves performance of MPI applications by up to 162% as compared with networks with single‐ported hosts.