Fault-tolerant broadcasting in wormhole-routed torus networks

Seungjin Park, S. Seidel, Jong Hoon Youn

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Scopus citations

Abstract

This paper describes a fault-tolerant broadcast algorithm for wormhole-routed torus networks for which there is only local knowledge of faulty components. This algorithm tolerates tip to k-1 faulty nodes in a k-ary n-cube provided the faults do not cause the network to be disconnected. Based on the fault-tolerant dimension-order unicast communication, this algorithm is deadlock-free and no additional virtual channels are needed. The first stage of this algorithm is itself an optimal broadcast algorithm for a torus if no faults are present. The second stage overcomes the presence of up to k-1 faults with a fixed number of additional message transmissions. Thus, the cost of this algorithm is within a constant factor of the cost of optimal non-fault-tolerant broadcast algorithms.

Original languageEnglish (US)
Title of host publicationProceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002
PublisherInstitute of Electrical and Electronics Engineers Inc.
Pages371-376
Number of pages6
ISBN (Electronic)0769515738, 9780769515731
DOIs
StatePublished - 2002
Externally publishedYes
Event16th International Parallel and Distributed Processing Symposium, IPDPS 2002 - Ft. Lauderdale, United States
Duration: Apr 15 2002Apr 19 2002

Publication series

NameProceedings - International Parallel and Distributed Processing Symposium, IPDPS 2002

Other

Other16th International Parallel and Distributed Processing Symposium, IPDPS 2002
CountryUnited States
CityFt. Lauderdale
Period4/15/024/19/02

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Modeling and Simulation

Fingerprint Dive into the research topics of 'Fault-tolerant broadcasting in wormhole-routed torus networks'. Together they form a unique fingerprint.

Cite this