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.

Linmei Wang

dblp:246/5533 · DBLP profile ↗
← Back
1ranked-venue papers
0as first author
1since 2021 · last 2026
0009-0006-7089-9199ORCID · reported

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.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Parallel and multicore computing · 61% Cloud and datacenter computing · 39%

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

TopicWeightPapersLastEvidence papers
Parallel and multicore computing › parallelization strategies
adaptive parallelism
1.012026
Arena: Efficiently Training Large Models via Dynamic Scheduling and Adaptive Parallelism Co-Design · EuroSys 2026
Cloud and datacenter computing
cluster resource management and scheduling
1.012026
Arena: Efficiently Training Large Models via Dynamic Scheduling and Adaptive Parallelism Co-Design · EuroSys 2026
Parallel and multicore computing › parallel computing › parallel machine learning
parallel training
1.012026
Arena: Efficiently Training Large Models via Dynamic Scheduling and Adaptive Parallelism Co-Design · EuroSys 2026
Cloud and datacenter computing › cluster resource management and scheduling › cluster scheduling
GPU cluster scheduling
0.312026
Arena: Efficiently Training Large Models via Dynamic Scheduling and Adaptive Parallelism Co-Design · EuroSys 2026

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

performance estimation · 1.0dynamic scheduling · 1.0adaptive parallelism · 1.0
YearPublicationVenuePosition
2026 Arena: Efficiently Training Large Models via Dynamic Scheduling and Adaptive Parallelism Co-Design
abstract
Efficiently training large-scale models (LMs) in GPU clusters involves two separate avenues: inter-job dynamic scheduling and intra-job adaptive parallelism (AP). However, existing dynamic schedulers struggle with large-model scheduling due to the mismatch between static parallelism (SP)-aware scheduling and AP-based execution, leading to cluster inefficiencies such as degraded throughput and prolonged job queuing. This paper presents Arena, a large-model training system that co-designs dynamic scheduling and adaptive parallelism to achieve high cluster efficiency. To reduce scheduling costs while improving decision quality, Arena designs low-cost, disaggregated profiling and AP-tailored, load-aware performance estimation, while unifying them by sharding the joint scheduling-parallelism optimization space via a grid abstraction. Building on this, Arena dynamically schedules profiled jobs in elasticity and heterogeneity dimensions, and executes them using efficient AP with pruned search space. Evaluated on heterogeneous testbeds and production workloads, Arena reduces job completion time by up to 49.3% and improves cluster throughput by up to 1.6X.
Chunyu Xue, Weihao Cui, Quan Chen 0002, Chen Chen 0067, Han Zhao 0005, Shulai Zhang, Linmei Wang, Limin Xiao 0001, Weifeng Zhang 0003, Jing Yang 0017, Bingsheng He, Minyi Guo
EuroSys7