The exchanged hypercube

被引：128
作者：
Loh, PKK
Hsu, WJ
Pan, Y
机构：
[1] Nanyang Technol Univ, Sch Comp Engn, Singapore 639798, Singapore
[2] Georgia State Univ, Dept Comp Sci, Atlanta, GA 30303 USA
来源：
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS | 2005年 / 16卷 / 09期
基金：
中国国家自然科学基金; 美国国家科学基金会;
关键词：
hypercube; network; topology; spanning tree; fault tolerance;
D O I：
10.1109/TPDS.2005.113
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
This paper presents the Exchanged Hypercube, a new interconnection network obtained by systematically removing links from a binary hypercube. It maintains several desirable properties of the binary hypercube yet with reduced interconnection complexity. We also introduce the Extended Binomial Tree, a spanning tree of the Exchanged Hypercube that preserves many desirable properties of the original Binomial Tree. A fault-tolerant routing strategy is also proposed for the Exchanged Hypercube.
引用
收藏
页码：866 / 874
页数：9
相关论文
共 27 条
[1]  
AUFDERHEIDE FM, 1995, P 7 ANN ACM S PAR AL, P119
[2]  
Chen M.-S., 1990, IEEE Transactions on Parallel and Distributed Systems, V1, P152, DOI 10.1109/71.80143
[3]   ADAPTIVE FAULT-TOLERANT ROUTING IN HYPERCUBE MULTICOMPUTERS [J].
CHEN, MS ;
SHIN, KG .
IEEE TRANSACTIONS ON COMPUTERS, 1990, 39 (12) :1406-1416
[4]   ON EMBEDDING BINARY-TREES INTO HYPERCUBES [J].
CHEN, WK ;
STALLMANN, MFM .
JOURNAL OF PARALLEL AND DISTRIBUTED COMPUTING, 1995, 24 (02) :132-138
[5]  
DALLY WJ, 1987, IEEE T COMPUT, V36, P547, DOI 10.1109/TC.1987.1676939
[6]  
DOLAN A, 1993, NETWORKS ALGORITHMS
[7]  
Grammatikakis M. D., 2001, PARALLEL SYSTEM INTE
[8]   FIBONACCI CUBES - A NEW INTERCONNECTION TOPOLOGY [J].
HSU, WJ .
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS, 1993, 4 (01) :3-12
[9]   Gaussian networks for scalable distributed systems [J].
Hsu, WJ ;
Chung, MJ ;
Hu, ZJ .
COMPUTER JOURNAL, 1996, 39 (05) :417-426
[10]   A nationwide parallel computing environment [J].
Kennedy, K ;
Bender, CF ;
Connolly, JWD ;
Hennessy, JL ;
Vernon, MK ;
Smarr, L .
COMMUNICATIONS OF THE ACM, 1997, 40 (11) :62-72
123