Demo Data from EDBT 2026 / reviewers in the wild / expert
Tatiana V. Martsinkevich
dblp:136/7878
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 2015
—ORCID · none
Domains — the database's venue-derived domains; a paper can count in several
Systems, architecture and hardware · 2 · 1 first-author
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 · 93% High-performance computing · 7% |
Topics — the 5 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems › fault tolerance
checkpointing |
0.2 | 1 | 2013 | SPBC: leveraging the characteristics of MPI HPC applications for scalable checkpointing · SC 2013 |
Distributed systems › fault tolerance › checkpointing
coordinated checkpointing |
0.2 | 1 | 2013 | SPBC: leveraging the characteristics of MPI HPC applications for scalable checkpointing · SC 2013 |
Distributed systems
fault tolerance |
0.2 | 1 | 2013 | SPBC: leveraging the characteristics of MPI HPC applications for scalable checkpointing · SC 2013 |
Distributed systems › fault tolerance
message logging |
0.2 | 1 | 2013 | SPBC: leveraging the characteristics of MPI HPC applications for scalable checkpointing · SC 2013 |
High-performance computing
fault tolerance at scale |
0.0 | 1 | 2013 | SPBC: leveraging the characteristics of MPI HPC applications for scalable checkpointing · SC 2013 |
Methods — techniques the papers use, named apart from their topics
partial order relation · 0.2hierarchical protocol · 0.2
| Year | Publication | Venue | Position |
|---|---|---|---|
| 2015 | Fault-Tolerant Protocol for Hybrid Task-Parallel Message-Passing ApplicationsabstractWe present a fault-tolerant protocol for task-parallel message-passing applications to mitigate transient errors. The protocol requires the restart only of the task that experienced the error and transparently handles any MPI calls inside the task. The protocol is implemented in Nanos -- a dataflow runtime for task-based OmpSs programming model -- and the PMPI profiling layer to fully support hybrid OmpSs+MPI applications. In our experiments we demonstrate that our fault-tolerant solution has a reasonable overhead, with a maximum observed overhead of 4.5%. We also show that fine-grained parallelization is important for hiding the overheads related to the protocol as well as the recovery of tasks. Tatiana V. Martsinkevich, Omer Subasi, Osman S. Unsal, Franck Cappello, Jesús Labarta |
CLUSTER | 1 |
| 2013 | SPBC: leveraging the characteristics of MPI HPC applications for scalable checkpointingabstractThe high failure rate expected for future supercomputers requires the design of new fault tolerant solutions. Most checkpointing protocols are designed to work with any message-passing application but suffer from scalability issues at extreme scale. We take a different approach: We identify a property common to many HPC applications, namely channel-determinism, and introduce a new partial order relation, called always-happens-before relation, between events of such applications. Leveraging these two concepts, we design a protocol that combines an unprecedented set of features. Our protocol called SPBC combines in a hierarchical way coordinated checkpointing and message logging. It is the first protocol that provides failure containment without logging any information reliably apart from process checkpoints, and this, without penalizing recovery performance. Experiments run with a representative set of HPC workloads demonstrate a good performance of our protocol during both, failure-free execution and recovery. Thomas Ropars, Tatiana V. Martsinkevich, Amina Guermouche, André Schiper, Franck Cappello |
SC | 2 |