Adaptive Diagnosis in the Locally Twisted Cube

Han, Yuejuan; Fan, Jianxi; You, Lihua; Cheng, Baolei; Wang, Yan

doi:10.1109/paap.2012.24

Cited by 1 publication

(2 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, the diameter of hypercube increases rapidly with the expanding of network scale, and the connection complexity also grows dramatically. To equilibrate between network performance and communication costs, some variations of the hypercube have been proposed to enhance some of its features, such as the Möbius cube , the crossed cube , the twisted n‐cube , the twisted cube , the locally twisted cube , the spined cube , and so on. Network properties of these variations are approximate or even superior to hypercube.…”

Section: Introductionmentioning

confidence: 99%

“…Among these structures, the n-dimensional binary hypercube, or the n-cube, obtained extensive attention because of its attractive topological properties and has been used in both Intel's and NCUBE's computers [1].However, the diameter of hypercube increases rapidly with the expanding of network scale, and the connection complexity also grows dramatically. To equilibrate between network performance and communication costs, some variations of the hypercube have been proposed to enhance some of its features, such as the Möbius cube [2,3], the crossed cube [4][5][6][7], the twisted n-cube [8], the twisted cube [9][10][11], the locally twisted cube [12][13][14], the spined cube [15,16], and so on. Network properties of these variations are approximate or even superior to hypercube.…”

mentioning

confidence: 99%

See 1 more Smart Citation

The twisted crossed cube

Wang

Liang

et al. 2015

Concurrency and Computation

View full text Add to dashboard Cite

SUMMARYThe topology of interconnection networks plays an important role in the performance of parallel and distributed computing systems. In this paper, we propose a new interconnection network called twisted crossed cube (TCQ n ) and investigate its basic network properties in terms of the regularity, connectivity, fault tolerance, recursiveness, hamiltonicity and ability to simulate other architectures, and so on. Then, we develop an effective routing algorithm Route (u, v) for TCQ n that takes no more than d(u, v) + 1 steps for any two nodes (u, v) to communicate with each other, and the routing process shows that the diameter, wide diameter, and fault-tolerant diameter of TCQ n are about half of the corresponding diameters of the equivalent hypercube with the same dimension. In the end, by combining TCQ n with crossed cube (CQ n ), we propose a preferable dynamic network structure, that is, the dynamic crossed cube, which has the same network diameter as TCQ n /CQ n and better properties in other respects, for example, its connection complexity is half of that of TCQ n /CQ n when the network scale is large enough, and the number of its average routing steps is also much smaller than that in TCQ n /CQ n .

show abstract