DocumentCode
1125923
Title
The exchanged hypercube
Author
Loh, Peter K K ; Hsu, Wen Jing ; Pan, Yi
Author_Institution
Sch. of Comput. Eng., Nanyang Technol. Univ., Singapore
Volume
16
Issue
9
fYear
2005
Firstpage
866
Lastpage
874
Abstract
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.
Keywords
communication complexity; fault tolerance; hypercube networks; telecommunication network routing; telecommunication network topology; tree searching; binary hypercube; exchanged hypercube network; extended binomial tree; fault-tolerant routing strategy; interconnection complexity; interconnection network; network topology; spanning tree; Concurrent computing; Costs; Emulation; Fault tolerance; Hardware; Hypercubes; Multiprocessor interconnection networks; Network topology; Peer to peer computing; Routing; Hypercube; fault tolerance.; network; spanning tree; topology;
fLanguage
English
Journal_Title
Parallel and Distributed Systems, IEEE Transactions on
Publisher
ieee
ISSN
1045-9219
Type
jour
DOI
10.1109/TPDS.2005.113
Filename
1490516
Link To Document