Broadcasting in faulty hypercubes
Microprocessing and Microprogramming
A Family of Fault-Tolerant Routing Protocols for Direct Multiprocessor Networks
IEEE Transactions on Parallel and Distributed Systems
A Framework for Designing Deadlock-Free Wormhole Routing Algorithms
IEEE Transactions on Parallel and Distributed Systems
Distributed, Deadlock-Free Routing in Faulty, Pipelined, Direct Interconnection Networks
IEEE Transactions on Computers
Reliable Unicasting in Faulty Hypercubes Using Safety Levels
IEEE Transactions on Computers
The SGI Origin: a ccNUMA highly scalable server
Proceedings of the 24th annual international symposium on Computer architecture
Use of Routing Capability for Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Computers
Dynamically Configurable Message Flow Control for Fault-Tolerant Routing
IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Routing in Hypercube Multicomputers Using Local Safety Information
IEEE Transactions on Parallel and Distributed Systems
Unsafety vectors: a new fault-tolerant routing for the binary n-cube
Journal of Systems Architecture: the EUROMICRO Journal
A Fault-Tolerant Communication Scheme for Hypercube Computers
IEEE Transactions on Computers
A Fault-Tolerant Routing Strategy in Hypercube Multicomputers
IEEE Transactions on Computers
Depth-First Search Approach for Fault-Tolerant Routing in Hypercube Multicomputers
IEEE Transactions on Parallel and Distributed Systems
On the Optimal Network for Multicomputers: Torus or Hypercube?
Euro-Par '98 Proceedings of the 4th International Euro-Par Conference on Parallel Processing
Optimal Topology for Distributed Shared-Memory Multiprocessors: Hypercubes Again?
Euro-Par '96 Proceedings of the Second International Euro-Par Conference on Parallel Processing - Volume I
Hi-index | 0.00 |
A new technique is proposed for fault-tolerant routing in hypercubes, which needs to set up a partial path based on local safety information. Local safety information is utilized to guide fault-tolerant routing. Local safety is a centralized metric. A feasible path from the source to the destination may not be guaranteed at the source based on local safety information when the system contains a large number of faults, although a feasible path is available. A partial path is set up for fault-tolerant routing, where the header flit is forwarded until a maximal safe subcube is found to contain the current node and the destination. Backtracking is adopted only for the header along the minimum paths or non-minimum feasible paths, if necessary, in order to set up a partial feasible path. Extensive simulation results have shown that the partial path set-up scheme is quite useful for fault-tolerant routing, while the extra cost caused by path set-up is trivial.