Paper Info
Title
Evaluating the Performance of Adaptive Fault-Tolerant Routing Algorithms for Wormhole-Switched Mesh Interconnect Networks
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 fault- tolerant routing algorithms in wormhole-switched 2-D mesh interconnect networks. These networks carry a routing scheme suggested by Boppana and Chalasani (1) 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.
Year
DOI
Venue
2007
10.1109/IPDPS.2007.370596
Long Beach, CA
Keywords
Field
DocType
fault tolerant computing,multiprocessor interconnection networks,network routing,parallel machines,performance evaluation,probability,adaptive fault-tolerant routing algorithms,inter-processor communications,parallel computer systems,probability,wormhole-switched 2D mesh interconnect networks
Link-state routing protocol,Multipath routing,Dynamic Source Routing,Policy-based routing,Static routing,Computer science,Parallel computing,Computer network,Destination-Sequenced Distance Vector routing,Wireless Routing Protocol,Geographic routing,Distributed computing
Conference
ISBN
Citations 
PageRank 
1-4244-0910-1
2
0.41
References 
Authors
8
4
Name
Order
Citations
PageRank
F. Safaei15712.30
A. Khonsari213617.89
Mahmood Fathy348263.71
Shantia, A.H.420.41