A new fault information model for fault-tolerant adaptive and minimal routing in 3-D meshes

Zhen Jiang, Jie Wu, Dajin Wang

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

13 Scopus citations

Abstract

In this paper we rewrite Wang's Minimal-Connected-Component (MCC) model [7] in 2-D meshes without using global information so that not only the existence of a minimal path can be ensured at the source, but also such a path can be formed by routing decisions at intermediate nodes along the path. We extend this MCC model and the corresponding routing in 2-D meshes to 3-D meshes. It is based on our early work on fault tolerant adaptive and minimal routing [9] and the boundary information model [8] in 3-D meshes. We study fault tolerant adaptive and minimal routing from the source and the destination and consider the positions of the source and destination when the new faulty components are constructed. Specifically, all faulty nodes will be contained in some disjoint faulty components and a healthy node will be included in a faulty component only if using it in the routing will definitely cause a non-minimal routing path. A sufficient and necessary condition is proposed for the existence of the minimal routing path in the presence of our faulty components. Based on such a condition, the corresponding routing will guarantee a minimal path whenever it exists.

Original languageEnglish
Title of host publicationProceedings - 2005 International Conference on Parallel Processing
Pages500-507
Number of pages8
StatePublished - 2005
Event2005 International Conference on Parallel Processing - Oslo, Norway
Duration: 14 Jun 200517 Jun 2005

Publication series

NameProceedings of the International Conference on Parallel Processing
Volume2005
ISSN (Print)0190-3918

Other

Other2005 International Conference on Parallel Processing
Country/TerritoryNorway
CityOslo
Period14/06/0517/06/05

Fingerprint

Dive into the research topics of 'A new fault information model for fault-tolerant adaptive and minimal routing in 3-D meshes'. Together they form a unique fingerprint.

Cite this