论文标题
交换蜻蜓上的四种算法
Four Algorithms on the Swapped Dragonfly
论文作者
论文摘要
每组M路由器的交换蜻蜓和每个路由器的K全球端口表示为D3（K; M）[1]。它具有N = KMM路由器，是部分人口稠密的蜻蜓。在本文中研究了一只带有K和M受限的蜻蜓。有四种情况。矩阵产品：如果K是一个完美的正方形，则可以在Squareroot N回合中执行尺寸N的矩阵产品。全能交换：如果K和M具有共同的因素s，则可以在N/S回合中进行全能的交换。广播：如果D3（k，m）配备了同步源矢量标头，则可以以3倍/m的弹性执行X广播。上升延误：如果K和M是2的功率，则可以在尺寸n的布尔超立方体上以算法成本的两倍进行上升降低算法。在每种情况下，交换蜻蜓上的算法都没有链接冲突，并与HyperCube上的算法以及完全填充的蜻蜓上的算法进行了比较。交换蜻蜓上的结果比特殊情况更适用，因为D3（k，m）包含每条j的仿真，其j却小于k和/或l小于或等于m。 关键字：交换的互连网络，矩阵产品，全能，通用交换，布尔·超立方体，上升 - 降低算法，宽度铸件，边缘 - 迪斯 - 偶数跨越树。 参考文献[1] R. Draper。交换的蜻蜓，用于计算机科学的Arxiv：2202.01843。 1
The Swapped Dragonfly with M routers per group and K global ports per router is denoted D3(K;M) [1]. It has n=KMM routers and is a partially populated Dragonfly. A Swapped Dragonfly with K and M restricted is studied in this paper. There are four cases. matrix product: If K is a perfect square, a matrix product of size n can be performed in squareroot n rounds. all-to-all exchange: If K and M have a common factor s, an all-to-all exchange can be performed in n/s rounds. broadcast: If D3(K,M) is equipped with a synchronized source-vector header it can perform x broadcast in 3x/M rounds. ascend-descend: If K and M are powers of 2 an ascend-descend algorithm can be performed at twice the cost of the algorithm on a Boolean hypercube of size n. In each case the algorithm on the Swapped Dragonfly is free of link conflicts and is compared with algorithms on a hypercube as well as on the fully populated Dragonfly. The results on the Swapped Dragonfly are more applicable than the special cases because D3(K,M) contains emulations of every Swapped Dragonfly with J less than equal to K and/or L less than or equal to M. Keywords: Swapped Interconnection Network, Matrix Product, All-to-all, Universal Exchange, Boolean Hypercube, Ascend-descend algorithm, Broad- cast, Edge-disjoint spanning tree. References [1] R. Draper. The Swapped Dragonfly , ArXiv for Computer Science:2202.01843. 1
