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.
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.
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.
EUR 9,70 expédition depuis Allemagne vers France
Destinations, frais et délaisVendeur : moluna, Greven, Allemagne
Etat : New. Dieser Artikel ist ein Print on Demand Artikel und wird nach Ihrer Bestellung fuer Sie gedruckt. Autor/Autorin: Patni Jagdish ChandraJagdish 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 Assis. N° de réf. du vendeur 5170572
Quantité disponible : Plus de 20 disponibles
Vendeur : BuchWeltWeit Ludwig Meier e.K., Bergisch Gladbach, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - it takes 3-4 days longer - Neuware -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. 84 pp. Englisch. N° de réf. du vendeur 9783659643460
Quantité disponible : 2 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - 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. N° de réf. du vendeur 9783659643460
Quantité disponible : 1 disponible(s)
Vendeur : buchversandmimpf2000, Emtmannsberg, BAYE, Allemagne
Taschenbuch. Etat : Neu. This item is printed on demand - Print on Demand Titel. Neuware -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.Books on Demand GmbH, Überseering 33, 22297 Hamburg 84 pp. Englisch. N° de réf. du vendeur 9783659643460
Quantité disponible : 1 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Paperback. Etat : Brand New. 84 pages. 8.66x5.91x0.19 inches. In Stock. N° de réf. du vendeur __3659643467
Quantité disponible : 1 disponible(s)
Vendeur : Mispah books, Redhill, SURRE, Royaume-Uni
paperback. Etat : New. New. book. N° de réf. du vendeur ERICA82936596434676
Quantité disponible : 1 disponible(s)