Name
Abstract | ||
|---|---|---|
Dragonfly networks have been widely used in the current High Performance Computing (HPC) computers due to lower global network diameter and other advantages of communication performance such as modularity and cost-effectiveness. The original definition of the dragonfly network was very loose on account of its uncertain and diversified global link arrangements. In this paper, we study the logical structure of the dragonfly network which can be treated as a compound graph of complete graphs. Firstly, we give the general definition of the dragonfly network, named DF(n,h,g), and the specific definition of the dragonfly network under the relative global link arrangement, named D(n,h). Then, we prove that the connectivity of D(n,h) is n−1+h. In the end, we propose an O(n) algorithm to give the disjoint path between any two distinct vertices in D(n,h) and analyze the maximum length of these disjoint paths which is no more than 7. |
Year | DOI | Venue |
|---|---|---|
2022 | 10.1016/j.tcs.2022.04.028 | Theoretical Computer Science |
Keywords | DocType | Volume |
Dragonfly networks,Connectivity,Disjoint path,Interconnection network | Journal | 922 |
ISSN | Citations | PageRank |
0304-3975 | 0 | 0.34 |
References | Authors | |
0 | 5 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Suying Wu | 1 | 0 | 0.34 |
| Jianxi Fan | 2 | 718 | 60.15 |
| Baolei Cheng | 3 | 25 | 2.76 |
| Jia Yu | 4 | 475 | 57.62 |
| Yan Wang | 5 | 4 | 2.08 |