Exploring the Galaxyfly Family to Build Flexible-Scale Interconnection Networks

Lei, Fei; Dong, Dezun; Liao, Xiangke

doi:10.1109/tpds.2021.3100783

Cited by 7 publications

(6 citation statements)

References 35 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Networks such as torus, hypercube or Flattened Butterfly have been shown to have lower performance than these baselines [7,24]. We also explored the Galaxyfly family of flexible low-diameter topologies [28]. A diameter-3 Galaxyfly is isomorphic to a Dragonfly, which is included in the comparison.…”

Section: Topologiesmentioning

confidence: 99%

PolarStar: Expanding the Scalability Horizon of Diameter-3 Networks

Lakhotia¹,

Monroe²,

Isham³

et al. 2023

Preprint

View full text Add to dashboard Cite

In this paper, we present PolarStar, a novel family of diameter-3 network topologies derived from the star product of two lowdiameter factor graphs. The proposed PolarStar construction gives the largest known diameter-3 network topologies for almost all radixes. When compared to state-of-the-art diameter-3 networks, PolarStar achieves 31% geometric mean increase in scale over Bundlefly, 91% over Dragonfly, and 690% over 3-D HyperX.PolarStar has many other desirable properties including a modular layout, large bisection, high resilience to link failures and a large number of feasible sizes for every radix. Our evaluation shows that it exhibits comparable or better performance than other diameter-3 networks under various traffic patterns.

show abstract

Section: Topologiesmentioning

confidence: 99%

PolarStar: Expanding the Scalability Horizon of Diameter-3 Networks

Lakhotia¹,

Monroe²,

Isham³

et al. 2023

Preprint

View full text Add to dashboard Cite

show abstract

“…Lei et al [20] proposed Galaxy graphs, which have a diameter of at most, 2. Galaxy graphs are designed to build flexible sized networks for a given number of routers and radii.…”

Section: Galaxy Graphmentioning

confidence: 99%

“…This poses a significant challenge for high-performance routers, particularly commercial-off-the-shelf (COTS) routers, to expand their radix, resulting in major hurdles for existing topologies to scale flexibly. To address this issue, Lei et al [20] introduced the Galaxyfly network, a flexible-radix low-diameter topology that achieves network flexibility under different configuration structures by reducing high-radix routers. The Galaxyfly network is composed of lots of supernodes, with routers within each supernode being fully connected.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

All-to-All Broadcast Algorithm in Galaxyfly Networks

Zhuang

Chang

et al. 2023

Mathematics

View full text Add to dashboard Cite

The design of interconnection networks is a fundamental aspect of high-performance computing (HPC) systems. Among the available topologies, the Galaxyfly network stands out as a low-diameter and flexible-radix network for HPC applications. Given the paramount importance of collective communication in HPC performance, in this paper, we present two different all-to-all broadcast algorithms for the Galaxyfly network, which adhere to the supernode-first rule and the router-first rule, respectively. Our performance evaluation validates their effectiveness and shows that the first algorithm has a higher degree of utilization of network channels, and that the second algorithm can significantly reduce the average time for routers to collect packets from the supernode.

show abstract

“…Graphs with smaller diameter are expected, because it determines the latency of one-to-one communication, one-to-all broadcast, and barrier synchronization of all host computers. 8,10 The degree diameter problem 24 is a classic problem to find a graph with the maximum number of vertices for given maximum degree Δ and diameter D, where the degree of a vertex is the number of edges connected to each vertex. For example, let us consider the Petersen graph.…”

Section: Introductionmentioning

confidence: 99%

Designing low‐diameter interconnection networks with multi‐ported host‐switch graphs

Yasudo

Nakano

Koibuchi

et al. 2020

Concurrency and Computation

View full text Add to dashboard Cite

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.

show abstract

Exploring the Galaxyfly Family to Build Flexible-Scale Interconnection Networks

Cited by 7 publications

References 35 publications

PolarStar: Expanding the Scalability Horizon of Diameter-3 Networks

PolarStar: Expanding the Scalability Horizon of Diameter-3 Networks

All-to-All Broadcast Algorithm in Galaxyfly Networks

Designing low‐diameter interconnection networks with multi‐ported host‐switch graphs

Contact Info

Product

Resources

About