Eventually linearizable shared objects

DOI10.1145/1835698.1835723zbMath1315.68022OpenAlexW1985408196MaRDI QIDQ5176192

Marco Serafini, Dan Dobre, Péter Bokor, Neeraj Suri, Matthias Majuntke

Publication date: 2 March 2015

Published in: Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

availabilitygraceful degradationeventual linearizability

Mathematics Subject Classification ID

Models and methods for concurrent and distributed computing (process algebras, bisimulation, transition nets, etc.) (68Q85) Distributed systems (68M14) Reliability, testing and fault tolerance of networks and computer systems (68M15)

Related Items (1)

The weakest failure detector for eventual consistency

Uses Software

• CCSTM

Cites Work

• Elastic Transactions
• Toward a theory of transactional contention managers
• Software transactional memory

This page was built for publication: Eventually linearizable shared objects