A technique for constructing highly available services

DOI10.1007/BF01762124MaRDI QIDQ1109559zbMATH OpenFDO

Authors Rivka Ladin, Barbara H. Liskov, Liuba Shrira

Publication date 1988

Published in Algorithmica (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF01762124

zbMATH Keywords

availabilitydata replicationdistributed systemimplementationreliability

Mathematics Subject Classification ID

Theory of operating systems (68N25)

Review text

This paper describes a general method for constructing a highly available service for use in a distributed system. It gives a specific implementation of the method and proves the implementation correct. The service consists of replicas that reside at several different locations in a network. It presents its clients with a consistent view of its state, but the view may contain old information. Clients can indicate how recent the information must be. The method can be used in applications satisfying certain semantic constraints. For applications that can use it, the method performs better than other replication techniques.

Recommendations

• Eventually-serializable data services
• Optimal inter-object correlation when replicating for availability
• scientific article; zbMATH DE number 1129896
• Proving the safety of highly-available distributed objects
• scientific article; zbMATH DE number 1696682

Cites work

• Guardians and Actions: Linguistic Support for Robust, Distributed Programs
• Operating systems. An advanced course

Cited in

(4)

• Generalized Paxos made Byzantine (and less complex)
• scientific article; zbMATH DE number 2016059 (Why is no real title available?)
• Proving the safety of highly-available distributed objects
• An algorithm for dynamic data allocation in distributed systems

This page was built for publication: A technique for constructing highly available services

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