Accurately estimating congestion for proper global adaptive routing decisions (ie, determine
whether a packet should be routed minimally or non-minimally) has a significant impact on …

Current High-Performance Computing (HPC) and data center networks rely on large-radix
routers. Hamming graphs (Cartesian products of complete graphs) and dragonflies (two …

(57) ABSTRACT A multiprocessor computer system includes a plurality of processor nodes
and at least a three-tier hierarchical network interconnecting the processor nodes. The …

Adaptive routing is an efficient congestion avoidance mechanism for modern Data enter and
HPC networks. Congestion detection traditionally relies on the occupancy of the router …

Dragonfly networks are appealing topologies for large-scale Data center and HPC networks,
that provide high throughput with low diameter and moderate cost. However, they are prone …

(57) ABSTRACT A multiprocessor computer system includes a plurality of processor nodes
and at least a three-tier hierarchical network interconnecting the processor nodes. The …

Dragonfly networks have a two-level hierarchical arrangement of the network routers, and
allow for a competitive cost-performance solution in large systems. Non-minimal adaptive …

Low-diameter network topologies require non-minimal routing to avoid network congestion,
such as Valiant routing. This increases base latency but avoids congestion issues …

Dragonfly networks arrange network routers in a two-level hierarchy, providing a competitive
cost-performance solution for large systems. Non-minimal adaptive routing (adaptive …

Adaptive deadlock-free routing mechanisms are required to handle variable traffic patterns
in dragonfly networks. However, distance-based deadlock avoidance mechanisms typically …