Recursive dual-net: A new versatile network for supercomputers of the next generation
In this paper, we propose a new versatile network, called a recursive dual-net (RDN), as a potential candidate for the interconnection network of supercomputers of the next generation. The RDN is based on recursive dual-construction of a base network. A k-level recursive dualconstruction for k >...
Uloženo v:
| Vydáno v: | Journal of the Chinese Institute of Engineers Ročník 32; číslo 7; s. 931 - 938 |
|---|---|
| Hlavní autoři: | , , |
| Médium: | Journal Article |
| Jazyk: | angličtina |
| Vydáno: |
Taylor & Francis Group
01.11.2009
|
| Témata: | |
| ISSN: | 0253-3839, 2158-7299 |
| On-line přístup: | Získat plný text |
| Tagy: |
Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
|
| Shrnutí: | In this paper, we propose a new versatile network, called a recursive dual-net (RDN), as a potential candidate for the interconnection network of supercomputers of the next generation. The RDN is based on recursive dual-construction of a base network. A k-level recursive dualconstruction for k > 0 creates a network containing (2m)
2k
/2 nodes with node-degree d + k, where m and d are the number of nodes and the node-degree of the base network, respectively. The RDN is node and edge symmetric if the base network is node and edge symmetric. The RDN can contain a huge number of nodes, each with small node-degree and short diameter. For example, we can construct a symmetric RDN connecting more than 3-million nodes with only 6 links per node and a diameter of 22. We investigate the topological properties of the RDN and compare them to those of other networks including 3D torus, WK-recursive network, hypercube, cube-connected-cycle, and dual-cube. We also establish the efficient routing and broadcasting algorithms for the RDN. |
|---|---|
| ISSN: | 0253-3839 2158-7299 |
| DOI: | 10.1080/02533839.2009.9671580 |