The Cray Cascade architecture uses Dragonfly as its interconnect topology and employs a globally adaptive routing scheme called UGAL. UGAL directs traffic based on link loads but may make inappropriate adaptive routing decisions in various situations, which degrades its performance. In this work, we propose traffic pattern-based adaptive routing (TPR) for Dragonfly that improves UGAL by incorporating a traffic pattern-based adaptation mechanism. The idea is to explicitly use the link usage statistics that are collected in performance counters to infer the traffic pattern, and to take the inferred traffic pattern plus link loads into consideration when making adaptive routing decisions. Our performance evaluation results on a diverse set of ...
Dragonfly networks are appealing topologies for large-scale Data center and HPC networks, that provi...
Dragonfly networks are composed of interconnected groups of routers. Adaptive routing allows packets...
This paper discusses a newly-designed tool for evaluating routing algorithms in computer-communicati...
Adaptive deadlock-free routing mechanisms are required to handle variable traffic patterns in dragon...
Dragonfly networks arrange network routers in a two-level hierarchy, providing a competitive cost-pe...
Evolving technology and increasing pin-bandwidth moti-vate the use of high-radix routers to reduce t...
Universal globally adaptive load-balanced (UGAL) routing has been proposed for various interconnecti...
Abstract—Dragonfly topologies are one of the most promising interconnect designs for enabling large,...
Accurately estimating congestion for proper global adaptive routing decisions (i.e., determine wheth...
Abstract—Interconnection networks are a critical resource for large supercomputers. The dragonfly to...
Dragonfly topologies are recent network designs that are considered one of the most promising interc...
Recently proposed high-radix interconnection networks [10] require global adaptive routing to achiev...
System noise can negatively impact the performance of HPC systems, and the interconnection network i...
Abstract—Dragonfly networks are appealing topologies for large-scale Datacenter and HPC networks, th...
Dragonflies are one of the most promising topologies for the Exascale effort for their scalability a...
Dragonfly networks are appealing topologies for large-scale Data center and HPC networks, that provi...
Dragonfly networks are composed of interconnected groups of routers. Adaptive routing allows packets...
This paper discusses a newly-designed tool for evaluating routing algorithms in computer-communicati...
Adaptive deadlock-free routing mechanisms are required to handle variable traffic patterns in dragon...
Dragonfly networks arrange network routers in a two-level hierarchy, providing a competitive cost-pe...
Evolving technology and increasing pin-bandwidth moti-vate the use of high-radix routers to reduce t...
Universal globally adaptive load-balanced (UGAL) routing has been proposed for various interconnecti...
Abstract—Dragonfly topologies are one of the most promising interconnect designs for enabling large,...
Accurately estimating congestion for proper global adaptive routing decisions (i.e., determine wheth...
Abstract—Interconnection networks are a critical resource for large supercomputers. The dragonfly to...
Dragonfly topologies are recent network designs that are considered one of the most promising interc...
Recently proposed high-radix interconnection networks [10] require global adaptive routing to achiev...
System noise can negatively impact the performance of HPC systems, and the interconnection network i...
Abstract—Dragonfly networks are appealing topologies for large-scale Datacenter and HPC networks, th...
Dragonflies are one of the most promising topologies for the Exascale effort for their scalability a...
Dragonfly networks are appealing topologies for large-scale Data center and HPC networks, that provi...
Dragonfly networks are composed of interconnected groups of routers. Adaptive routing allows packets...
This paper discusses a newly-designed tool for evaluating routing algorithms in computer-communicati...