Skip to content
Preprint

Sharing a Fabric with Collective Communication: Two Storage Penalties in Deep Learning Training

Sep 2026 · 0 citations · 23 references
Computer Science

TL;DR

This work shows that node-local NVMe staging via DYAD eliminates both effects of I/O stall latency and traffic-class contention on collective communication by keeping storage I/O off that path.

Abstract

Distributed DL training on HPC systems often shares one network fabric between NCCL/RCCL collective communication and parallel-filesystem I/O. Using a real GNN training workload on a Slingshot-11 system, we show that this sharing imposes two distinct costs. The primary cost is heavy-tailed DataLoader stalls: the typical DataLoader wait is just 15 ms at steady state, yet spikes to multiple seconds in 28% of Lustre iterations and 12% of VAST iterations. The secondary cost is traffic-class contention on collective communication: Lustre I/O stalls the all-reduce by up to 145$\times$ in an isolated benchmark. The two costs arise from different mechanisms. I/O stall latency affects any storage path that traverses the shared fabric, whereas all-reduce network contention occurs only when storage and collective communication share the same traffic class. Their common root cause is that storage I/O traverses the shared fabric. This work shows that node-local NVMe staging via DYAD (Our code is publicly available at https://github.com/flux-framework/dyad) eliminates both effects by keeping storage I/O off that path. Across a full training epoch, DYAD achieves a 7.4 times speedup over direct Lustre reads and a 1.06 times speedup over VAST. By the second epoch, once the local cache is fully warmed, DataLoader stalls are eliminated entirely, allowing DYAD to reach a 1.31 times speedup over VAST.

View source

Similar papers

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
Book Open access Aug 2026

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

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.

Zhiyong Chen, Kaihui Gao, Li Chen et al. · 0 citations
Preprint Sep 2026

VarioPath: Workload-Aware All-to-All Communication for PCIe GPU Clusters

VarioPath, an efficient AlltoAllv scheduling framework for PCIe GPU systems that combines an offline topology-aware analyzer with an online demand-aware scheduler, and shows average AlltoAllv speedups of 5.88x over FAST and 1.72x over DeepEP.

Yao Fei, Jin Fang, Si-Ze Zheng et al. · 0 citations
#machine learning Preprint Sep 2026

Tuning Collective Patterns to Alleviate Congestion in Shared AI Clusters

This paper builds a system, REACT, that tunes the recurring pattern of data exchange between GPU nodes (known as communication collectives) in response to congestion, and improves communication performance by 13%-38% under network congestion.

Eashan Gupta, Yong-Zhou Chen, Apoorve Mohan 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
Preprint Sep 2026

Joint Effects of GPU Server Topology, Parallelism, and Congestion Control on MoE Inference: A Controlled Simulation Study

Mixture-of-experts (MoE) models expand capacity via sparse activation, but inference across GPUs introduces tensor-parallel (TP) collectives and expert-parallel (EP) dispatch and combine operations. Completion time depends not just on communication volume but on how logical groups map onto intra-server interconnects, G...

Kai-Kai Yuan, Rui Xi, Yu Liu · 0 citations

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