Machine Learning on Volatile Instances: Convergence, Runtime, and Cost Tradeoffs
Machine Learning on Volatile Instances: Convergence, Runtime, and Cost Tradeoffs
复制标题
DOI:
10.1109/tnet.2021.3112082
复制
发表时间:
2022-02
期刊:
影响因子:
--
通讯作者:
Xiaoxi Zhang;Jianyu Wang;Li-Feng Lee;T. Yang;Akansha Kalra;Gauri Joshi;Carlee Joe-Wong
中科院分区:
文献类型:
--
作者:
Xiaoxi Zhang;Jianyu Wang;Li-Feng Lee;T. Yang;Akansha Kalra;Gauri Joshi;Carlee Joe-Wong
Due to the massive size of the neural network models and training datasets used in machine learning today, it is imperative to distribute stochastic gradient descent (SGD) by splitting up tasks such as gradient evaluation across multiple worker nodes. However, running distributed SGD can be prohibitively expensive because it may require specialized computing resources such as GPUs for extended periods of time. We propose cost-effective strategies to exploit volatile cloud instances that are cheaper than standard instances, but may be interrupted by higher priority workloads. To the best of our knowledge, this work is the first to quantify how variations in the number of active worker nodes (as a result of preemption) affect SGD convergence and the time to train the model. By understanding these trade-offs between preemption probability of the instances, accuracy, and training time, we are able to derive practical strategies for configuring distributed SGD jobs on volatile instances such as Amazon EC2 spot instances and other preemptible cloud instances. Experimental results show that our strategies achieve good training performance at substantially lower cost.