Skip to yearly menu bar Skip to main content


DropCompute: simple and more robust distributed synchronous training via compute variance reduction

Niv Giladi · Shahar Gottlieb · moran shkolnik · Asaf Karnieli · Ron Banner · Elad Hoffer · Kfir Y. Levy · Daniel Soudry

Great Hall & Hall B1+B2 (level 1) #1125
[ ]
[ Paper [ Poster [ OpenReview
Wed 13 Dec 8:45 a.m. PST — 10:45 a.m. PST


Background: Distributed training is essential for large scale training of deep neural networks (DNNs). The dominant methods for large scale DNN training are synchronous (e.g. All-Reduce), but these require waiting for all workers in each step. Thus, these methods are limited by the delays caused by straggling workers.Results: We study a typical scenario in which workers are straggling due to variability in compute time. We find an analytical relation between compute time properties and scalability limitations, caused by such straggling workers. With these findings, we propose a simple yet effective decentralized method to reduce the variation among workers and thus improve the robustness of synchronous training. This method can be integrated with the widely used All-Reduce. Our findings are validated on large-scale training tasks using 200 Gaudi Accelerators.

Chat is not available.