Efficient algorithms for optimistic crash recovery
From MaRDI portal
Publication:5136984
DOI10.1007/BF02280832zbMath1448.68476OpenAlexW1970491565MaRDI QIDQ5136984
No author found.
Publication date: 30 November 2020
Published in: Distributed Computing (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf02280832
checkpointingdistributed algorithmrollback recoverycrash recoveryoptimistic message loggingmessage comlexity
Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)
Cites Work
- Recovery in distributed systems using optimistic message logging and checkpointing
- Checkpointing and Rollback-Recovery for Distributed Systems
- A Distributed Algorithm for Minimum-Weight Spanning Trees
- On finding and updating shortest paths distributively
- Time, clocks, and the ordering of events in a distributed system
This page was built for publication: Efficient algorithms for optimistic crash recovery