Back to Search Start Over

SMSG: Profiling-Free Parallelism Modeling for Distributed Training of DNN.

Authors :
Wang, Haoran
Tachon, Thibaut
Li, Chong
Robert, Sophie
Limet, Sébastien
Source :
International Journal of Parallel Programming. Jun2023, Vol. 51 Issue 2/3, p109-127. 19p.
Publication Year :
2023

Abstract

The increasing size of deep neural networks (DNNs) raises a high demand for distributed training. An expert could find good hybrid parallelism strategies, but designing suitable strategies is time and labor-consuming. Therefore, automating parallelism strategy generation is crucial and desirable for DNN designers. Some automatic searching approaches have recently been studied to free the experts from the heavy parallel strategy conception. However, these approaches all rely on a numerical cost model, which requires heavy profiling results that lack portability. These profiling-based approaches cannot lighten the strategy generation work due to the non-reusable profiling value. Our intuition is that there is no need to estimate the actual execution time of the distributed training but to compare the relative cost of different strategies. We propose SMSG (Symbolic Modeling for Strategy Generation), which analyses the cost based on the communication and computation semantics. With SMSG, the parallel cost analyses are decoupled from hardware characteristics. SMSG defines cost functions for each kind of operator to quantitatively evaluate the amount of data for computation and communication, which eliminates the heavy profiling tasks. Besides, SMSG introduces how to apply functional transformation by using the Third Homomorphism theorem to control the high searching complexity. Our experiments show that SMSG can find good hybrid parallelism strategies to generate an efficient training performance similar to the state of the art. Moreover, SMSG covers a wide variety of DNN models with good scalability. SMSG provides good portability when changing training configurations that a profiling-based approach cannot. [ABSTRACT FROM AUTHOR]

Details

Language :
English
ISSN :
08857458
Volume :
51
Issue :
2/3
Database :
Academic Search Index
Journal :
International Journal of Parallel Programming
Publication Type :
Academic Journal
Accession number :
162802420
Full Text :
https://doi.org/10.1007/s10766-022-00741-6