Fault-tolerant wormhole routing for hypercube networks

Authors:
Jau-Der Shih
Affiliations:
Department of Computer Science, National Pingtung Teachers College, Pingtung, Taiwan, ROC
Venue:
Information Processing Letters
Year:
2003

Citing 22
Cited 1

Adaptive, minimal routing in hypercubes

AUSCRYPT '90 Proceedings of the sixth MIT conference on Advanced research in VLSI
An Adaptive and Fault Tolerant Wormhole Routing Strategy for k-ary n-cubes

IEEE Transactions on Computers
Planar-adaptive routing: low-cost adaptive networks for multiprocessors

ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
A New Theory of Deadlock-Free Adaptive Routing in Wormhole Networks

IEEE Transactions on Parallel and Distributed Systems
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
Adaptive Fault-Tolerant Deadlock-Free Routing in Meshes and Hypercubes

IEEE Transactions on Computers
Compressionless Routing: A Framework for Adaptive and Fault-Tolerant Routing

IEEE Transactions on Parallel and Distributed Systems
Reliable Unicasting in Faulty Hypercubes Using Safety Levels

IEEE Transactions on Computers
A Theory of Fault-Tolerant Routing in Wormhole Networks

IEEE Transactions on Parallel and Distributed Systems
Use of Routing Capability for Fault-Tolerant Routing in Hypercube Multicomputers

IEEE Transactions on Computers
Adaptive Fault-Tolerant Routing in Cube-Based Multicomputers Using Safety Vectors

IEEE Transactions on Parallel and Distributed Systems
Software-Based Rerouting for Fault-Tolerant Pipelined Communication

IEEE Transactions on Parallel and Distributed Systems
A Fault-Tolerant Routing Scheme for Meshes with Nonconvex Faults

IEEE Transactions on Parallel and Distributed Systems
A Survey of Wormhole Routing Techniques in Direct Networks

Computer
A Fault-Tolerant Communication Scheme for Hypercube Computers

IEEE Transactions on Computers
Fault-Tolerant Wormhole Routing Algorithms for Mesh Networks

IEEE Transactions on Computers
A Fault-Tolerant Routing Strategy in Hypercube Multicomputers

IEEE Transactions on Computers
Communication in Multicomputers with Nonconvex Faults

IEEE Transactions on Computers
Deadlock-Free Adaptive Routing in Multicomputer Networks Using Virtual Channels

IEEE Transactions on Parallel and Distributed Systems
A Necessary and Sufficient Condition for Deadlock-Free Adaptive Routing in Wormhole Networks

IEEE Transactions on Parallel and Distributed Systems
Fault-Tolerant Wormhole Routing in Meshes without Virtual Channels

IEEE Transactions on Parallel and Distributed Systems

Explanation of Performance Degradation in Turn Model

The Journal of Supercomputing

Quantified Score

Hi-index	0.89

Visualization

Abstract

We present an adaptive fault-tolerant wormhole routing algorithm for hypercubes by using 3 virtual networks. The routing algorithm can tolerate at least n - 1 faulty nodes and can route a message via a path of length no more than the shortest path plus four. Previous algorithms which achieve the same fault tolerant ability need 5 virtual networks. Simulation results are also given in this paper.