Fault-tolerant routing in mesh-connected 2D tori

Authors:
Eunseuk Oh;Jong-Seok Kim;Hyeong-Ok Lee
Affiliations:
Department of Computer Science, Texas A&M University, College Station, TX;Department of Computer Science, Sunchon National University, Sunchon, Chonnam, Korea;Department of Computer Education, Sunchon National University, Sunchon, Chonnam, Korea
Venue:
ICCS'03 Proceedings of the 2003 international conference on Computational science: PartIII
Year:
2003

Citing 8
Cited 1

Deadlock-Free Message Routing in Multiprocessor Interconnection Networks

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
Adaptive Fault-Tolerant Deadlock-Free Routing in Meshes and Hypercubes

IEEE Transactions on Computers
k-Pairwise Cluster Fault Tolerant Routing in Hypercubes

IEEE Transactions on Computers
Unicast in Hypercubes with Large Number of Faulty Nodes

IEEE Transactions on Parallel and Distributed Systems
Locally Subcube-Connected Hypercube Networks: Theoretical Analysis and Experimental Results

IEEE Transactions on Computers
Conditional Connectivity Measures for Large Multiprocessor Systems

IEEE Transactions on Computers
Hypercube Network Fault Tolerance: A Probabilistic Approach

ICPP '02 Proceedings of the 2002 International Conference on Parallel Processing

Compiler directed network-on-chip reliability enhancement for chip multiprocessors

Proceedings of the ACM SIGPLAN/SIGBED 2010 conference on Languages, compilers, and tools for embedded systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we study natural conditions for 2D tori with a large number of faulty nodes to remain connected. Under the suggested connectivity conditions, we develop efficient routing algorithms in 2D tori with a large number of faulty nodes. As long as a given input torus and the meshes within the torus satisfy the conditions, the routing algorithm successfully constructs a fault-free path by using only local information of the network. Also, our algorithms do not require faulty nodes and faulty blocks to be a special structure such as convex, rectangle, while each mesh in a given torus can sustain as many faulty nodes as possible, provided that non-faulty nodes of the mesh are connected and the mesh holds the connectivity conditions. Specifically, for a torus sustaining up to 22.2% faulty nodes, in linear time, our algorithm constructs a fault-free path of length bounded by six times the shortest path length between the two nodes.