A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
A Performance Model of Fault-Tolerant Routing Algorithm in Interconnect Networks
[chapter]
2006
Lecture Notes in Computer Science
The Software-Based fault-tolerant routing [1] has been proposed as an efficient routing algorithm to preserve both performance and fault-tolerant demands in large-scale parallel computers and current multiprocessor systemson-chip (Mp-SoCs). A number of different analytical models for fault-free routing algorithms have been suggested in the past literature. However, there has not been reported any similar analytical model of fault-tolerant routing in the presence of faulty components. This paper
doi:10.1007/11758501_99
fatcat:ijgbncygjjh5zppoypeeziuf7m