CoChat

Taming unbalanced training workloads in deep learning with partial collective operations

Open access
Li, Shigang, Ben-Nun, Tal, Girolamo, Salvatore Di, Alistarh, Dan, Hoefler, Torsten · 2020 · Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming

The DOI matches its Crossref record; 67 of the 67 references it cites were found in a registry or an index.

Abstract

Load imbalance pervasively exists in distributed deep learning training systems, either caused by the inherent imbalance in learned tasks or by the system itself. Traditional synchronous Stochastic Gradient Descent (SGD) achieves good accuracy for a wide variety of tasks, but relies on global synchronization to accumulate the gradients at every training step. In this paper, we propose eager-SGD, which relaxes the global synchronization for decentralized accumulation. To implement eager-SGD, we propose to use two partial collectives: solo and majority. With solo allreduce, the faster processes contribute their gradients eagerly without waiting for the slower processes, whereas with majority allreduce, at least half of the participants must contribute gradients before continuing, all without using a central parameter server. We theoretically prove the convergence of the algorithms and describe the partial collectives in detail. Experiments are conducted on a variety of neural networks and datasets. The results on load-imbalanced environments show that eager-SGD achieves 2.64 X speedup (ResNet-50 on ImageNet) over the asynchronous centralized SGD, and achieves 1.29 X speedup (ResNet-50 on ImageNet) and 1.27X speedup (LSTM on UCF101) over the state-of-the-art synchronous decentralized SGDs, without losing accuracy.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1145/3332466.3374528

Cites

67 of 67 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Show all 67 references

Research works printed but not linked: 15

  1. Alistarh Dan, Advances in Neural Information Processing Systems 31. Curran Associates
  2. Chilimbi Trishul, 2014, 11th USENIX Symposium on Operating Systems Design and Implementation (OSDI 14)
  3. Dean Jeffrey, 2012, Ng
  4. Devries Terrance, 2017, Taylor
  5. Donahue Jeff, 2014, Sergio Guadarrama, Marcus Rohrbach, Subhashini Venugopalan, Kate Saenko, and Trevor Darrell.
  6. Gibiansky Andrew, 2017, Bringing HPC techniques to deep learning. (2017). URL http://research.baidu.com/bringing-hpc-techniques-deep-learning
  7. Hoefler T., International Conference for High Performance Computing, Networking, Storage and Analysis (SC'10)
  8. Hsieh Kevin, 2017, Proceedings of the 14th USENIX Conference on Networked Systems Design and Implementation (NSDI'17)
  9. Jayarajan Anand, 2019, Proceedings of the 2nd SysML Conference.
  10. 10.5555/3295222.3295285 · doi:10.5555/3295222.3295285
  11. Lian Xiangru, 2018, Proceedings of the 35th International Conference on Machine Learning (Proceedings of Machine Learning Research), Jennifer Dy and Andreas Krause (Eds.), 80
  12. Interface Forum Message Passing, 2015, MPI: A Message-Passing Interface Standard Version 3.1.
  13. Soomro Khurram, 2012, Amir Roshan Zamir, and Mubarak Shah
  14. 10.5555/3020948.3021030 · doi:10.5555/3020948.3021030
  15. 10.1109/cvpr.2015.7299101 · DOI · Paper page

Cited by

See all 60

Metadata

Authors
Li, S., Ben-Nun, T., Girolamo, S. D., Alistarh, D., & Hoefler, T.
Affiliations
  • ETH Zurich (CH)
  • ETH Zurich
  • Institute of Science and Technology Austria (AT)
Venue
Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming
Publisher
ACM
Published
2020-02-19
Pages
45-61
OpenAlex
W2967558351
Cited by
57
References
67
Citations by year
2026: 2 · 2025: 10 · 2024: 7 · 2023: 8 · 2022: 11 · 2021: 11 · 2020: 8
FWCI
3.63
Type
conference paper
Language
en
Open access
Locations
  • ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • arXiv (Cornell University)
Funders
European Research Council (ERC) under the European Union?s Horizon 2020 programme, grant agreement DAPP, (No. 678880)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Stochastic Gradient Optimization Techniques
  • Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
  • Physical Sciences › Computer Science › Artificial Intelligence › Machine Learning and Data Classification
Keywords
load imbalance, distributed deep learning training, AllReduce, asynchronous SGD, convergence analysis, speedup

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Taming unbalanced training workloads in deep learning with partial collective operations. https://app.cochat.ai/papers/10.1145/3332466.3374528
The paper
Li, S., Ben-Nun, T., Girolamo, S. D., Alistarh, D., & Hoefler, T. (2020). Taming unbalanced training workloads in deep learning with partial collective operations. Proceedings of the 25th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming. https://doi.org/10.1145/3332466.3374528

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.