Communication-based prevention of useless checkpoints in distributed computations
From MaRDI portal
Publication:5137893
DOI10.1007/S004460050003zbMath1448.68107OpenAlexW2057973079MaRDI QIDQ5137893
Robert H. B. Netzer, Jean-Michel Helary, Michel Raynal, Achour Mostefaoui
Publication date: 3 December 2020
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s004460050003
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)
Related Items (8)
A Normalized Form for FIFO Protocols Traces, Application to the Replay of Mode-based Protocols ⋮ Efficient Communication Induced Checkpointing Protocol for Broadcast Network-based Distributed Systems ⋮ FNB: fast non-blocking coordinated checkpointing protocol for distributed systems ⋮ A multi-cycle checkpointing protocol that ensures strict 1-rollback ⋮ On the no-Z-cycle property in distributed executions ⋮ Necessary and sufficient conditions for transaction-consistent global checkpoints in a distributed database system ⋮ Impossibility of scalar clock-based communication-induced checkpointing protocols ensuring the RDT property ⋮ Interval consistency of asynchronous distributed computations
Cites Work
- Evaluations of domino-free communication-induced checkpointing protocols
- Distributed breakpoint detection in message-passing programs
- On distributed snapshots
- Rollback-dependency trackability
- Checkpointing and Rollback-Recovery for Distributed Systems
- State Restoration in Systems of Communicating Processes
- Time, clocks, and the ordering of events in a distributed system
This page was built for publication: Communication-based prevention of useless checkpoints in distributed computations