The reviewed record of science sign in
Pith

arxiv: 2208.00184 · v1 · pith:WODOG4HE · submitted 2022-07-30 · cs.DC · cs.AI

Celeritas: Fast Optimizer for Large Dataflow Graphs

Reviewed by Pithpith:WODOG4HEopen to challenge →

classification cs.DC cs.AI
keywords celeritaslargemodelsmodelplacementtimedevicefast
0
0 comments X
read the original abstract

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.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.