An optimality proof for asynchronous recovery algorithms in distributed systems

DOI10.1016/0020-0190(95)00094-SMaRDI QIDQ672018zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Efficient algorithms for optimistic crash recovery
• scientific article; zbMATH DE number 4209564
• scientific article; zbMATH DE number 5666638
• scientific article; zbMATH DE number 5187655
• The overhead of consensus failure recovery

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
• scientific article; zbMATH DE number 1487616 (Why is no real title available?)
• On recovery guarantees for angular synchronization
• scientific article; zbMATH DE number 4197453 (Why is no real title available?)

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)