Dynamic Global Adaptive Routing in High-Radix Networks

被引:3
|
作者
Kasan, Hans [1 ]
Kim, Gwangsun [2 ]
Yi, Yung [1 ]
Kim, John [1 ]
机构
[1] Korea Adv Inst Sci & Technol, Daejeon, South Korea
[2] POSTECH, Pohang, South Korea
关键词
global adaptive routing; load-balancing; high-radix networks;
D O I
10.1145/3470496.3527389
中图分类号
TP3 [计算技术、计算机技术];
学科分类号
0812 ;
摘要
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%.
引用
收藏
页码:771 / 783
页数:13
相关论文
共 50 条
  • [1] Contention-based Nonminimal Adaptive Routing in High-radix Networks
    Fuentes, Pablo
    Vallejo, Enrique
    Garcia, Marina
    Beivide, Ramon
    Rodriguez, German
    Minkenberg, Cyriel
    Valero, Mateo
    [J]. 2015 IEEE 29TH INTERNATIONAL PARALLEL AND DISTRIBUTED PROCESSING SYMPOSIUM (IPDPS), 2015, : 103 - 112
  • [2] An Efficient Label Routing on High-Radix Interconnection Networks
    Lei, Fei
    Dong, Dezun
    Liao, Xiangke
    [J]. 2017 IEEE 23RD INTERNATIONAL CONFERENCE ON PARALLEL AND DISTRIBUTED SYSTEMS (ICPADS), 2017, : 596 - 603
  • [3] BoomGate: Deadlock Avoidance in Non-Minimal Routing for High-Radix Networks
    Kwauk, Gyuyoung
    Kang, Seungkwan
    Kasan, Hans
    Son, Hyojun
    Kim, John
    [J]. 2021 27TH IEEE INTERNATIONAL SYMPOSIUM ON HIGH-PERFORMANCE COMPUTER ARCHITECTURE (HPCA 2021), 2021, : 696 - 708
  • [4] HCORDIC: A high-radix adaptive CORDIC algorithm
    Elguibaly, F
    Sui, NT
    Rayhan, A
    [J]. CANADIAN JOURNAL OF ELECTRICAL AND COMPUTER ENGINEERING-REVUE CANADIENNE DE GENIE ELECTRIQUE ET INFORMATIQUE, 2000, 25 (04): : 149 - 154
  • [5] High-Radix On-chip Networks with Low-Radix Routers
    Jain, Animesh
    Parikh, Ritesh
    Bertacco, Valeria
    [J]. 2014 IEEE/ACM INTERNATIONAL CONFERENCE ON COMPUTER-AIDED DESIGN (ICCAD), 2014, : 289 - 294
  • [6] SCOC: High-Radix Switches Made of Bufferless Clos Networks
    Chrysos, Nikolaos
    Minkenberg, Cyriel
    Rudquist, Mark
    Basso, Claude
    Vanderpool, Brian
    [J]. 2015 IEEE 21ST INTERNATIONAL SYMPOSIUM ON HIGH PERFORMANCE COMPUTER ARCHITECTURE (HPCA), 2015, : 402 - 414
  • [7] Microarchitecture of a high-radix router
    Kim, J
    Dally, WJ
    Towles, B
    Gupta, AK
    [J]. 32ND INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE, PROCEEDINGS, 2005, : 420 - 431
  • [8] TCEP: Traffic Consolidation for Energy-Proportional High-Radix Networks
    Kim, Gwangsun
    Choi, Hayoung
    Kim, John
    [J]. 2018 ACM/IEEE 45TH ANNUAL INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE (ISCA), 2018, : 712 - 725
  • [9] Flattened Butterfly : A Cost-Efficient Topology for High-Radix Networks
    Kim, John
    Dally, William J.
    Abts, Dennis
    [J]. ISCA'07: 34TH ANNUAL INTERNATIONAL SYMPOSIUM ON COMPUTER ARCHITECTURE, CONFERENCE PROCEEDINGS, 2007, : 126 - 137
  • [10] High-radix logarithm with selection by rounding
    Piñeiro, JA
    Ercegovac, MD
    Bruguera, JD
    [J]. IEEE INTERNATIONAL CONFERENCE ON APPLICATION-SPECIFIC SYSTEMS, ARCHITECTURES, AND PROCESSORS, PROCEEDINGS, 2002, : 101 - 110