UMPIPE: Unequal Microbatches-Based Pipeline Parallelism for Deep Neural Network Training

The increasing need for large-scale deep neural networks (DNN) has made parallel training an area of intensive focus. One effective method, microbatch-based pipeline parallelism (notably GPipe), accelerates parallel training in various architectures. However, existing parallel training architectures normally use equal data partitioning (EDP), where each layer's process maintains identical microbatch-sizes. EDP may hinder training speed because different processes often require varying optimal microbatch-sizes. To address this, we introduce UMPIPE, a novel framework for unequal microbatches-based pipeline parallelism. UMPIPE enables unequal data partitions (UEDP) across processes to optimize resource utilization. We develop a recurrence formula to calculate the time cost in UMPIPE by considering both computation and communication processes. To further enhance UMPIPE's efficiency, we propose the Dual-Chromosome Genetic Algorithm for UMPIPE (DGAP) that accounts for the independent time costs of forward and backward propagation. Furthermore, we present TiDGAP, a two-level improvement on DGAP. TiDGAP accelerates the process by simultaneously calculating the end time for multiple individuals and microbatches using matrix operations. Our extensive experiments validate the dual-chromosome strategy's optimization benefits and TiDGAP's acceleration capabilities. TiDGAP can achieve better training schemes than baselines, such as the local greedy algorithm and the global greedy-based dynamic programming. Compared to (GPipe, PipeDream), UMPIPE achieves increases in training speed: <inline-formula><tex-math notation="LaTeX">$(13.89,11.09)\%$</tex-math></inline-formula> for GPT1-14, <inline-formula><tex-math notation="LaTeX">$(17.11, 7.96)\%$</tex-math></inline-formula> for VGG16 and <inline-formula><tex-math notation="LaTeX">$\geq (170,100)\%$</tex-math></inline-formula> for simulation networks.

Authors

Institutions

Publication Details

Journal
IEEE Transactions on Parallel and Distributed Systems
Published
2024-12-11
DOI
https://doi.org/10.1109/tpds.2024.3515804
Citations
3
Primary Topic
Neural Networks and Reservoir Computing
Type
article
Field-Weighted Citation Impact
1.04
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

UMPIPE: Unequal Microbatches-Based Pipeline Parallelism for Deep Neural Network Training

Wenhong Tian, Rajkumar Buyya, Guangyao Zhou, Kui Wu
3 citations
IEEE Transactions on Parallel and Distributed Systems
Neural Networks and Reservoir Computing
1.04
article

UMPIPE: Unequal Microbatches-Based Pipeline Parallelism for Deep Neural Network Training

Wenhong Tian, Rajkumar Buyya, Guangyao Zhou, Kui Wu
article en
3 citations

Abstract

The increasing need for large-scale deep neural networks (DNN) has made parallel training an area of intensive focus. One effective method, microbatch-based pipeline parallelism (notably GPipe), accelerates parallel training in various architectures. However, existing parallel training architectures normally use equal data partitioning (EDP), where each layer's process maintains identical microbatch-sizes. EDP may hinder training speed because different processes often require varying optimal microbatch-sizes. To address this, we introduce UMPIPE, a novel framework for unequal microbatches-based pipeline parallelism. UMPIPE enables unequal data partitions (UEDP) across processes to optimize resource utilization. We develop a recurrence formula to calculate the time cost in UMPIPE by considering both computation and communication processes. To further enhance UMPIPE's efficiency, we propose the Dual-Chromosome Genetic Algorithm for UMPIPE (DGAP) that accounts for the independent time costs of forward and backward propagation. Furthermore, we present TiDGAP, a two-level improvement on DGAP. TiDGAP accelerates the process by simultaneously calculating the end time for multiple individuals and microbatches using matrix operations. Our extensive experiments validate the dual-chromosome strategy's optimization benefits and TiDGAP's acceleration capabilities. TiDGAP can achieve better training schemes than baselines, such as the local greedy algorithm and the global greedy-based dynamic programming. Compared to (GPipe, PipeDream), UMPIPE achieves increases in training speed: <inline-formula><tex-math notation="LaTeX">$(13.89,11.09)\%$</tex-math></inline-formula> for GPT1-14, <inline-formula><tex-math notation="LaTeX">$(17.11, 7.96)\%$</tex-math></inline-formula> for VGG16 and <inline-formula><tex-math notation="LaTeX">$\geq (170,100)\%$</tex-math></inline-formula> for simulation networks.

IEEE Transactions on Parallel and Distributed SystemsVol. 36(2)
University of Electronic Science and Technology of China (CN), The University of Melbourne (AU), University of Victoria (CA), Cloud Computing Center (CN), Southwest Jiaotong University (CN)
Openalex Percentile: Top 18%
Neural Networks and Reservoir Computing
1.04
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.