Demo Data from EDBT 2026 / reviewers in the wild / expert
Kaiwen Cao
dblp:395/2819
· DBLP profile ↗
1ranked-venue papers
1as first author
1since 2021 · last 2025
0009-0002-3764-4275ORCID · reported
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 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 |
Parallel and multicore computing · 100% |
Topics — the 2 heaviest of 2, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Parallel and multicore computing › parallel scheduling
heterogeneous multiprocessor scheduling |
0.9 | 1 | 2025 | MLCD: Machine Learning-Based Code Version and Device Selection for Heterogeneous Systems · IEEE Trans. Computers 2025 |
Parallel and multicore computing › parallel scheduling
runtime scheduling |
0.3 | 1 | 2025 | MLCD: Machine Learning-Based Code Version and Device Selection for Heterogeneous Systems · IEEE Trans. Computers 2025 |
Methods — techniques the papers use, named apart from their topics
machine learning · 0.9active learning · 0.9
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2025 | MLCD: Machine Learning-Based Code Version and Device Selection for Heterogeneous SystemsabstractHeterogeneous systems with hardware accelerators are increasingly common, and various optimized implementations/algorithms exist for computation kernels. However, no single best combination ofcode version and device(C&D) can outper-form others across all input cases, demanding a method to select the best C&D pair based on input. We presentmachinelearning-basedcode version anddevice selection method, namedMLCD, that uses input data characteristics to select the best C&D pair dynamically. We also apply active learning to reduce the number of samples needed to construct the model. Demonstrated on two different CPU-GPU systems, MLCD achieves near-optimal speed-up regardless of which systems tested. Concretely, reporting results from system one with mid-end hardwares, it achieves 99.9%, 95.6%, 99.9%, and 98.6% of the optimal acceleration attainable through the ideal choice of C&D pairs in General Matrix Multiply, PageRank, N-body Simulation, and K-Motif Counting, respectively. MLCD achieves a speed-up of 2.57×, 1.58×, 2.68×, and 1.09× compared to baselines without MLCD. Additionally, MLCD handles end-to-end applications, achieving up to 10% and 46% speed-up over GPU-only and CPU-only solutions with Graph Neural Networks. Furthermore, it achieves 7.28× average speed-up in execution latency over the state-of-the-art approach and determines suitable code versions for unseen input 108− 1010× faster. Kaiwen Cao, Hanchen Ye, Yihan Pang, Deming Chen |
IEEE Trans. Computers | 1 |