Abstract
Fault-tolerance has been the focus of attention recently in the research of parallel processing and computer networking. A fault-tolerant routing algorithm should guarantee the delivery of messages in the presence of faulty components. In this paper, we present a comparative performance study of seven prominent fault-tolerant routings in 2-D wormhole-switched tori. The routing algorithms here are coupled with the Software-Based routing scheme which supports dynamic fault-model, enabling the network to remain fully operational at all times. The performance measures studied here are the throughput and average message latency. Results obtained through simulation suggest two classes of presented routing schemes as high performance candidates in most faulty networks.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
