Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Hengzhao Li

dblp:436/8959 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 1 · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Artificial intelligence
1 paper
Efficient and distributed learning · 100%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 100%

Topics — the 4 heaviest of 4, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Machine learning › Efficient and distributed learning
distributed training
1.012026
LIBPipe: Efficient Load Imbalance Pipeline Model Parallelism for Large Models Training · IEEE Trans. Parallel Distributed Syst. 2026
Machine learning › Efficient and distributed learning › distributed training › distributed training systems
load imbalance
1.012026
LIBPipe: Efficient Load Imbalance Pipeline Model Parallelism for Large Models Training · IEEE Trans. Parallel Distributed Syst. 2026
Machine learning › Efficient and distributed learning › distributed training › model parallelism
pipeline parallelism
1.012026
LIBPipe: Efficient Load Imbalance Pipeline Model Parallelism for Large Models Training · IEEE Trans. Parallel Distributed Syst. 2026
Parallel and multicore computing
pipeline parallelism
1.012026
LIBPipe: Efficient Load Imbalance Pipeline Model Parallelism for Large Models Training · IEEE Trans. Parallel Distributed Syst. 2026

Methods — techniques the papers use, named apart from their topics

unequal partitioning · 2.0performance-guided search · 2.0
YearPublicationVenuePosition
2026 LIBPipe: Efficient Load Imbalance Pipeline Model Parallelism for Large Models Training
abstract
With the increasing size of datasets and the expansion of Deep Neural Networks (DNNs), the training process has become exceedingly time-consuming. Distributed training, specifically the Pipeline Model Parallelism (PMP) method, commonly mitigates this problem but suffers from bubble time delays. This paper proposes LIBPipe, a pipeline training framework that explicitly incorporates a load-imbalance method to reduce bubble time in PMP. Within LIBPipe, a model-unequal-partitioning method is designed from the perspective of load imbalance to reshape the pipeline execution pattern and significantly shorten idle periods during training. On top of this method, a performance-guided unequal-partitioning search algorithm is developed to efficiently identify near-optimal partitioning strategies under memory constraints. The paper theoretically proves the time efficiency of adopting load imbalance in pipeline models. Comprehensive experiments are conducted on an 8-GPU server to evaluate the efficiency of LIBPipe, using the IMDB and mini-ImageNet datasets as well as well-known models such as BERT and ResNet. The BERT-series models achieve a maximum throughput improvement of 60.3%, while the ResNet-series models achieve a maximum improvement of 74.1%.
Bin Liu 0023, Hengzhao Li, Zeyu Ji, Hongming Zhang 0002, Keqin Li 0001
IEEE Trans. Parallel Distributed Syst.3