XOR-based HoL-blocking Reduction Routing Mechanisms for Direct Networks
| Autor: | Pedro López, Crispín Gómez, Maria E. Gomez, Roberto Penaranda |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2017 |
| Předmět: |
Routing protocol
Dynamic Source Routing Deterministic routing Computer Networks and Communications Equal-cost multi-path routing Computer science Distributed computing Routing table Enhanced Interior Gateway Routing Protocol Wireless Routing Protocol Geographic routing 02 engineering and technology Routing algorithms Adaptive routing Network topology Head of Line blocking Theoretical Computer Science Routing Information Protocol Direct topology Artificial Intelligence 0202 electrical engineering electronic engineering information engineering Network performance Destination-Sequenced Distance Vector routing Hierarchical routing Triangular routing 020203 distributed computing Interconnection Zone Routing Protocol Static routing Network packet business.industry ComputerSystemsOrganization_COMPUTER-COMMUNICATIONNETWORKS Policy-based routing Path vector protocol DSRFLOW 020206 networking & telecommunications Computer Graphics and Computer-Aided Design ARQUITECTURA Y TECNOLOGIA DE COMPUTADORES Link-state routing protocol Routing domain Hardware and Architecture Multipath routing business Software Computer network |
| Zdroj: | RiuNet. Repositorio Institucional de la Universitat Politécnica de Valéncia instname |
| Popis: | [EN] Routing is a key design parameter in the interconnection network of large parallel computers. Routing algorithms are classified into two different categories depending on the number of routing options available for each source-destination pair: deterministic (there is one path available) and adaptive (there are several ones). Adaptive routing has two opposed effects on network performance. On one hand, it provides routing flexibility that may help on avoiding a congested network area, thus improving network performance. On the other hand, it also may increase the Head-of-Line blocking effect due to more destination nodes sharing the port queues. Usually, adaptive routing uses virtual channels to provide routing flexibility and to guarantee deadlock freedom. Deterministic routing is simpler, which implies lower routing delay and it introduces less Head-of-Line blocking effect. In this paper, we propose an adaptive and HoL-blocking reduction routing algorithm for direct topologies that tries to combine the good properties of both worlds: It provides routing flexibility but also reduces the Head-of-Line blocking effect. To do that, this paper proposes several functions which use the XOR operation to efficiently distribute the packets among virtual channels based on their destination node. The resulting routing mechanisms have different properties depending on whether they enforce routing flexibility or Head-of-Line blocking reduction. This work was supported by the Spanish Ministerio de Economia y Competitividad (MINECO) and by FEDER funds under Grant TIN2015-66972-05-1-R and by Programa de Ayudas de Investigacion y Desarrollo (PAID) from Universitat Politecnica de Valencia. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|