Title :
Fault-tolerant and deadlock-free routing in 2-D meshes using rectilinear-monotone polygonal fault blocks
Author :
Wu, Jie ; Wang, Dajin
Author_Institution :
Dept. of Comput. Sci. & Eng., Florida Atlantic Univ., Boca Raton, FL, USA
Abstract :
We propose a deterministic fault-tolerant and deadlock-free routing protocol in 2D meshes based on Wu´s fault-tolerant odd-even turn model (2000) and Wang´s rectilinear-monotone polygonal fault block model. The fault-tolerant odd-even turn protocol, also called extended X-Y routing, was originally proposed to achieve fault-tolerant and deadlock-free routing among traditional, rectangular fault blocks. It does not use any virtual channels. The number of faults to be tolerated is unbounded as long as nodes outside fault blocks are connected in the mesh network. The recently proposed rectilinear-monotone polygonal fault blocks (also called minimal-connected-components or MCCs) are of the polygonal shapes, and is a refinement of rectangular fault blocks. The formation of MCCs depends on the relative locations of source and destination, and they include much fewer healthy nodes in resultant fault blocks. In this paper, we show that with a simple modification, the extended X-Y routing can also be applied to 2D meshes using extended MCCs.
Keywords :
concurrency control; fault tolerant computing; multiprocessor interconnection networks; network routing; 2D meshes; MCC; deadlock-free routing protocol; extended X-Y routing; fault-tolerant odd-even turn model; fault-tolerant routing protocol; minimal-connected-components; rectangular fault blocks; rectilinear-monotone polygonal fault block model; rectilinear-monotone polygonal fault blocks; Computer architecture; Computer science; Fault tolerance; Mesh networks; Multiprocessor interconnection networks; Network topology; Packet switching; Routing protocols; Shape; System recovery;
Conference_Titel :
Parallel Processing, 2002. Proceedings. International Conference on
Print_ISBN :
0-7695-1677-7
DOI :
10.1109/ICPP.2002.1040880