Demo Data from VLDB 2026 / reviewers in the wild / expert
Shiman Meng
dblp:353/7187
· DBLP profile ↗
2ranked-venue papers
0as first author
2since 2021 · last 2024
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 2 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 |
Distributed systems · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Program analysis · 77% Software maintenance and evolution · 23% |
Topics — the 4 heaviest of 4, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Program analysis
data dependence analysis |
0.8 | 1 | 2024 | AutoCheck: Automatically Identifying Variables for Checkpointing by Data Dependency Analysis · SC 2024 |
Distributed systems › fault tolerance
checkpointing |
0.8 | 1 | 2024 | AutoCheck: Automatically Identifying Variables for Checkpointing by Data Dependency Analysis · SC 2024 |
Distributed systems
fault tolerance |
0.8 | 1 | 2024 | AutoCheck: Automatically Identifying Variables for Checkpointing by Data Dependency Analysis · SC 2024 |
Software maintenance and evolution
program comprehension |
0.2 | 1 | 2024 | AutoCheck: Automatically Identifying Variables for Checkpointing by Data Dependency Analysis · SC 2024 |
Methods — techniques the papers use, named apart from their topics
heuristic variable identification · 1.5data dependency graph · 1.5
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2024 | Distributed Order Recording Techniques for Efficient Record-and-Replay of Multi - Threaded ProgramsabstractAfter all these years and all these other shared memory programming frameworks, OpenMP is still the most popular one. However, its greater levels of non-deterministic execution makes debugging and testing more challenging. The ability to record and deterministically replay the program execution is key to address this challenge. However, scalably replaying OpenMP programs is still an unresolved problem. In this paper, we propose two novel techniques that use Distributed Clock (DC) and Distributed Epoch (DE) recording schemes to eliminate excessive thread synchronization for OpenMP record and replay. Our evaluation on representative HPC applications with ReOMP, which we used to realize DC and DE recording, shows that our approach is 2-5x more efficient than traditional approaches that synchronize on every shared-memory access. Furthermore, we demonstrate that our approach can be easily combined with MPI-Ievel replay tools to replay non-trivial MPI+OpenMP applications. We achieve this by integrating ReOMP into ReMPI, an existing scalable MPI record-and-replay tool, with only a small MPI-scale-independent runtime overhead. Shiman Meng, Luanzheng Guo, Kento Sato, Dong H. Ahn, Ignacio Laguna, Gregory L. Lee, Martin Schulz 0001 |
CLUSTER | 2 |
| 2024 | AutoCheck: Automatically Identifying Variables for Checkpointing by Data Dependency AnalysisabstractCheckpoint/Restart (C/R) has been widely deployed in numerous HPC systems, Clouds, and industrial data centers, which are typically operated by system engineers. Nevertheless, there is no existing approach that helps system engineers without domain expertise, and domain scientists without system fault tolerance knowledge identify those critical variables accounted for correct application execution restoration in a failure for C/R. To address this problem, we propose an analytical model and a tool (AutoCheck) that can automatically identify critical variables to checkpoint for C/R. AutoCheck relies on first, analytically tracking and optimizing data dependency between variables and other application execution state, and second, a set of heuristics that identify critical variables for checkpointing from the refined data dependency graph (DDG). AutoCheck allows programmers to pinpoint critical variables to checkpoint quickly within a few minutes. We evaluate AutoCheck on 14 representative HPC benchmarks, demonstrating that AutoCheck can efficiently identify correct critical variables to checkpoint. Shiman Meng, Wubiao Xu, Luanzheng Guo, Kento Sato |
SC | 3 |