Demo Data from EDBT 2026 / reviewers in the wild / expert
Gaurav Suri
dblp:48/5995
· DBLP profile ↗
1ranked-venue papers
0as first author
0since 2021 · last 1997
—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 · 100% | |
| Software engineering, system software, and programming languages
1 paper |
Software maintenance and evolution · 100% |
Topics — the 4 heaviest of 5, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems › fault tolerance › rollback recovery
checkpointing and message logging |
0.0 | 1 | 1997 | Progressive Retry for Software Failure Recovery in Message-Passing Applications · IEEE Trans. Computers 1997 |
Distributed systems
fault tolerance |
0.0 | 1 | 1997 | Progressive Retry for Software Failure Recovery in Message-Passing Applications · IEEE Trans. Computers 1997 |
Distributed systems › operating system support › interprocess communication
message-passing systems |
0.0 | 1 | 1997 | Progressive Retry for Software Failure Recovery in Message-Passing Applications · IEEE Trans. Computers 1997 |
Distributed systems
re-execution |
0.0 | 1 | 1997 | Progressive Retry for Software Failure Recovery in Message-Passing Applications · IEEE Trans. Computers 1997 |
Methods — techniques the papers use, named apart from their topics
message replaying · 0.0message reordering · 0.0checkpointing · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1997 | Progressive Retry for Software Failure Recovery in Message-Passing ApplicationsabstractA method of execution retry for bypassing software faults in message-passing applications is described in this paper. Based on the techniques of checkpointing and message logging, we demonstrate the use of message replaying and message reordering as two mechanisms for achieving localized and fast recovery. The approach gradually increases the rollback distance and the number of affected processes when a previous retry fails, and is therefore named progressive retry. Examples from telecommunications software systems and performance measurements from an application-level implementation are described to illustrate the benefits of the scheme. Yi-Min Wang, Yennun Huang, W. Kent Fuchs, Chandra M. R. Kintala, Gaurav Suri |
IEEE Trans. Computers | 5 |