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 条
  • [21] Quality-of-Service for a High-Radix Switch
    Abeyratne, Nilmini
    Jeloka, Supreet
    Kang, Yiping
    Blaauw, David
    Dreslinski, Ronald G.
    Das, Reetuparna
    Mudge, Trevor
    [J]. 2014 51ST ACM/EDAC/IEEE DESIGN AUTOMATION CONFERENCE (DAC), 2014,
  • [22] Optimizing the configuration of combined high-radix switches
    Villar, Juan A.
    Andujar, Francisco J.
    Alfaro, Francisco J.
    Sanchez, Jose L.
    Duato, Jose
    [J]. JOURNAL OF SUPERCOMPUTING, 2015, 71 (07): : 2614 - 2643
  • [23] Optimizing the configuration of combined high-radix switches
    Juan A. Villar
    Francisco J. Andujar
    Francisco J. Alfaro
    Jose L. Sanchez
    Jose Duato
    [J]. The Journal of Supercomputing, 2015, 71 : 2614 - 2643
  • [24] High-radix iterative algorithm for powering computation
    Piñeiro, JA
    Ercegovac, MD
    Bruguera, JD
    [J]. 16TH IEEE SYMPOSIUM ON COMPUTER ARITHMETIC, PROCEEDINGS, 2003, : 204 - 211
  • [25] Scalable High-Radix Modular Crossbar Switches
    Cakir, Cagla
    Ho, Ron
    Lexau, Jon
    Mai, Ken
    [J]. 2016 IEEE 24TH ANNUAL SYMPOSIUM ON HIGH-PERFORMANCE INTERCONNECTS (HOTI), 2016, : 37 - 44
  • [26] Pipelining high-radix SRT division algorithms
    Upadhyay, Saurabh
    Stine, James E.
    [J]. 2007 50TH MIDWEST SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-3, 2007, : 266 - 269
  • [27] A modified high-radix scalable montgomery multiplier
    Fan, Yibo
    Zeng, Xiaoyang
    Yu, Yu
    Wang, Gang
    Zhang, Qianling
    [J]. 2006 IEEE INTERNATIONAL SYMPOSIUM ON CIRCUITS AND SYSTEMS, VOLS 1-11, PROCEEDINGS, 2006, : 3382 - +
  • [28] Analysis of the tradeoffs for the implementation of a high-radix logarithm
    Piñeiro, JA
    Ercegovac, MD
    Bruguera, JD
    [J]. ICCD'2002: IEEE INTERNATIONAL CONFERENCE ON COMPUTER DESIGN: VLSI IN COMPUTERS AND PROCESSORS, PROCEEDINGS, 2002, : 132 - 137
  • [29] 2-Dilated flattened butterfly: A nonblocking switching topology for high-radix networks
    Thamarakuzhi, Ajithkumar
    Chandy, John A.
    [J]. COMPUTER COMMUNICATIONS, 2011, 34 (15) : 1822 - 1835
  • [30] High-radix cordic algorithms for VLSI signal processing
    Aoki, T
    Nogi, H
    Higuchi, T
    [J]. SIPS 97 - 1997 IEEE WORKSHOP ON SIGNAL PROCESSING SYSTEMS: DESIGN AND IMPLEMENTATION, 1997, : 183 - 192