OFAR-CM: Efficient Dragonfly networks with simple congestion management
Visualitza/Obre
Cita com:
hdl:2117/91427
Tipus de documentText en actes de congrés
Data publicació2013
EditorInstitute of Electrical and Electronics Engineers (IEEE)
Condicions d'accésAccés obert
Tots els drets reservats. Aquesta obra està protegida pels drets de propietat intel·lectual i
industrial corresponents. Sense perjudici de les exempcions legals existents, queda prohibida la seva
reproducció, distribució, comunicació pública o transformació sense l'autorització del titular dels drets
ProjecteROMOL - Riding on Moore's Law (EC-FP7-321253)
ROMOL - Riding on Moore's Law (EC-FP7-321253)
HIPEAC - High Performance and Embedded Architecture and Compilation (EC-FP7-287759)
ROMOL - Riding on Moore's Law (EC-FP7-321253)
HIPEAC - High Performance and Embedded Architecture and Compilation (EC-FP7-287759)
Abstract
Dragonfly networks are appealing topologies for large-scale Data center and HPC networks, that provide high throughput with low diameter and moderate cost. However, they are prone to congestion under certain frequent traffic patterns that saturate specific network links. Adaptive non-minimal routing can be used to avoid such congestion. That kind of routing employs longer paths to circumvent local or global congested links. However, if a distance-based deadlock avoidance mechanism is employed, more Virtual Channels (VCs) are required, what increases design complexity and cost. OFAR (On-the-Fly Adaptive Routing) is a previously proposed routing that decouples VCs from deadlock avoidance, making local and global misrouting affordable. However, the severity of congestion with OFAR is higher, as it relies on an escape sub network with low bisection bandwidth. Additionally, OFAR allows for unlimited misroutings on the escape sub network, leading to unbounded paths in the network and long latencies. In this paper we propose and evaluate OFAR-CM, a variant of OFAR combined with a simple congestion management (CM) mechanism which only relies on local information, specifically the credit count of the output ports in the local router. With simple escape sub networks such as a Hamiltonian ring or a tree, OFAR outperforms former proposals with distance-based deadlock avoidance. Additionally, although long paths are allowed in theory, in practice packets arrive at their destination in a small number of hops. Altogether, OFAR-CM constitutes the first practicable mechanism to the date that supports both local and global misrouting in Dragonfly networks.
CitacióGarcía, M., Vallejo, E., Beivide, R., Valero, M., Rodríguez, G. OFAR-CM: Efficient Dragonfly networks with simple congestion management. A: IEEE Annual Symposium in High-Performance Interconnects. "IEEE 21st Annual Symposium on High-Performance Interconnects: 21-23 August 2013, San Jose, California: proceedings". San Jose, California: Institute of Electrical and Electronics Engineers (IEEE), 2013, p. 55-62.
ISBN978-0-7685-5103-6
Versió de l'editorhttp://ieeexplore.ieee.org/document/6627736/
Fitxers | Descripció | Mida | Format | Visualitza |
---|---|---|---|---|
OFAR-CM+Efficient+Dragonfly+Networks+with.pdf | 844,2Kb | Visualitza/Obre |