A deadlock-free fault-tolerant routing algorithm for N-dimesional meshes

Fault tolerance is one of the most important issues for the design of cost-effective and high performance interconnection networks. In this paper, a new fault tolerance routing algorithm for n-dimensional meshes is presented. The presented algorithm is based on a planer fault model which only disabl...

Full description

Saved in:
Bibliographic Details
Published in2011 IEEE International Conference of Electron Devices and Solid-State Circuits pp. 1 - 2
Main Authors Duan, Xinming, Wu, Jigang
Format Conference Proceeding
LanguageEnglish
Published IEEE 01.11.2011
Subjects
Adaptation models
Algorithm design and analysis
deadlock-free routing
Fault tolerance
Fault tolerant systems
n-dimensional mesh
Routing
Software algorithms
System recovery
Online AccessGet full text

Cover

More Information
Summary:Fault tolerance is one of the most important issues for the design of cost-effective and high performance interconnection networks. In this paper, a new fault tolerance routing algorithm for n-dimensional meshes is presented. The presented algorithm is based on a planer fault model which only disables minimum fault-free nodes to form rectangular fault regions. The algorithm uses three virtual channels per physical channel and only employs a very simple deadlock avoidance scheme. In spit the variety fault regions in n-dimensional mesh, the presented algorithm is always connected as long as fault regions do not disconnect the network.
ISBN:1457719983
9781457719981
DOI:10.1109/EDSSC.2011.6117578