mlsanityData to 14 Oct 2026

Celeritas: Fast Optimizer for Large Dataflow Graphs

arXiv 2208.00184 ↗First posted 30 Jul 2022cs.DC cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

The rapidly enlarging neural network models are becoming increasingly challenging to run on a single device. Hence model parallelism over multiple devices is critical to guarantee the efficiency of training large models. Recent proposals fall short either in long processing time or poor performance. Therefore, we propose Celeritas, a fast framework for optimizing device placement for large models. Celeritas employs a simple but efficient model parallelization strategy in the Standard Evaluation, and generates placement policies through a series of scheduling algorithms. We conduct experiments to deploy and evaluate Celeritas on numerous large models. The results show that Celeritas not only reduces the placement policy generation time by 26.4% but also improves the model running time by 34.2% compared to most advanced methods.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 9 of its 30 references that are in the map. First posted on arXiv 30 Jul 2022.

Builds on

9 of 30 references.

References · 9

  1. 2017Attention Is All You Needcited by 60,361
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,399
  3. 2021Swin Transformer: Hierarchical Vision Transformer using Shifted Windowscited by 12,139
  4. 2015Rethinking the Inception Architecture for Computer Visioncited by 5,475
  5. 2014Going Deeper with Convolutionscited by 4,241
  6. 2016Google's Neural Machine Translation System: Bridging the Gap between Human and Machine Translationcited by 1,475
  7. 2017Device Placement Optimization with Reinforcement Learningcited by 86
  8. 2020Transferable Graph Optimizers for ML Compilerscited by 29
  9. 2019Placeto: Learning Generalizable Device Placement Algorithms for Distributed Machine Learningcited by 26

Built on by

Cited by year

Citing papers per year: 2023: 1.

1 paper.