Using what-if simulation on 3,079 ByteDance LLM training jobs, the authors estimate that stragglers waste 10.4% of GPU hours and trace most waste to pipeline-stage, sequence-length, and garbage-collection imbalances rather than hardware faults.
DropCompute: simple and more robust distributed synchronous training via compute variance reduction
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Background: Distributed training is essential for large scale training of deep neural networks (DNNs). The dominant methods for large scale DNN training are synchronous (e.g. All-Reduce), but these require waiting for all workers in each step. Thus, these methods are limited by the delays caused by straggling workers. Results: We study a typical scenario in which workers are straggling due to variability in compute time. We find an analytical relation between compute time properties and scalability limitations, caused by such straggling workers. With these findings, we propose a simple yet effective decentralized method to reduce the variation among workers and thus improve the robustness of synchronous training. This method can be integrated with the widely used All-Reduce. Our findings are validated on large-scale training tasks using 200 Gaudi Accelerators.
fields
cs.DC 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Understanding Stragglers in Large Model Training Using What-if Analysis
Using what-if simulation on 3,079 ByteDance LLM training jobs, the authors estimate that stragglers waste 10.4% of GPU hours and trace most waste to pipeline-stage, sequence-length, and garbage-collection imbalances rather than hardware faults.