skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: Modeling Universal Globally Adaptive Load-Balanced Routing

Journal Article · · ACM Transactions on Parallel Computing
DOI:https://doi.org/10.1145/3349620· OSTI ID:1565855
 [1];  [2];  [3];  [2];  [2]; ORCiD logo [4]; ORCiD logo [4]
  1. Oakland Univ., Rochester, MI (United States)
  2. Florida State Univ., Tallahassee, FL (United States)
  3. Univ. of North Florida, Jacksonville, FL (United States)
  4. Los Alamos National Lab. (LANL), Los Alamos, NM (United States)

Universal globally adaptive load-balanced (UGAL) routing has been proposed for various interconnection networks and has been deployed in a number of current-generation supercomputers. Although UGAL-based schemes have been extensively studied, most existing results are based on either simulation or measurement. Without a theoretical understanding of UGAL, multiple questions remain: For which traffic patterns is UGAL most suited? Furthermore, what determines the performance of the UGAL-based scheme on a particular network configuration? Here, we develop a set of throughput models for UGALbased on linear programming. We show that the throughput models are valid across the torus, Dragonfly, and Slim Fly network topologies. Finally, we identify a robust model that can accurately and efficiently predict UGAL throughput for a set of representative traffic patterns across different topologies. Our models not only provide a mechanism to predict UGAL performance on large-scale interconnection networks but also reveal the inner working of UGAL and further our understanding of this type of routing.

Research Organization:
Los Alamos National Lab. (LANL), Los Alamos, NM (United States)
Sponsoring Organization:
USDOE National Nuclear Security Administration (NNSA), Office of Defense Programs (DP)
Grant/Contract Number:
89233218CNA000001
OSTI ID:
1565855
Report Number(s):
LA-UR-18-28331
Journal Information:
ACM Transactions on Parallel Computing, Vol. 6, Issue 2; ISSN 2329-4949
Publisher:
Association for Computing MachineryCopyright Statement
Country of Publication:
United States
Language:
English

References (25)

Contention-Based Nonminimal Adaptive Routing in High-Radix Networks conference May 2015
Random Regular Graph and Generalized De Bruijn Graph with $k$ -Shortest Path Routing journal January 2018
OFAR-CM: Efficient Dragonfly Networks with Simple Congestion Management conference August 2013
Overcoming far-end congestion in large-scale networks conference February 2015
Efficient Routing Mechanisms for Dragonfly Networks conference October 2013
A comparative study of SDN and adaptive routing on dragonfly networks
  • Faizian, Peyman; Mollah, Md Atiqul; Tong, Zhou
  • Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis on - SC '17 https://doi.org/10.1145/3126908.3126959
conference January 2017
Express Cube Topologies for on-Chip Interconnects conference February 2009
Oblivious routing schemes in extended generalized Fat Tree networks conference August 2009
Indirect adaptive routing on large scale interconnection networks journal June 2009
Universal schemes for parallel communication conference January 1981
Oblivious Routing in Fat-Tree Based System Area Networks With Uncertain Traffic Demands journal October 2009
A Scheme for Fast Parallel Communication journal May 1982
Load-Balanced Slim Fly Networks conference January 2018
Slim Fly: A Cost Effective Low-Diameter Network Topology conference November 2014
LFTI: A New Performance Metric for Assessing Interconnect Designs for Extreme-Scale HPC Systems
  • Yuan, Xin; Mahapatra, Santosh; Lang, Michael
  • 2014 IEEE International Parallel & Distributed Processing Symposium (IPDPS), 2014 IEEE 28th International Parallel and Distributed Processing Symposium https://doi.org/10.1109/IPDPS.2014.38
conference May 2014
Maximizing Throughput on a Dragonfly Network
  • Jain, Nikhil; Bhatele, Abhinav; Ni, Xiang
  • SC14: International Conference for High Performance Computing, Networking, Storage and Analysis https://doi.org/10.1109/SC.2014.33
conference November 2014
On-the-Fly Adaptive Routing in High-Radix Hierarchical Networks conference September 2012
Projective Networks: Topologies for Large Parallel Computer Systems journal July 2017
The maximum concurrent flow problem journal April 1990
A detailed and flexible cycle-accurate Network-on-Chip simulator conference April 2013
Rapid Calculation of Max-Min Fair Rates for Multi-Commodity Flows in Fat-Tree Networks journal January 2018
On Folded-Clos Networks with Deterministic Single-Path Routing journal January 2016
Technology-Driven, Highly-Scalable Dragonfly Topology journal June 2008
A new routing scheme for Jellyfish and its performance with HPC workloads
  • Yuan, Xin; Mahapatra, Santosh; Nienaber, Wickus
  • Proceedings of the International Conference for High Performance Computing, Networking, Storage and Analysis on - SC '13 https://doi.org/10.1145/2503210.2503229
conference January 2013
TPR: Traffic Pattern-Based Adaptive Routing for Dragonfly Networks journal October 2018

Similar Records

TPR: Traffic Pattern-based Adaptive Routing for Dragonfly Networks
Journal Article · Mon Oct 22 00:00:00 EDT 2018 · IEEE Transactions on Multi-Scale Computing Systems · OSTI ID:1565855

A visual analytics system for optimizing the performance of large-scale networks in supercomputing systems
Conference · Thu Mar 01 00:00:00 EST 2018 · OSTI ID:1565855

Modeling Large-Scale Slim Fly Networks Using Parallel Discrete-Event Simulation
Journal Article · Thu Aug 30 00:00:00 EDT 2018 · ACM Transactions on Modeling and Computer Simulation · OSTI ID:1565855

Related Subjects