Cited by 159Parallel Computing and Optimization TechniquesAdvanced Neural Network ApplicationsCloud Computing and Resource Management

SwapAdvisor: Pushing Deep Learning Beyond the GPU Memory Limit via Smart Swapping

Open access
Huang, Chien-Chin, Jin, Gu, Li, Jinyang·2020·Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems

Abstract

It is known that deeper and wider neural networks can achieve better accuracy. But it is difficult to continue the trend to increase model size due to limited GPU memory. One promising solution is to support swapping between GPU and CPU memory. However, existing work on swapping only handle certain models and do not achieve satisfactory performance. Deep learning computation is commonly expressed as a dataflow graph which can be analyzed to improve swapping. We propose SwapAdvisor, which performs joint optimization along 3 dimensions based on a given dataflow graph: operator scheduling, memory allocation, and swap decisions. SwapAdvisor explores the vast search space using a custom-designed genetic algorithm. Evaluations using a variety of large models show that SwapAdvisor can train models up to 12 times the GPU memory limit while achieving 53-99% of the throughput of a hypothetical baseline with infinite GPU memory.

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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

Integrity signals

Registry

Crossref · 10.1145/3373376.3378530

Cites

50 of 50 references verified0 citation errors · 0 not checkable

Statistics

Claims the paper makes

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

Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.

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.

Cites

Flagged first, then by citations

Research works printed but not linked: 9

  1. Audrundefinednas Gruslys, Rémi Munos, Ivo Danihelka, Marc Lanctot, and Alex Graves. 2016. Memory-Efficient Backpropagation through Time. In Proceedings of the 30th International Conference on Neural Information Processing Systems (NIPS'16).
  2. Patrick Judd, Jorge Albericio, Tayler Hetherington, Tor M. Aamodt, Natalie Enright Jerger, and Andreas Moshovos. 2016. Proteus: Ex- ploiting Numerical Precision Variability in Deep Neural Networks. In Proceedings of the 2016 International Conference on Supercomputing (ICS'16). Association for Computing Machinery, Article 23.
  3. Kim-Fung Man, Kit Sang Tang, and Sam Kwong. 2001. Genetic algo- rithms: concepts and designs. Springer Science & Business Media.
  4. Chen Meng, Minmin Sun, Jun Yang, Minghui Qiu, and Yang Gu. 2017. Training deeper models by GPU memory optimization on TensorFlow. In Proc. of ML Systems Workshop in NIPS.
  5. Lin Ning and Xipeng Shen. 2019. Deep Reuse: Streamline CNN Infer- ence on the Fly via Coarse-Grained Computation Reuse. In Proceedings of the ACM International Conference on Supercomputing (ICS'19). Asso- ciation for Computing Machinery, 438-448.
  6. Harmel Singh and Abdou Youssef. 1996. Mapping and scheduling heterogeneous task graphs using genetic algorithms. In 5th IEEE Het- erogeneous Computing Workshop (HCW'96).
  7. Yuan Yu, Martín Abadi, Paul Barham, Eugene Brevdo, Mike Burrows, Andy Davis, Jeff Dean, Sanjay Ghemawat, Tim Harley, Peter Hawkins, and et al. 2018. Dynamic Control Flow in Large-Scale Machine Learn- ing. In Proceedings of the Thirteenth EuroSys Conference (EuroSys'18). Association for Computing Machinery, Article 18.
  8. Zhen Zheng, Chanyoung Oh, Jidong Zhai, Xipeng Shen, Youngmin Yi, and Wenguang Chen. 2019. HiWayLib: A Software Framework for Enabling High Performance Communications for Heterogeneous Pipeline Computations. In Proceedings of the Twenty-Fourth Interna- tional Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS'19). Association for Computing Ma- chinery.
  9. Barret Zoph, Vijay Vasudevan, Jonathon Shlens, and Quoc V Le. 2018. Learning Transferable Architectures for Scalable Image Recognition. In 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition. 8697-8710.

Cited by

Sorted by citations

Authors
Huang, C.-C., Jin, G., & Li, J.
Affiliations
  • New York University (US)
  • New York University, New York, NY, USA
Venue
Proceedings of the Twenty-Fifth International Conference on Architectural Support for Programming Languages and Operating Systems
Publisher
ACM
Published
2020-03-09
Pages
1341-1355
OpenAlex
W3012479151
Cited by
158
References
49
Citations by year
2026: 24 · 2025: 30 · 2024: 36 · 2023: 23 · 2022: 21 · 2021: 22 · 2020: 2
FWCI
12.72
Type
conference paper
Language
en
Open access
Locations
International Conference on Architectural Support for Programming Languages and Operating Systems (ASPLOS) (publishedVersion)
Funders
National Science Foundation (CNS-1816717)
Topics
  • Physical Sciences › Computer Science › Hardware and Architecture › Parallel Computing and Optimization Techniques
  • Physical Sciences › Computer Science › Computer Vision and Pattern Recognition › Advanced Neural Network Applications
  • Physical Sciences › Computer Science › Information Systems › Cloud Computing and Resource Management
Keywords
GPU memory constraints, operator scheduling, memory allocation, training throughput

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