Slim Fly: A Cost Effective Low-Diameter Network Topology

12/19/2019
by   Maciej Besta, et al.
0

We introduce a high-performance cost-effective network topology called Slim Fly that approaches the theoretically optimal network diameter. Slim Fly is based on graphs that approximate the solution to the degree-diameter problem. We analyze Slim Fly and compare it to both traditional and state-of-the-art networks. Our analysis shows that Slim Fly has significant advantages over other topologies in latency, bandwidth, resiliency, cost, and power consumption. Finally, we propose deadlock-free routing schemes and physical layouts for large computing centers as well as a detailed cost and power model. Slim Fly enables constructing cost effective and highly resilient datacenter and HPC networks that offer low latency and high bandwidth under different HPC workloads such as stencil or graph computations.

READ FULL TEXT
research
07/07/2020

High-Performance Routing with Multipathing and Path Diversity in Ethernet and HPC Networks

The recent line of research into topology design focuses on lowering net...
research
06/26/2019

FatPaths: Routing in Supercomputers, Data Centers, and Clouds with Low-Diameter Networks when Shortest Paths Fall Short

We introduce FatPaths: a simple, generic, and robust routing architectur...
research
08/02/2022

PolarFly: A Cost-Effective and Flexible Low-Diameter Topology

In this paper we present PolarFly, a diameter-2 network topology based o...
research
11/25/2022

HexaMesh: Scaling to Hundreds of Chiplets with an Optimized Chiplet Arrangement

2.5D integration is an important technique to tackle the growing cost of...
research
04/23/2021

SpectralFly: Ramanujan Graphs as Flexible and Efficient Interconnection Networks

In recent years, graph theoretic considerations have become increasingly...
research
10/21/2020

Slim NoC: A Low-Diameter On-Chip Network Topology for High Energy Efficiency and Scalability

Emerging chips with hundreds and thousands of cores require networks wit...
research
09/25/2019

Ramanujan Graphs and the Spectral Gap of Supercomputing Topologies

Graph eigenvalues play a fundamental role in controlling structural prop...

Please sign up or login with your details

Forgot password? Click here to reset