A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The exchanged hypercube
2005
IEEE Transactions on Parallel and Distributed Systems
Preserved Fulltext
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. Index
doi:10.1109/tpds.2005.113
fatcat:74ajdvdkxvc2fcw3uy42cxczoa