Software-based fault-tolerant routing algorithm in multi-dimensional networks

F. Safaei, M. Rezazad, A. Khonsari, M. Fathy, M. Ould-Khaoua, N. Alzeidi

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

1 Citation (Scopus)

Abstract

Massively parallel computing systems are being built with hundreds or thousands of components such as nodes, links, memories, and connectors. The failure of a component in such systems will not only reduce the computational power but also alter the network's topology. The Software-Based fault-tolerant routing algorithm is a popular routing to achieve fault-tolerance capability in networks. This algorithm is initially proposed only for two dimensional networks [1]. Since, higher dimensional networks have been widely employed in many contemporary massively parallel systems; this paper proposes an approach to extend this routing scheme to these indispensable higher dimensional networks. Deadlock and livelock freedom and the performance of presented algorithm, have been investigated for networks with different dimensionality and various fault regions. Furthermore, performance results have been presented through simulation experiments.

Original languageEnglish
Title of host publication20th International Parallel and Distributed Processing Symposium, IPDPS 2006
Volume2006
DOIs
Publication statusPublished - 2006

Fingerprint

Routing algorithms
Parallel processing systems
Fault tolerance
Topology
Data storage equipment
Experiments

ASJC Scopus subject areas

  • Engineering(all)

Cite this

Safaei, F., Rezazad, M., Khonsari, A., Fathy, M., Ould-Khaoua, M., & Alzeidi, N. (2006). Software-based fault-tolerant routing algorithm in multi-dimensional networks. In 20th International Parallel and Distributed Processing Symposium, IPDPS 2006 (Vol. 2006). [1639644] https://doi.org/10.1109/IPDPS.2006.1639644

Software-based fault-tolerant routing algorithm in multi-dimensional networks. / Safaei, F.; Rezazad, M.; Khonsari, A.; Fathy, M.; Ould-Khaoua, M.; Alzeidi, N.

20th International Parallel and Distributed Processing Symposium, IPDPS 2006. Vol. 2006 2006. 1639644.

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

Safaei, F, Rezazad, M, Khonsari, A, Fathy, M, Ould-Khaoua, M & Alzeidi, N 2006, Software-based fault-tolerant routing algorithm in multi-dimensional networks. in 20th International Parallel and Distributed Processing Symposium, IPDPS 2006. vol. 2006, 1639644. https://doi.org/10.1109/IPDPS.2006.1639644
Safaei F, Rezazad M, Khonsari A, Fathy M, Ould-Khaoua M, Alzeidi N. Software-based fault-tolerant routing algorithm in multi-dimensional networks. In 20th International Parallel and Distributed Processing Symposium, IPDPS 2006. Vol. 2006. 2006. 1639644 https://doi.org/10.1109/IPDPS.2006.1639644
Safaei, F. ; Rezazad, M. ; Khonsari, A. ; Fathy, M. ; Ould-Khaoua, M. ; Alzeidi, N. / Software-based fault-tolerant routing algorithm in multi-dimensional networks. 20th International Parallel and Distributed Processing Symposium, IPDPS 2006. Vol. 2006 2006.
@inproceedings{0da57f85227f48bfad5420bb07a95d8d,
title = "Software-based fault-tolerant routing algorithm in multi-dimensional networks",
abstract = "Massively parallel computing systems are being built with hundreds or thousands of components such as nodes, links, memories, and connectors. The failure of a component in such systems will not only reduce the computational power but also alter the network's topology. The Software-Based fault-tolerant routing algorithm is a popular routing to achieve fault-tolerance capability in networks. This algorithm is initially proposed only for two dimensional networks [1]. Since, higher dimensional networks have been widely employed in many contemporary massively parallel systems; this paper proposes an approach to extend this routing scheme to these indispensable higher dimensional networks. Deadlock and livelock freedom and the performance of presented algorithm, have been investigated for networks with different dimensionality and various fault regions. Furthermore, performance results have been presented through simulation experiments.",
author = "F. Safaei and M. Rezazad and A. Khonsari and M. Fathy and M. Ould-Khaoua and N. Alzeidi",
year = "2006",
doi = "10.1109/IPDPS.2006.1639644",
language = "English",
isbn = "1424400546",
volume = "2006",
booktitle = "20th International Parallel and Distributed Processing Symposium, IPDPS 2006",

}

TY - GEN

T1 - Software-based fault-tolerant routing algorithm in multi-dimensional networks

AU - Safaei, F.

AU - Rezazad, M.

AU - Khonsari, A.

AU - Fathy, M.

AU - Ould-Khaoua, M.

AU - Alzeidi, N.

PY - 2006

Y1 - 2006

N2 - Massively parallel computing systems are being built with hundreds or thousands of components such as nodes, links, memories, and connectors. The failure of a component in such systems will not only reduce the computational power but also alter the network's topology. The Software-Based fault-tolerant routing algorithm is a popular routing to achieve fault-tolerance capability in networks. This algorithm is initially proposed only for two dimensional networks [1]. Since, higher dimensional networks have been widely employed in many contemporary massively parallel systems; this paper proposes an approach to extend this routing scheme to these indispensable higher dimensional networks. Deadlock and livelock freedom and the performance of presented algorithm, have been investigated for networks with different dimensionality and various fault regions. Furthermore, performance results have been presented through simulation experiments.

AB - Massively parallel computing systems are being built with hundreds or thousands of components such as nodes, links, memories, and connectors. The failure of a component in such systems will not only reduce the computational power but also alter the network's topology. The Software-Based fault-tolerant routing algorithm is a popular routing to achieve fault-tolerance capability in networks. This algorithm is initially proposed only for two dimensional networks [1]. Since, higher dimensional networks have been widely employed in many contemporary massively parallel systems; this paper proposes an approach to extend this routing scheme to these indispensable higher dimensional networks. Deadlock and livelock freedom and the performance of presented algorithm, have been investigated for networks with different dimensionality and various fault regions. Furthermore, performance results have been presented through simulation experiments.

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

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

U2 - 10.1109/IPDPS.2006.1639644

DO - 10.1109/IPDPS.2006.1639644

M3 - Conference contribution

SN - 1424400546

SN - 9781424400546

VL - 2006

BT - 20th International Parallel and Distributed Processing Symposium, IPDPS 2006

ER -