The Swapped Dragonfly

TL;DR

The paper introduces the Swapped Dragonfly, a scalable interconnection network with a unique coordinate system enabling conflict-free parallel routing and an efficient all-to-all communication algorithm.

Contribution

It presents a novel Dragonfly variant with a swapped coordinate system, supporting conflict-free parallelism and a new all-to-all algorithm, differing from standard Dragonflies.

Findings

Supports conflict-free parallelism over various network components

Enables source-vector routing for efficient data transfer

Includes an all-to-all algorithm beyond pairwise exchange

Abstract

This paper describes the Swapped Dragonfly. It is a two-parameter family of diameter three interconnection networks, D3(K,M), which are linearly scalable in M. Although D3(K,M) is a Dragonfly, it differs from standard Dragonflies in many respects. It has a K by M by M coordinate system (c;d; p). The routers (c,d,p) and (c',p,d) are globally connected using a swap of p and d. If L < K and/or N < M, D3(K;M) contains D3(L,N). The coordinate system enables source vector routing on D3(K,M). A source-vector induces KM squared parallel paths on D3(K,M). Because of this, the Swapped Dragonfly can support conflict-free parallelism over local ports, global ports, routers and source-vectors. In particular, there is an all-to-all algorithm which is not a pairwise exchange algorithm. Keywords: interconnection network, Dragonfly network, swapped network, source-vector routing, all-to-all exchange