Searching. Please wait…
1443
37
174
31252
4606
2680
362
410
Abstract: Adaptive deadlock-free routing mechanisms are required to handle variable traffic patterns in dragonfly networks. However, distance-based deadlock avoidance mechanisms typically employed in Dragonflies increase the router cost and complexity as a function of the maximum allowed path length. This paper presents on-the-fly adaptive routing (OFAR), a routing/flow-control scheme that decouples the routing and the deadlock avoidance mechanisms. OFAR allows for in-transit adaptive routing with local and global misrouting, without imposing dependencies between virtual channels, and relying on a deadlock-free escape subnetwork to avoid deadlock. This model lowers latency, increases throughput, and adapts faster to transient traffic than previously proposed mechanisms. The low capacity of the escape subnetwork makes it prone to congestion. A simple congestion management mechanism based on injection restriction is considered to avoid such issues. Finally, reliability is considered by introducing mechanisms to find multiple edge-disjoint Hamiltonian rings embedded on the dragonfly, allowing to use multiple escape subnetworks. © 2014, Springer Science+Business Media New York.
Fuente: Journal of Supercomputing, 2015, 71(3), 1116-1142
Publisher: Kluwer Academic Publishers
Publication date: 01/03/2015
No. of pages: 27
Publication type: Article
DOI: 10.1007/s11227-014-1357-9
ISSN: 0920-8542,1573-0484
Spanish project: TIN2010-21291-C02-02
Publication Url: https://doi.org/10.1007/s11227-014-1357-9
SCOPUS
Citations
Google Scholar
Metrics
Read publication
MARINA GARCIA GONZALEZ
ENRIQUE VALLEJO GUTIERREZ
JULIO RAMON BEIVIDE PALACIO
CRISTOBAL CAMARERO COTERILLO
MATEO VALERO CORTES
RODRÍGUEZ, GERMAN
MINKENBERG, CYRIEL
Back