Recovery in distributed systems using optimistic message logging and checkpointing

DOI10.1016/0196-6774(90)90022-7zbMath0711.68009OpenAlexW1963836890MaRDI QIDQ3495620

David B. Johnson, Willy Zwaenepoel

Publication date: 1990

Published in: Journal of Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0196-6774(90)90022-7

zbMATH Keywords

distributed systemscheckpointingoptimistic message logging

Mathematics Subject Classification ID

Reliability, testing and fault tolerance of networks and computer systems (68M15) Theory of operating systems (68N25)

Related Items (14)

Consistent global checkpoints based on direct dependency tracking ⋮ Detecting causal relationships in distributed computations: In search of the holy grail ⋮ Distributed speculative execution for reliability and fault tolerance: an operational semantics ⋮ Efficient detection of restricted classes of global predicates ⋮ An optimistic checkpointing and message logging approach for consistent global checkpoint collection in distributed systems ⋮ Techniques and applications of computation slicing ⋮ Efficient dependency tracking for relevant events in concurrent systems ⋮ Efficient algorithms for optimistic crash recovery ⋮ Causality tracking in causal message-logging protocols ⋮ Finding missing synchronization in a distributed computation using controlled re-execution ⋮ An efficient approach for constructing reliable distributed applications ⋮ An optimality proof for asynchronous recovery algorithms in distributed systems ⋮ Some optimal algorithms for decomposed partially ordered sets ⋮ Adaptive checkpointing in message passing distributed systems

This page was built for publication: Recovery in distributed systems using optimistic message logging and checkpointing