An Approach for Deadlock Handling in Torus Network: Wormhole Routing - Couverture souple

Patni, Jagdish Chandra; Aswal, Mahendra Singh

 
9783659643460: An Approach for Deadlock Handling in Torus Network: Wormhole Routing

Synopsis

Wormhole routing is a popular switching technique being used in current generation parallel systems. Wormhole Routing is successful to deadlock due to its pipeline operation in the networks. In this book two deadlock free Wormhole Routing algorithms are given for Torus networks. First a simple and efficient minimal adaptive wormhole routing algorithm is presented that recovers from potential deadlocks. This algorithm removes those packets from the network that have stalled for more than a given timeout in a router. Second a fault-tolerant and non-adaptive routing algorithm is proposed for wormhole routed torus networks. This can tolerate any number of non-overlapping rectangular faulty blocks with simple logic and requires only three virtual channels. The algorithm is proved to provide deadlock-livelock free routing with non-overlapping f-rings. The use of such a limited number of virtual channels will significantly reduce the implementation cost of the algorithm in router hardware.

Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.

Présentation de l'éditeur

Wormhole routing is a popular switching technique being used in current generation parallel systems. Wormhole Routing is successful to deadlock due to its pipeline operation in the networks. In this book two deadlock free Wormhole Routing algorithms are given for Torus networks. First a simple and efficient minimal adaptive wormhole routing algorithm is presented that recovers from potential deadlocks. This algorithm removes those packets from the network that have stalled for more than a given timeout in a router. Second a fault-tolerant and non-adaptive routing algorithm is proposed for wormhole routed torus networks. This can tolerate any number of non-overlapping rectangular faulty blocks with simple logic and requires only three virtual channels. The algorithm is proved to provide deadlock-livelock free routing with non-overlapping f-rings. The use of such a limited number of virtual channels will significantly reduce the implementation cost of the algorithm in router hardware.

Biographie de l'auteur

Jagdish Chandra Patni was born and brought up in Pithoragarh, Uttarakhand and has done Engineering in IT, Masters in Computer Engineering and pursing P.hD in the area of Grid Computing. Currently working as Assistant Professor in University of Petroleum and energy Studies, Dehradun. His works focus on wormhole Routing,Grid Computing and Data Base.

Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.