Modeling universal globally adaptive load-balanced routing

Document Type

Article

Publication Date

9-1-2019

Abstract

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? In addition, what determines the performance of the UGAL-based scheme on a particular network configuration? In this work, 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 innerworking of UGAL and further our understanding of this type of routing.

Publication Title

ACM Transactions on Parallel Computing

Volume

6

Issue

2

Digital Object Identifier (DOI)

10.1145/3349620

ISSN

23294949

E-ISSN

23294957

Link to Full Text

Share

COinS