Recovery in distributed systems using optimistic message logging and checkpointing
From MaRDI portal
Recommendations
- Distributed recovery with \(K\)-optimistic logging.
- An optimistic checkpointing and message logging approach for consistent global checkpoint collection in distributed systems
- Efficient algorithms for optimistic crash recovery
- Concurrent checkpoint initiation and recovery algorithms on asynchronous ring networks
- scientific article; zbMATH DE number 5187655
Cited in
(16)- Distributed speculative execution for reliability and fault tolerance: an operational semantics
- Efficient dependency tracking for relevant events in concurrent systems
- Some optimal algorithms for decomposed partially ordered sets
- Adaptive checkpointing in message passing distributed systems
- An optimistic checkpointing and message logging approach for consistent global checkpoint collection in distributed systems
- Techniques and applications of computation slicing
- Causality tracking in causal message-logging protocols
- Efficient algorithms for optimistic crash recovery
- scientific article; zbMATH DE number 2088430 (Why is no real title available?)
- An optimality proof for asynchronous recovery algorithms in distributed systems
- Detecting causal relationships in distributed computations: In search of the holy grail
- Efficient detection of restricted classes of global predicates
- Distributed recovery with \(K\)-optimistic logging.
- Consistent global checkpoints based on direct dependency tracking
- Finding missing synchronization in a distributed computation using controlled re-execution
- An efficient approach for constructing reliable distributed applications
This page was built for publication: Recovery in distributed systems using optimistic message logging and checkpointing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3495620)
