The Community for Technology Leaders
2013 IEEE 19th International Symposium on High Performance Computer Architecture (HPCA) (1996)
San Jose, CA
Feb. 3, 1996 to Feb. 7, 1996
ISBN: 0-8186-7237-4
pp: 130
Guihai Chen , University of Hong Kong
Francis C. M. Lau , University of Hong Kong
ABSTRACT
Hypercube as a parallel interconnection network is of academic and engineering concerns for tens of years due to its many merits. However, its increasing node degree is an obvious weakness. Some networks such as Cube-Connected Circle and DeBruijn Network have been proposed to overcome the increasing degree of hypercube. In this paper, we present a new cost-effective network which outperforms the cube network. It can overcome the increasing degree of cube network while keeping the advantages of cube network such as logarithmic diameter, easy routing, optimal fault tolerance, and suitability for ASCEND/DESCEND class of parallel problems. Furthermore, the proposed network achieves the logarithmic diameter with a very small constant node degree, 3 or 4.
INDEX TERMS
Interconnection Network, Hypercube, r-Shuffle, Layout, Fault Tolerance
CITATION
Guihai Chen, Francis C. M. Lau, "The Shuffle-Ring: Overcoming the Increasing Degree of Hypercube", 2013 IEEE 19th International Symposium on High Performance Computer Architecture (HPCA), vol. 00, no. , pp. 130, 1996, doi:10.1109/HPCA.1996.501180
90 ms
(Ver 3.3 (11022016))