A probabilistic characterization of fault rings in adaptively-routed mesh interconnection networks

F. Safaei, A. Khonsari, A. Dadlani, M. Ould-Khaoua

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

2 Citations (Scopus)

Abstract

With increase in concern for reliability in the current and next generation of Multiprocessors System-on-Chip (MP-SoCs), multi-computers, cluster computers, and peer-to-peer communication networks, fault-tolerance has become an integral part of these systems. One of the fundamental issues regarding fault-tolerance is how to efficiently route a faulty network where each component is associated with some probability of failure. Adaptive fault-tolerant routing algorithms have been frequently suggested in the literature as means of improving communication performance and fault-tolerant demands in computer systems. Also, several results have been reported on usage of fault rings in providing detours to messages blocked by faults and in routing messages adaptively around the rectangular faulty regions. In order to analyze the performance of such routing schemes, one must investigate the characteristics of fault rings. In this paper, we derive mathematical expressions to compute the probability of message facing the fault rings in the well-known mesh interconnection network. We also conduct extensive simulation experiments using a variety of faults, the results of which are used to confirm the accuracy of the proposed models.

Original languageEnglish
Title of host publicationProceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN
Pages233-238
Number of pages6
DOIs
Publication statusPublished - 2008
Event9th International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN 2008 - Sydney, NSW, Australia
Duration: May 7 2008May 9 2008

Other

Other9th International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN 2008
CountryAustralia
CitySydney, NSW
Period5/7/085/9/08

Fingerprint

Fault tolerance
Routing algorithms
Telecommunication networks
Computer systems
Communication
Experiments
System-on-chip

ASJC Scopus subject areas

  • Computer Science(all)

Cite this

Safaei, F., Khonsari, A., Dadlani, A., & Ould-Khaoua, M. (2008). A probabilistic characterization of fault rings in adaptively-routed mesh interconnection networks. In Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN (pp. 233-238). [4520221] https://doi.org/10.1109/I-SPAN.2008.17

A probabilistic characterization of fault rings in adaptively-routed mesh interconnection networks. / Safaei, F.; Khonsari, A.; Dadlani, A.; Ould-Khaoua, M.

Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN. 2008. p. 233-238 4520221.

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

Safaei, F, Khonsari, A, Dadlani, A & Ould-Khaoua, M 2008, A probabilistic characterization of fault rings in adaptively-routed mesh interconnection networks. in Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN., 4520221, pp. 233-238, 9th International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN 2008, Sydney, NSW, Australia, 5/7/08. https://doi.org/10.1109/I-SPAN.2008.17
Safaei F, Khonsari A, Dadlani A, Ould-Khaoua M. A probabilistic characterization of fault rings in adaptively-routed mesh interconnection networks. In Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN. 2008. p. 233-238. 4520221 https://doi.org/10.1109/I-SPAN.2008.17
Safaei, F. ; Khonsari, A. ; Dadlani, A. ; Ould-Khaoua, M. / A probabilistic characterization of fault rings in adaptively-routed mesh interconnection networks. Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN. 2008. pp. 233-238
@inproceedings{91f4924883af42dfb7d44731a8ac3a30,
title = "A probabilistic characterization of fault rings in adaptively-routed mesh interconnection networks",
abstract = "With increase in concern for reliability in the current and next generation of Multiprocessors System-on-Chip (MP-SoCs), multi-computers, cluster computers, and peer-to-peer communication networks, fault-tolerance has become an integral part of these systems. One of the fundamental issues regarding fault-tolerance is how to efficiently route a faulty network where each component is associated with some probability of failure. Adaptive fault-tolerant routing algorithms have been frequently suggested in the literature as means of improving communication performance and fault-tolerant demands in computer systems. Also, several results have been reported on usage of fault rings in providing detours to messages blocked by faults and in routing messages adaptively around the rectangular faulty regions. In order to analyze the performance of such routing schemes, one must investigate the characteristics of fault rings. In this paper, we derive mathematical expressions to compute the probability of message facing the fault rings in the well-known mesh interconnection network. We also conduct extensive simulation experiments using a variety of faults, the results of which are used to confirm the accuracy of the proposed models.",
author = "F. Safaei and A. Khonsari and A. Dadlani and M. Ould-Khaoua",
year = "2008",
doi = "10.1109/I-SPAN.2008.17",
language = "English",
isbn = "9780769531250",
pages = "233--238",
booktitle = "Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN",

}

TY - GEN

T1 - A probabilistic characterization of fault rings in adaptively-routed mesh interconnection networks

AU - Safaei, F.

AU - Khonsari, A.

AU - Dadlani, A.

AU - Ould-Khaoua, M.

PY - 2008

Y1 - 2008

N2 - With increase in concern for reliability in the current and next generation of Multiprocessors System-on-Chip (MP-SoCs), multi-computers, cluster computers, and peer-to-peer communication networks, fault-tolerance has become an integral part of these systems. One of the fundamental issues regarding fault-tolerance is how to efficiently route a faulty network where each component is associated with some probability of failure. Adaptive fault-tolerant routing algorithms have been frequently suggested in the literature as means of improving communication performance and fault-tolerant demands in computer systems. Also, several results have been reported on usage of fault rings in providing detours to messages blocked by faults and in routing messages adaptively around the rectangular faulty regions. In order to analyze the performance of such routing schemes, one must investigate the characteristics of fault rings. In this paper, we derive mathematical expressions to compute the probability of message facing the fault rings in the well-known mesh interconnection network. We also conduct extensive simulation experiments using a variety of faults, the results of which are used to confirm the accuracy of the proposed models.

AB - With increase in concern for reliability in the current and next generation of Multiprocessors System-on-Chip (MP-SoCs), multi-computers, cluster computers, and peer-to-peer communication networks, fault-tolerance has become an integral part of these systems. One of the fundamental issues regarding fault-tolerance is how to efficiently route a faulty network where each component is associated with some probability of failure. Adaptive fault-tolerant routing algorithms have been frequently suggested in the literature as means of improving communication performance and fault-tolerant demands in computer systems. Also, several results have been reported on usage of fault rings in providing detours to messages blocked by faults and in routing messages adaptively around the rectangular faulty regions. In order to analyze the performance of such routing schemes, one must investigate the characteristics of fault rings. In this paper, we derive mathematical expressions to compute the probability of message facing the fault rings in the well-known mesh interconnection network. We also conduct extensive simulation experiments using a variety of faults, the results of which are used to confirm the accuracy of the proposed models.

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

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

U2 - 10.1109/I-SPAN.2008.17

DO - 10.1109/I-SPAN.2008.17

M3 - Conference contribution

SN - 9780769531250

SP - 233

EP - 238

BT - Proceedings of the International Symposium on Parallel Architectures, Algorithms and Networks, I-SPAN

ER -