Deterministic versus adaptive routing in direct topologies

• Autores: Roberto Peñaranda Cebrián, Crispín Gómez Requena, María Engracia Gómez Requena, Pedro López, José Duato Marín
• Localización: Actas de las XXIV Jornadas de Paralelismo / coord. por Guillermo Botella, Alberto A. del Barrio García, 2013, ISBN 978-84-695-8330-2, págs. 115-120
• Idioma: inglés
• Texto completo no disponible (Saber más ...)
• Resumen

  • Routing is a key design factor to obtainthe maximum performance out of interconnectionnetworks. Depending on the number of routingoptions that packets may use, routing algorithms areclassified into two categories. If the packet can onlyuse a single predetermined path, routing is deterministic,whereas if several paths are available, it is adaptive.It is well-known that adaptive routing usuallyoutperforms deterministic routing. However, adaptiverouters are more complex and introduces out-oforderdelivery of packets. In this paper, we take upthe challenge of developing a deterministic routingalgorithm for direct topologies that can obtain a similarperformance than adaptive routing, while providingthe inherent advantages of deterministic routingsuch as in-order delivery of packets and implementationsimplicity. The key point of the proposed deterministicrouting algorithm is that it is aware of theHoL-blocking effect, and it is designed to reduce it,which, as known, it is a key contributor to degradeinterconnection network performance.