Paper Info
Title
Deterministic Routing With Hol-Blocking-Awareness For Direct Topologies
Abstract
Routing is a key design factor to obtain the maximum performance out of interconnection networks. Depending on the number of routing options that packets may use, routing algorithms are classified into two categories. If the packet can only use a single predetermined path, routing is deterministic, whereas if several paths are available, it is adaptive. It is well-known that adaptive routing usually outperforms deterministic routing. However, adaptive routers are more complex and introduces out-of-order delivery of packets. In this paper, we take up the challenge of developing a deterministic routing algorithm for direct topologies that can obtain a similar performance than adaptive routing, while providing the inherent advantages of deterministic routing such as in-order delivery of packets and implementation simplicity. The proposed deterministic routing algorithm is aware of the HoL-blocking effect, and it is designed to reduce it, which, as known, it is a key contributor to degrade interconnection network performance.
Year
DOI
Venue
2013
10.1016/j.procs.2013.05.432
2013 INTERNATIONAL CONFERENCE ON COMPUTATIONAL SCIENCE
Keywords
DocType
Volume
Parallel computers, Interconnection networks, Direct topologies, Deterministic routing, Adaptive routing
Conference
18
ISSN
Citations 
PageRank 
1877-0509
0
0.34
References 
Authors
0
5
Name
Order
Citations
PageRank
Roberto Peñaranda1132.40
Crispín Gómez Requena216012.57
María Engracia Gómez314917.48
Pedro López423316.39
José Duato53481294.85