Skip to content
Preprint

Accurate Simulation of Distributed Training Jobs with Network Contention Modeling

Sep 2026 · 0 citations · 34 references
Computer Science

TL;DR

MoSim is introduced, a GPU-cluster simulator that models DT job execution under dynamic network contention, which reduces simulation error for average JCT by up to 3.28%, and reduces input construction overhead by 44.6% by avoiding real-GPU profiling.

Abstract

Trace-driven simulation is widely used to evaluate distributed training (DT) jobs in GPU clusters, but existing simulators either ignore network contention or approximate it with a fixed penalty. This misses how scheduling decisions determine which jobs share server network interfaces and inter-server links, thereby changing networking time during training. As a result, our motivating experiments demonstrate that they incur large errors, reaching up to 73.64% mean absolute percentage error (MAPE) in average job completion time (JCT). This paper introduces MoSim, a GPU-cluster simulator that models DT job execution under dynamic network contention. MoSim combines GPU-free characterization with network contention model: it obtains each job's compute time, networking time, and networking volume without GPUs, then uses the current worker assignment to estimate how shared network interfaces affect each job's iteration time. Our evaluation shows that, compared with existing simulators, MoSim reduces simulation error for average JCT by up to 3.28$\times$, tail (99th-percentile) JCT by up to 7.79$\times$, and makespan by up to 8.48$\times$, while modeling NIC contention factors with only 8.63% error on average. By avoiding real-GPU profiling, MoSim also reduces input construction overhead by 44.6$\times$.

View source

Similar papers

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
Open access Sep 2026

Approximate Edge-Server Placement Evaluation for Cyber-Physical Urban Rail Systems

Trace-driven simulation captures mobility, communication, compute contention, and deadlines in edge-server placement studies, but repeated evaluation of candidate placements is costly. This paper compares static density-based proxies and sampled-window simulation with full-horizon simulation on 990 placements across th...

Krisztián Póra, R. Lovas, Attila Csaba Marosi · 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
Preprint Oct 2026

MCCL: Measurement-based Collective Communication Library

Collective communication is a critical performance bottleneck in large-scale distributed training. Existing libraries and synthesis frameworks compute open-loop schedules once, assuming a static topology and peak link capacities. In production, however, persistent gray failures can silently degrade link throughput and...

Michele Ferrero, Gabriele Castellano, P. Medagliani et al. · 0 citations
Preprint Oct 2026

Ofan: Optimal Load Balancing for AI Training

Ofan, a switch-based destination-aware LB scheme that can reach $O(1)$ queueing, is suggested, a switch-based destination-aware LB scheme that can reach $O(1)$ queueing.

Sarah McClure, E. Cohen, Jakob Krebs 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.