Efficient algorithms for optimistic crash recovery
From MaRDI portal
Recommendations
Cites work
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- Checkpointing and Rollback-Recovery for Distributed Systems
- On finding and updating shortest paths distributively
- Recovery in distributed systems using optimistic message logging and checkpointing
- Time, clocks, and the ordering of events in a distributed system
Cited in
(9)- Distributed recovery with \(K\)-optimistic logging.
- scientific article; zbMATH DE number 4209564 (Why is no real title available?)
- Recovery in distributed systems using optimistic message logging and checkpointing
- A real-time dynamic database crash recovery strategy
- Optimised Recovery with a Coordinated Checkpoint/Rollback Protocol for Domain Decomposition Applications
- Checkpointing and Rollback-Recovery for Distributed Systems
- You only live multiple times: a blackbox solution for reusing crash-stop algorithms in realistic crash-recovery settings
- An optimality proof for asynchronous recovery algorithms in distributed systems
- A simple and communication-efficient omega algorithm in the crash-recovery model
This page was built for publication: Efficient algorithms for optimistic crash recovery
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5136984)