Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
Topological Properties of Hypercubes
IEEE Transactions on Computers
Adaptive Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Computers
IEEE Transactions on Computers
Introduction to parallel algorithms and architectures: array, trees, hypercubes
Introduction to parallel algorithms and architectures: array, trees, hypercubes
RH: A Versatile Family of Reduced Hypercube Interconnection Networks
IEEE Transactions on Parallel and Distributed Systems
Generalized Fibonacci cubes are mostly Hamiltonian
Journal of Graph Theory
On embedding binary trees into hypercubes
Journal of Parallel and Distributed Computing
Optimal trade-offs between size and slowdown for universal parallel networks
Proceedings of the seventh annual ACM symposium on Parallel algorithms and architectures
Reliable Unicasting in Faulty Hypercubes Using Safety Levels
IEEE Transactions on Computers
A nationwide parallel computing environment
Communications of the ACM
Communications of the ACM
Fault-tolerant routing on complete Josephus Cubes
ACSAC '01 Proceedings of the 6th Australasian conference on Computer systems architecture
Analysis and Design of Parallel Algorithms: Arithmetic and Matrix Problems
Analysis and Design of Parallel Algorithms: Arithmetic and Matrix Problems
Network Topology Optimization
A Fault-Tolerant Communication Scheme for Hypercube Computers
IEEE Transactions on Computers
Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Fibonacci Cubes-A New Interconnection Topology
IEEE Transactions on Parallel and Distributed Systems
An Adaptive Fault-Tolerant Routing Algorithm for Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
Ulysses: A Robust, Low-Diameter, Low-Latency Peer-ti-Peer Network
ICNP '03 Proceedings of the 11th IEEE International Conference on Network Protocols
IEEE Journal on Selected Areas in Communications
Embedding meshes into crossed cubes
Information Sciences: an International Journal
A Comment on "The Exchanged Hypercube'
IEEE Transactions on Parallel and Distributed Systems
The Journal of Supercomputing
Cycles embedding in exchanged hypercubes
Information Processing Letters
General biswapped networks and their topological properties
APPT'07 Proceedings of the 7th international conference on Advanced parallel processing technologies
The super connectivity of exchanged hypercubes
Information Processing Letters
HPGRID: a novel architectural model for resource management systems
Proceedings of the 2011 International Conference on Communication, Computing & Security
International Journal of Computer Applications in Technology
Generalized measures of fault tolerance in exchanged hypercubes
Information Processing Letters
Fault isolation and identification in general biswapped networks under the PMC diagnostic model
Theoretical Computer Science
The domination number of exchanged hypercubes
Information Processing Letters
| Hi-index | 0.00 |
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.