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

Zeren Li

dblp:349/3385 · DBLP profile ↗
← Back
2ranked-venue papers
1as first author
2since 2021 · last 2026
—ORCID · conflict

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

Systems, architecture and hardware · 1 · 1 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author · 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
Cloud and datacenter computing · 87% High-performance computing · 13%

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

TopicWeightPapersLastEvidence papers
Cloud and datacenter computing
cluster resource management and scheduling
1.012026
Suika: Efficient and High-quality Re-scheduling of 3D-parallelized LLM Training Jobs in Shared Clusters · EuroSys 2026
Cloud and datacenter computing › cluster resource management and scheduling › cluster scheduling
GPU cluster scheduling
1.012026
Suika: Efficient and High-quality Re-scheduling of 3D-parallelized LLM Training Jobs in Shared Clusters · EuroSys 2026
High-performance computing › large-scale training
large-scale training systems
0.312026
Suika: Efficient and High-quality Re-scheduling of 3D-parallelized LLM Training Jobs in Shared Clusters · EuroSys 2026

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

topology-aware sorting · 1.0performance modeling · 1.0expand-and-balance algorithm · 1.0
YearPublicationVenuePosition
2026 Suika: Efficient and High-quality Re-scheduling of 3D-parallelized LLM Training Jobs in Shared Clusters
abstract
Large Language Models (LLMs) are usually trained with 3D (data, tensor, and pipeline) parallelism—in shared GPU clusters where the available resources are highly dynamic. Rescheduling the idle resources to ongoing jobs can help improve cluster utilization, but doing so for 3D-parallelized training jobs suffers large overheads in performance modeling, decision making, and redeployment. We present Suika, a cluster training system that supports efficient and high-quality resource rescheduling for 3D-parallelized LLM training jobs. Suika holistically addresses the complexity challenges by exploiting the incremental nature of rescheduling. For performance modeling, it builds an accurate performance estimator with non-disruptive online profiling. For decision-making, it employs topology-aware sorting and an expand-and-balance algorithm to reduce the complexity of resource allocation and job parallelization, without compromising decision quality. Suika further integrates a device-to-device redeployment method to leverage the overlapping nature of incremental reconfiguration for overhead reduction. Experiments on 64-GPU physical cluster and 1024-GPU simulated cluster show that, Suika achieves 1.29 ~ 1.31× reduction in average JCT compared to state-of-the-art schedulers.
Chen Chen 0067, Chunyu Xue, Qizhen Weng 0001, Zeren Li, Xuqi Zhu, Yongqiang Yang, Quan Chen 0002, Minyi Guo
EuroSys7
2024 Distributed Multi-Sensor Control for Multi-Target Tracking With a Sparsity-Promoting Objective Function
abstract
A distributed multi-sensor control method is presented for multi-target tracking. The problem is formulated as auctioned partially observed Markov decision processes (auctioned POMDPs), which is a tractable approach to approximate the solutions in a distributed manner. To ensure adequate coverage of the multi-sensor system, a sparsity-promoting objective function is also designed to reduce overlapping sensing areas, balancing a tradeoff between the control reward and sensor coverage. Simulation results demonstrate that the proposed distributed method achieves comparable tracking performance to the state-of-art centralized approach. Furthermore, the proposed sparsity-promoting objective function outperforms the conventional Cauchy-Schwarz divergence (CSD) in discovery performance.
Zeren Li, Yunze Cai, Henry Leung 0001
IEEE Signal Process. Lett.1