Efficient fork-linearizable access to untrusted shared memory

DOI10.1145/1281100.1281121zbMath1283.68081OpenAlexW2147500445MaRDI QIDQ5401401

Christian Cachin, Alexander Shraer, Abhi Shelat

Publication date: 13 March 2014

Published in: Proceedings of the twenty-sixth annual ACM symposium on Principles of distributed computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/1281100.1281121

zbMATH Keywords

arbitrary failuresstorage emulationsfork-consistency

Mathematics Subject Classification ID

Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15) Distributed algorithms (68W15)

Related Items (3)

Verifying the consistency of remote untrusted services with conflict-free operations ⋮ Fork sequential consistency is blocking ⋮ Integrity and Consistency for Untrusted Services

This page was built for publication: Efficient fork-linearizable access to untrusted shared memory