  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
