Network unfairness in dragonfly topologies

Abstract

Dragonfly networks arrange network routers in a two-level hierarchy, providing a competitive cost-performance solution for large systems. Nonminimal adaptive routing (adaptive misrouting) is employed to fully exploit the path diversity and increase the performance under adversarial traffic patterns. Network fairness issues arise in the dragonfly for several combinations of traffic pattern, global misrouting and traffic prioritization policy. Such unfairness prevents a balanced use of the resources across the network nodes and degrades severely the performance of any application running on an affected node. This paper reviews the main causes behind network unfairness in dragonflies, including a new adversarial traffic pattern which can easily occur in actual systems and congests all the global output links of a single router. A solution for the observed unfairness is evaluated using age-based arbitration. Results show that age-based arbitration mitigates fairness issues especially when using in-transit adaptive routing. However, when using source adaptive routing, the saturation of the new traffic pattern interferes with the mechanisms employed to detect remote congestion, and the problem grows with the network size. This makes source adaptive routing in dragonflies based on remote notifications prone to reduced performance, even when using age-based arbitration.

ACOR: Adaptive congestion-oblivious routing in dragonfly networks

“…Saturation caused by ADV+h occurs at load 1/h phits/node/cycle[13],for example 0.12 to 0.16 phits/node/cycle for h in {6 − 8}. The unfairness and congestion under ADVc occur close to saturation, near 0.5 phits/node/cycle[17]. These effects are observed in the evaluation in Section 6.…”