Dynamic global adaptive routing in high-radix networks
Hans Kasan, Gwangsun Kim, Yung Yi, John Kim
Abstract
Global adaptive routing is a critical component of high-radix networks in large-scale systems and is necessary to fully exploit the path diversity of a high-radix topology. The routing decision in global adaptive routing is made between minimal and non-minimal paths, often based on local information (e.g., queue occupancy) and rely on "approximate" congestion information through backpressure. Different heuristic-based adaptive routing algorithms have been proposed for high-radix topologies; however, heuristic-based routing has performance trade-off for different traffic patterns and leads to inefficient routing decisions. In addition, previously proposed global adaptive routing algorithms are static as the same routing decision algorithm is used, even if the congestion information changes. In this work, we propose a novel global adaptive routing that we refer to as dynamic global adaptive routing that adjusts the routing decision algorithm through a dynamic bias based on the network traffic and congestion to maximize performance. In particular, we propose DGB - Decoupled, Gradient descent-based Bias global adaptive routing algorithm. DGB introduces a dynamic bias to the global adaptive routing decision by leveraging gradient descent to dynamically adjust the adaptive routing bias based on the network congestion. In addition, both the local and global congestion information are decoupled in the routing decision - global information is used for the dynamic bias while local information is used in the routing decision to more accurately estimate the network congestion. Our evaluations show that DGB consistently outperforms previously proposed routing algorithms across diverse range of traffic patterns and workloads. For asymmetric traffic pattern, DGB improves throughput by 65% compared to the state-of-the-art global adaptive routing algorithm while matching the performance for symmetric traffic patterns. For trace workloads, DGB provides average performance improvement of 26%.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get b84106e6-7362-4034-ab8a-e61e7344874dCited by top-tier papers1
Ask how each one uses itRelated papers
- BoomGate: Deadlock Avoidance in Non-Minimal Routing for High-Radix NetworksGyuyoung Kwauk, Seungkwan Kang, Hans Kasan, Hyojun Son et al.HPCA 2021 · 8 citations
- Q-adaptive: A Multi-Agent Reinforcement Learning Based Routing on Dragonfly NetworkYao Kang, Xin Wang, Zhiling LanHPDC 2021 · 26 citations
- TAGO: rethinking routing design in high performance reconfigurable networksMin Yee Teh, Yu-Han Hung, George Michelogiannakis, Shijia Yan et al.SC 2020 · 5 citations
- EDGE: Efficient DAG-based Global Routing EngineJinwei Liu, Evangeline F. Y. YoungDAC 2023 · 20 citations
- Contra: A Programmable System for Performance-aware RoutingKuo-Feng Hsu, Ryan Beckett, Ang Chen, Jennifer Rexford et al.NSDI 2020 · 104 citations
