Abstract
One of the fundamental problems in parallel computing is how to efficiently perform routing in a faulty network each component of which fails with some probability. This paper presents a comparative performance study of ten prominent adaptive faulttolerant routing algorithms in wormhole-switched 2-D mesh interconnect networks. These networks carry a routing scheme suggested by Boppana and Chalasani 11] as an instance of a fault-tolerant method. The suggested scheme is widely used in the literature to achieve high adaptivity and support inter-processor communications in parallel computer systems due to its ability to preserve both communication performance and fault-tolerant demands in these networks. The performance measures studied are the throughput, average message latency and average usage of virtual channels per node. Results obtained through simulation suggest two classes of presented routing schemes as high performance candidate in most faulty networks.
| Original language | English |
|---|---|
| Title of host publication | Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM |
| DOIs | |
| Publication status | Published - 2007 |
| Event | 21st International Parallel and Distributed Processing Symposium, IPDPS 2007 - Long Beach, CA, United States Duration: Mar 26 2007 → Mar 30 2007 |
Other
| Other | 21st International Parallel and Distributed Processing Symposium, IPDPS 2007 |
|---|---|
| Country | United States |
| City | Long Beach, CA |
| Period | 3/26/07 → 3/30/07 |
Fingerprint
ASJC Scopus subject areas
- Hardware and Architecture
- Software
- Mathematics(all)
Cite this
Evaluating the performance of adaptive fault-tolerant routing algorithms for wormhole-switched mesh interconnect networks. / Safaei, F.; Khonsari, A.; Fathy, M.; Shantia, A. H.; Ould-Khaoua, M.
Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM. 2007. 4228324.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Evaluating the performance of adaptive fault-tolerant routing algorithms for wormhole-switched mesh interconnect networks
AU - Safaei, F.
AU - Khonsari, A.
AU - Fathy, M.
AU - Shantia, A. H.
AU - Ould-Khaoua, M.
PY - 2007
Y1 - 2007
N2 - One of the fundamental problems in parallel computing is how to efficiently perform routing in a faulty network each component of which fails with some probability. This paper presents a comparative performance study of ten prominent adaptive faulttolerant routing algorithms in wormhole-switched 2-D mesh interconnect networks. These networks carry a routing scheme suggested by Boppana and Chalasani 11] as an instance of a fault-tolerant method. The suggested scheme is widely used in the literature to achieve high adaptivity and support inter-processor communications in parallel computer systems due to its ability to preserve both communication performance and fault-tolerant demands in these networks. The performance measures studied are the throughput, average message latency and average usage of virtual channels per node. Results obtained through simulation suggest two classes of presented routing schemes as high performance candidate in most faulty networks.
AB - One of the fundamental problems in parallel computing is how to efficiently perform routing in a faulty network each component of which fails with some probability. This paper presents a comparative performance study of ten prominent adaptive faulttolerant routing algorithms in wormhole-switched 2-D mesh interconnect networks. These networks carry a routing scheme suggested by Boppana and Chalasani 11] as an instance of a fault-tolerant method. The suggested scheme is widely used in the literature to achieve high adaptivity and support inter-processor communications in parallel computer systems due to its ability to preserve both communication performance and fault-tolerant demands in these networks. The performance measures studied are the throughput, average message latency and average usage of virtual channels per node. Results obtained through simulation suggest two classes of presented routing schemes as high performance candidate in most faulty networks.
UR - http://www.scopus.com/inward/record.url?scp=34548717228&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=34548717228&partnerID=8YFLogxK
U2 - 10.1109/IPDPS.2007.370596
DO - 10.1109/IPDPS.2007.370596
M3 - Conference contribution
SN - 1424409101
SN - 9781424409105
BT - Proceedings - 21st International Parallel and Distributed Processing Symposium, IPDPS 2007; Abstracts and CD-ROM
ER -