Papers
Topics
Authors
Recent
Search
2000 character limit reached

The Swapped Dragonfly

Published 3 Feb 2022 in cs.DC | (2202.01843v1)

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

Citations (2)

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.