The exchanged hypercube

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...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on parallel and distributed systems 2005-09, Vol.16 (9), p.866-874
Main Authors: Loh, P.K.K., Hsu, W.J., Pan, Y.
Format: Article
Language:English
Subjects:
Concurrent computing
Costs
Emulation
Fault tolerance
Hardware
Hypercube
Hypercubes
Multiprocessor interconnection networks
network
Network topology
Peer to peer computing
Routing
spanning tree
topology
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1045-9219
1558-2183
DOI:10.1109/TPDS.2005.113