An optimality proof for asynchronous recovery algorithms in distributed systems

DOI10.1016/0020-0190(95)00094-SzbMATH Open0875.68041OpenAlexW2167043369MaRDI QIDQ672018FDOQ672018

Mukesh Singhal, Friedemann Mattern

Publication date: 27 February 1997

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0020-0190(95)00094-s

zbMATH Keywords

Distributed systemsAsynchronous recovery algorithmsConsistent cut

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10)

Cites Work

• Checkpointing and Rollback-Recovery for Distributed Systems
• Recovery in distributed systems using optimistic message logging and checkpointing

Cited In (4)

• Second-level algorithms, superrecursivity, and recovery problem in distributed systems
• On recovery guarantees for angular synchronization
• Title not available (Why is that?)
• Title not available (Why is that?)

   Recommendations

• Efficient algorithms for optimistic crash recovery 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• Title not available (Why is that?) 👍 👎
• The overhead of consensus failure recovery 👍 👎

This page was built for publication: An optimality proof for asynchronous recovery algorithms in distributed systems

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q672018)