Optimal Low-Latency Network Topologies for Cluster Performance Enhancement

04/01/2019
by   Yuefan Deng, et al.
0

We propose that clusters interconnected with network topologies having minimal mean path length will increase their overall performance for a variety of applications. We approach our heuristic by constructing clusters of up to 36 nodes having Dragonfly, torus, ring, Chvatal, Wagner, Bidiakis and several other topologies with minimal mean path lengths and by simulating the performance of 256-node clusters with the same network topologies. The optimal (or sub-optimal) low-latency network topologies are found by minimizing the mean path length of regular graphs. The selected topologies are benchmarked using ping-pong messaging, the MPI collective communications, and the standard parallel applications including effective bandwidth, FFTE, Graph 500 and NAS parallel benchmarks. We established strong correlations between the clusters' performances and the network topologies, especially the mean path lengths, for a wide range of applications. In communication-intensive benchmarks, clusters with optimal network topologies out-perform those with mainstream topologies by several folds. It is striking that a mere adjustment of the network topology suffices to reclaim performance from the same computing hardware.

READ FULL TEXT
POST COMMENT

Comments

There are no comments yet.

Authors

page 3

page 13

01/04/2022

Optimal circulant graphs as low-latency network topologies

Communication latency has become one of the determining factors for the ...
10/29/2019

A Structured Table of Graphs with Symmetries and Other Special Properties

We organize a table of regular graphs with minimal diameters and minimal...
02/07/2022

Optimal Direct-Connect Topologies for Collective Communications

We consider the problem of distilling optimal network topologies for col...
10/19/2020

Trade-off between accuracy and tractability of network calculus in FIFO networks

Computing accurate deterministic performance bounds is a strong need for...
04/23/2021

SpectralFly: Ramanujan Graphs as Flexible and Efficient Interconnection Networks

In recent years, graph theoretic considerations have become increasingly...
04/26/2021

A PGAS Communication Library for Heterogeneous Clusters

This work presents a heterogeneous communication library for clusters of...
10/29/2019

A Structured Table of Graphs with Special Properties

We organize a table of regular graphs with minimal diameters and mean pa...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.