The C++ programming language
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
A high-speed message-driven communication architecture
ICS '88 Proceedings of the 2nd international conference on Supercomputing
Networks for parallel processors: measurements and prognostications
C3P Proceedings of the third conference on Hypercube concurrent computers and applications: Architecture, software, computer systems, and general issues - Volume 1
Concurrent I/O system for the hypercube multiprocessor
C3P Proceedings of the third conference on Hypercube concurrent computers and applications - Volume 2
Adaptive Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Computers
Proceedings of the 1990 ACM/IEEE conference on Supercomputing
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Routing in Mesh Architectures
IEEE Transactions on Parallel and Distributed Systems
Ariadne—an adaptive router for fault-tolerant multicomputers
ISCA '94 Proceedings of the 21st annual international symposium on Computer architecture
Optimal and Suboptimal Processor Allocation for Hypercycle-based Multiprocessors
IEEE Transactions on Parallel and Distributed Systems
A Family of Fault-Tolerant Routing Protocols for Direct Multiprocessor Networks
IEEE Transactions on Parallel and Distributed Systems
Compressionless Routing: A Framework for Adaptive and Fault-Tolerant Routing
IEEE Transactions on Parallel and Distributed Systems
Design and Evaluation of Hardware Strategies for Reconfiguring Hypercubes and Meshes Under Faults
IEEE Transactions on Computers
Subcube Fault Tolerance in Hypercube Multiprocessors
IEEE Transactions on Computers
Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
A Top-Down Processor Allocation Scheme for Hypercube Computers
IEEE Transactions on Parallel and Distributed Systems
An Efficient Modular Spare Allocation Scheme and Its Application to Fault Tolerant Binary Hypercubes
IEEE Transactions on Parallel and Distributed Systems
A Virtual Bus Architecture for Dynamic Parallel Processing
IEEE Transactions on Parallel and Distributed Systems
Routing in Modular Fault-Tolerant Multiprocessor Systems
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.01 |
The performance of a parallel algorithm depends in a large part on the interconnection topology of the multicomputer system. The method presented in this paper realizes a kind of interconnection network, called a hyperswitch network, that is achieved using a mixture of static and dynamic topologies. Here, available or fault free paths need not be specified by a source because the routing header can be modified in response to congestion or faults encountered as a path is established. This method can be accomplished in a static topology such as the hypercube network if the nodes have switching elements which are capable of performing the necessary routing header revisions dynamically. Detailed simulation results show that the hyperswitch network is consistently more efficient than fixed path routing for large message traffic conditions. The simulation results also show that the hyperswitch network has equivalent latency overhead for messages with localized and antilocal destinations (i.e., less then a 25% difference between diameter 1 and 5).