Fault-tolerant wormhole routing algorithms in meshes in the presence of concave faults

Seungjin Park, Jong Hoon Youn, Bella Bose

Research output: Contribution to journalArticle

22 Citations (Scopus)

Abstract

A fault ring is a connection of only nonfaulty adjacent nodes and links such that the interior of the ring contains only faulty components. This paper proposes two wormhole routing algorithms that deal with more relaxed shapes of fault rings than previously known algorithms in the mesh networks. As a result, the number of components to be made disabled would be reduced considerably in some cases. First algorithm, called F4, uses four virtual channels and allows all four sides of fault rings to contain concave shapes. Second algorithm, F3, permits up to three sides to contain concave shapes using only three virtual channels. Both F3 and F4 are free of deadlock and livelock and guarantee the delivery of messages between any pair of nonfaulty and connected nodes in the network.

Original languageEnglish (US)
Pages (from-to)633-638
Number of pages6
JournalProceedings of the International Parallel Processing Symposium, IPPS
StatePublished - Jan 1 2000

Fingerprint

Routing algorithms

ASJC Scopus subject areas

  • Hardware and Architecture

Cite this

@article{20d5f9261fee49bbaa7c07f5e32d84de,
title = "Fault-tolerant wormhole routing algorithms in meshes in the presence of concave faults",
abstract = "A fault ring is a connection of only nonfaulty adjacent nodes and links such that the interior of the ring contains only faulty components. This paper proposes two wormhole routing algorithms that deal with more relaxed shapes of fault rings than previously known algorithms in the mesh networks. As a result, the number of components to be made disabled would be reduced considerably in some cases. First algorithm, called F4, uses four virtual channels and allows all four sides of fault rings to contain concave shapes. Second algorithm, F3, permits up to three sides to contain concave shapes using only three virtual channels. Both F3 and F4 are free of deadlock and livelock and guarantee the delivery of messages between any pair of nonfaulty and connected nodes in the network.",
author = "Seungjin Park and Youn, {Jong Hoon} and Bella Bose",
year = "2000",
month = "1",
day = "1",
language = "English (US)",
pages = "633--638",
journal = "Proceedings of the International Parallel Processing Symposium, IPPS",
issn = "1063-7133",

}

TY - JOUR

T1 - Fault-tolerant wormhole routing algorithms in meshes in the presence of concave faults

AU - Park, Seungjin

AU - Youn, Jong Hoon

AU - Bose, Bella

PY - 2000/1/1

Y1 - 2000/1/1

N2 - A fault ring is a connection of only nonfaulty adjacent nodes and links such that the interior of the ring contains only faulty components. This paper proposes two wormhole routing algorithms that deal with more relaxed shapes of fault rings than previously known algorithms in the mesh networks. As a result, the number of components to be made disabled would be reduced considerably in some cases. First algorithm, called F4, uses four virtual channels and allows all four sides of fault rings to contain concave shapes. Second algorithm, F3, permits up to three sides to contain concave shapes using only three virtual channels. Both F3 and F4 are free of deadlock and livelock and guarantee the delivery of messages between any pair of nonfaulty and connected nodes in the network.

AB - A fault ring is a connection of only nonfaulty adjacent nodes and links such that the interior of the ring contains only faulty components. This paper proposes two wormhole routing algorithms that deal with more relaxed shapes of fault rings than previously known algorithms in the mesh networks. As a result, the number of components to be made disabled would be reduced considerably in some cases. First algorithm, called F4, uses four virtual channels and allows all four sides of fault rings to contain concave shapes. Second algorithm, F3, permits up to three sides to contain concave shapes using only three virtual channels. Both F3 and F4 are free of deadlock and livelock and guarantee the delivery of messages between any pair of nonfaulty and connected nodes in the network.

UR - http://www.scopus.com/inward/record.url?scp=0033906423&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0033906423&partnerID=8YFLogxK

M3 - Article

AN - SCOPUS:0033906423

SP - 633

EP - 638

JO - Proceedings of the International Parallel Processing Symposium, IPPS

JF - Proceedings of the International Parallel Processing Symposium, IPPS

SN - 1063-7133

ER -