Demo Data from VLDB 2026 / reviewers in the wild / expert
Lyndon Clarke
dblp:98/4932
· DBLP profile ↗
2ranked-venue papers
1as first author
0since 2021 · last 1995
—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 · 72% Parallel and multicore computing · 28% |
Topics — the 5 heaviest of 6, each with the papers that count most for it
| Topic | Weight | Papers | Last | Evidence papers |
|---|---|---|---|---|
Distributed systems
fault tolerance |
0.0 | 1 | 1995 | Portable Checkpointing and Recovery · HPDC 1995 |
Parallel and multicore computing
parallel libraries |
0.0 | 1 | 1995 | Portable Checkpointing and Recovery · HPDC 1995 |
Distributed systems › fault tolerance
rollback recovery |
0.0 | 1 | 1995 | Portable Checkpointing and Recovery · HPDC 1995 |
Distributed systems › fault tolerance › checkpointing
checkpointing and migration |
0.0 | 1 | 1995 | Portable Checkpointing and Recovery · HPDC 1995 |
Distributed systems › distributed system architecture › distributed operating systems
process migration |
0.0 | 1 | 1995 | Portable Checkpointing and Recovery · HPDC 1995 |
Methods — techniques the papers use, named apart from their topics
MPI · 0.0CHIMP · 0.0
| Year | Publication | Venue | Position |
|---|---|---|---|
| 1995 | Portable Checkpointing and RecoveryabstractThis paper presents a checkpointing scheme that was implemented in a parallel library that runs on top of CHIMP/MPI. The main goals of the checkpointing mechanism are portability and efficiency. It runs on every platform supported by MPI in a machine-independent way. The scheme allows the migration of checkpoints and offers a flexible recovery mechanism based on data-reconfiguration. Some performance results will be presented at the end of the paper together with some techniques that can be used to increase the efficiency of the checkpointing mechanism. Luís Moura Silva, João Gabriel Silva, Simon Chapple, Lyndon Clarke |
HPDC | 4 |
| 1991 | Tiny: An efficient routing harness for the Inmos transputerabstractAbstract Message‐based MIMD computers that support arbitrary connections over a small number of communications links cannot support parallel applications with complex communication patterns unless the support software includes message routing. This paper describes design issues for such software, using a router for the Inmos T800 transputer called Tiny as an example. Performance figures show that Tiny achieves near optimal routing performance given the hardware limits. Modifications to Tiny to monitor message traffic are also described. Lyndon Clarke, Greg Wilson |
Concurr. Pract. Exp. | 1 |