Skip to content
Book Open access

Dragonfly-Ultra: A Scalable, Low-Cost Network Architecture for High-Performance AI Clusters

Aug 2026 · Conference on Applications, Technologies, Architectures, and Protocols for Computer Communication · 0 citations · 33 references
Computer Science

TL;DR

Dragonfly-Ultra is presented, a scalable, low-cost network architecture for high-performance AI clusters that can scale to over 260k GPUs with only 82% cost and 81% power consumption of a 3-layer Clos architecture and incorporates three key mechanisms to further improve network performance and optimize collective communication.

Abstract

Large-scale AI clusters impose higher requirements on network scalability, cost, and communication efficiency. The traditional Clos topology suffers from superlinear cost growth when scaling to over 100k GPUs, while the more cost-effective Dragonfly+ introduces "down-up" detours, deadlock risks, and complex routing design. This paper presents Dragonfly-Ultra, a scalable, low-cost network architecture for high-performance AI clusters. Dragonfly-Ultra can scale to over 260k GPUs with only 82% cost and 81% power consumption of a 3-layer Clos architecture. Dragonfly-Ultra optimizes inter-group connectivity to eliminate intra-group detours entirely. Beyond the topological benefits, Dragonfly-Ultra incorporates three key mechanisms to further improve network performance and optimize collective communication, including lightweight dual-waterline adaptive routing for fast congestion mitigation, virtual-link-based deadlock avoidance with lower hardware overhead, and uniform affinity-aware rank placement for balanced inter-group traffic across all phases. Simulation results on a 4k-node cluster show that, compared to Clos, Dragonfly-Ultra achieves up to 18.8% and 39.2% lower completion time for AllReduce and AlltoAll, respectively. Compared to Dragonfly+, the reductions are up to 27.9% and 62.1%, outperforming current mainstream topologies.

Read PDF

Similar papers

2026

A Scalable and High-Performance Architecture for Data Center Networks

The rapid expansion of cloud computing, big data analytics, and artificial intelligence has positioned data centers as the backbone infrastructure of modern computing. Data center networks (DCNs) play a critical role in determining overall system performance and reliability. Existing DCN architectures face limitations,...

Xuanli Liu, Weibei Fan, Zhenjiang Dong et al. · 0 citations
Conference Jul 2026

STON: Scaling Torus-Based AI Training Clusters via Optical Circuit Switches

Torus networks are deployed in production AI training clusters for their path diversity and low latency, but 2D Torus scales poorly: electrical packet switches compromise latency, and high-dimensional Torus introduces excessive routing complexity. We present STON (Scalable TOrus Network), a hierarchical architecture th...

Qinwei Yang, Peirui Cao, Ruyi Zhang et al. · 0 citations
Book Open access May 2026

Revisiting Bruck: Phase-Efficient All-to-All Collective Communication in Reconfigurable Networks

ReTri, a bidirectional All-to-All schedule for ORNs based on the Trivance algorithm is presented, a bidirectional All-to-All schedule for ORNs based on the Trivance algorithm that improves completion time and improves reconfigurable Bruck by up to 2.1×.

Anton Juerss, Stefan Schmid · 0 citations
Book Open access Aug 2026

Balanced Sparse Tree: A Scalable Network Topology for Large Language Models

This work proposes a novel topology named the Balanced Sparse Tree (BST), which is a topology characterized by symmetric design and sparse connections, motivated by hypergraph theory and Steiner Systems, and demonstrates the superiority of BST over the state-of-the-art in network scale, latency, bandwidth, and cost.

Shaoteng Liu, Dejun Kong, Huitian Wang et al. · 0 citations
Book Open access Aug 2026

SprayCast: Congestion-Adaptive Native Multicast for Dynamic Sparse All-to-All Communication

SprayCast is proposed, a congestion-adaptive native RDMA multicast scheme for dynamic sparse token Dispatch that uses in-band network telemetry feedback to steer replication away from congested multicast branches and range-based negative acknowledgments for localized loss recovery, saving bandwidth and reducing tail la...

Yingying Zeng, Ning Xu, Xiaobin Tan et al. · 0 citations
#large language models Conference Open access Aug 2026

PSP: Low-Overhead Packet-Level Load Balancing for Stale-State and Bandwidth-Asymmetric Networks

Probabilistic state-proportional (PSP) dispatching, a packet-level load balancing algorithm using a Band-based discrete state representation, provides an effective balance among performance, stability, and overhead for artificial intelligence data centers.

Jia-Qi Liu, Chun-Yang Zhang, Heng Pan et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.