2013 · 21 citations · 17 references
ComputingComputer ScienceComputer SystemsComputer NetworksDistributed SystemsInterconnection NetworksAdaptive RoutingCommunication NetworksCongestion ControlDeadlock AvoidanceRoutingRouting AlgorithmsAdaptive Routing In Butterfly NetworksBisection BandwidthCongestion-aware RoutingDragonfly NetworksEscape RoutingNetwork Congestion ManagementNon-minimal RoutingVirtual Channels
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.
17
Congestion avoidance and control
Van Jacobson · ACM SIGCOMM Computer Communication Review · 1995 · 5.3K citations
Congestion avoidance and control
Van Jacobson · ACM SIGCOMM Computer Communication Review · 1988 · 1.9K citations
Mohammad Alizadeh, Albert Greenberg, David A. Maltz et al. · 2010 · 1.8K citations · Full text
A Scheme for Fast Parallel Communication
Leslie G. Valiant · SIAM Journal on Computing · 1982 · 649 citations