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

08/02/2022
by   Kartik Lakhotia, et al.
0

In this paper we present PolarFly, a diameter-2 network topology based on the Erdos-Renyi family of polarity graphs from finite geometry. This is the first known diameter-2 topology that asymptotically reaches the Moore bound on the number of nodes for a given network degree and diameter. PolarFly achieves high Moore bound efficiency even for the moderate radixes commonly seen in current and near-future routers, reaching more than 96 theoretical peak. It also offers more feasible router degrees than the state-of-the-art solutions, greatly adding to the selection of scalable diameter-2 networks. PolarFly enjoys many other topological properties highly relevant in practice, such as a modular design and expandability that allow incremental growth in network size without rewiring the whole network. Our evaluation shows that PolarFly outperforms competitive networks in terms of scalability, cost and performance for various traffic patterns.

READ FULL TEXT
research
02/14/2023

PolarStar: Expanding the Scalability Horizon of Diameter-3 Networks

In this paper, we present PolarStar, a novel family of diameter-3 networ...
research
12/19/2019

Slim Fly: A Cost Effective Low-Diameter Network Topology

We introduce a high-performance cost-effective network topology called S...
research
08/16/2020

Diameter Polytopes of Feasible Binary Programs

Feasible binary programs often have multiple optimal solutions, which is...
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
11/23/2019

Oriented Diameter of Star Graphs

An orientation of an undirected graph G is an assignment of exactly one...
research
03/23/2020

On the diameter of the polytope of the stable marriage with ties

The stable marriage problem with ties is a well-studied and interesting ...
research
09/14/2019

Optimal Routing for a Family of Scalable Interconnection Networks

Scalability of interconnection networks for the supercomputers, particul...

Please sign up or login with your details

Forgot password? Click here to reset