Demo Data from VLDB 2026 / reviewers in the wild / expert
Gregory Kerr
dblp:77/9668
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 2014
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 1
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 · 62% Parallel and multicore computing · 38% |
Topics — the 3 heaviest of 3, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems › fault tolerance
checkpointing |
0.2 | 1 | 2014 | Transparent checkpoint-restart over infiniband · HPDC 2014 |
Parallel and multicore computing
MPI |
0.1 | 1 | 2014 | Transparent checkpoint-restart over infiniband · HPDC 2014 |
Parallel and multicore computing › parallel computing › parallel programming languages
unified parallel c |
0.1 | 1 | 2014 | Transparent checkpoint-restart over infiniband · HPDC 2014 |
Methods — techniques the papers use, named apart from their topics
system-initiated checkpointing · 0.2kernel module avoidance · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2014 | Transparent checkpoint-restart over infinibandabstractTransparently saving the state of the InfiniBand network as part of distributed checkpointing has been a long-standing challenge for researchers. The lack of a solution has forced typical MPI implementations to include custom checkpoint-restart services that "tear down" the network, checkpoint each node in isolation, and then re-connect the network again. This work presents the first example of transparent, system-initiated checkpoint-restart that directly supports InfiniBand. The new approach simplifies current practice by avoiding the need for a privileged kernel module. The generality of this approach is demonstrated by applying it both to MPI and to Berkeley UPC (Unified Parallel C), in its native mode (without MPI). Scalability is shown by checkpointing 2,048 MPI processes across 128 nodes (with 16 cores per node). The run-time overhead varies between 0.8% and 1.7%. While checkpoint times dominate, the network-only portion of the implementation is shown to require less than 100 milliseconds (not including the time to locally write application memory to stable storage). Jiajun Cao, Gregory Kerr, Kapil Arya, Gene Cooperman |
HPDC | 2 |