Skip to content
Book Open access

PReCCL: Performant and Resilient Collective Communication via Integrated Inband Telemetry and Workload Reallocation

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

TL;DR

PReCCL is a drop-in NCCL replacement that combines software inband telemetry with cross-VT workload reallocation, and implements in-band monitoring within the CCL, and precisely measures the stall counts of each VT, and piggybacks the telemetry meta-data on existing collective traffic.

Abstract

Modern collective communication libraries (CCLs) execute a collective communication task (CCT) by decomposing it into multiple sub-tasks, each mapped to a specific Virtual Topology (VT), which is an ordered graph of GPUs (e.g., a ring or a tree), to maximize parallelism and link utilization. As AI training scales to larger clusters, network anomalies (congestion and failures) are unavoidable, and a single straggling VT can delay the entire CCT. Existing solutions either rely on low-level transport-layer solutions which lacks a cross-sub-task perspective, or static CCL scheduling, failing to adapt to the dynamic and heterogeneous networks. We present PReCCL, a drop-in NCCL replacement that combines software inband telemetry with cross-VT workload reallocation. Unlike hardware-dependent telemetry (e.g., P4-INT), PReCCL implements in-band monitoring within the CCL. It precisely measures the stall counts of each VT, and piggybacks the telemetry meta-data on existing collective traffic. With this fine-grained visibility, PReCCL employs a dynamic cross-VT reallocation mechanism that shifts workloads from straggler VTs (suffering from congestion or faults) to healthy ones. Reallocation occurs only at CCT boundaries using an epoch-based deterministic protocol, avoiding cross-rank consistency races. We implement PReCCL in NCCL and evaluate it on a 32-GPU testbed, large-scale simulation, and a 1024-GPU production cluster. On the testbed, PReCCL improves CCT completion by up to 2.1X and end-to-end training by 1.21X, with low overhead above tuned message-size thresholds.

Read PDF

Similar papers

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

CCSwitch: A Scalable Data Plane for Non-Blocking In-Network Collective Communication

This work presents CCSwitch, a modular switching fabric built from 4×4 non-blocking Collective Engines, a modular switching fabric built from 4×4 non-blocking Collective Engines (CEs) that combines spatial and temporal parallelism to perform reductions without accumulation buffers.

Sumukh Pinge, Hardik Soni, Bob Lantz et al. · 0 citations
Jul 2026

StrataCL: Fabric-Native Communication Library for Production Supernodes

StrataCL introduces registration-on-allocation to realize user-buffer direct communication, and designs communication operators with workload-balanced NPU-core partitioning and NPU-driven SDMA offloading to exploit supernode architecture features.

Tian-Cheng Hu, Jin Qin, Yu-Zheng Wang et al. · 0 citations
Preprint Aug 2026

HCCL: Collective Communication for Meta Training and Inference Accelerators

HCCL, a collective communication library co-designed with Meta's MTIA 300 accelerator, the first Meta chip to integrate backend networking directly on chip package, and describes collective designs that improve compute-communication pipelining for latency-sensitive workloads are presented.

W. Bland, Tiago Antunes, Lars Paul Huse et al. · 0 citations
Book Open access Aug 2026

CSIG: Congestion Signaling for Datacenter Transports

This work introduces CSIG, a protocol that delivers precise, multi-bit bottleneck congestion signals via a fixed-length Ethernet header, and proposes Fast Ramp-Up, a congestion control primitive that leverages these bottleneck signals to reduce median RPC latency by 20% and unclaimed bandwidth by 60% in production.

Abhiram Ravi, Nandita Dukkipati, Weiwu Pang et al. · 0 citations
Book Open access Aug 2026

HyNA: Taming Tail Latency in MoE Training with Hybrid Switch Silicon

The transition to trillion-parameter models, particularly Mixture-of-Experts (MoE), shifts the bottleneck of distributed training from computation to communication. However, existing Parameter Server (PS) architectures succumb to incast congestion, while state-of-the-art In-Network Aggregation (INA) solutions like ATP fail to handle the sparse, bursty traffic of MoE workloads. These solutions suffer from severe tail latency amplification due to their reliance on slow, host-based fallbacks for collisions and overflows. To dismantle this communication wall, we propose HyNA, a fully serverless aggregation system that eliminates dedicated parameter-server nodes by leveraging a novel hardware-software co-designed switch architecture. HyNA couples wire-speed Reconfigurable Match Tables (RMT) with embedded RISC-V cores. By adhering to a strict on-chip closure principle, the system processes all traffic anomalies—including hash collisions and floating-point variances—entirely within the switch ASIC, converting unpredictable network RTT into deterministic on-chip latency. We validate our design through a 100 Gbps FPGA prototype and a 7nm ASIC synthesis analysis. Results demonstrate that HyNA incurs less than 3% silicon area overhead while improving aggregation throughput by 7.35X over BytePS and 1.4X over ATP. Crucially, in the MoE gradient synchronization phase, the system eliminates the fallback penalty and reduces synchronization time by up to 1.6X compared to dynamic INA baselines, without compromising bit-level model accuracy.

Yang Liu, Tianxiang Liu, Hai-Peng Yao · 0 citations

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