Eventually linearizable shared objects

DOI10.1145/1835698.1835723MaRDI QIDQ5176192zbMATH OpenOpenAlexFDO

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

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

availabilityeventual linearizabilitygraceful degradation

Mathematics Subject Classification ID

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

Recommendations

• The weakest failure detector for eventual consistency
• Linearizable implementations do not suffice for randomized distributed computation
• The weakest failure detector for eventual consistency
• Linearizable read/write objects
• Improved time bounds for linearizable implementations of abstract data types

Cites work

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

Cited in

(8)

• Linearizable read/write objects
• Improved time bounds for linearizable implementations of abstract data types
• The weakest failure detector for eventual consistency
• Strongly linearizable implementations, possibilities and impossibilities
• Sharing Objects by Read-Only References
• On Mixing Eventual and Strong Consistency: Bayou Revisited
• Linearizable implementations do not suffice for randomized distributed computation
• A timing assumption and two \(t\)-resilient protocols for Implementing an eventual leader service in asynchronous shared memory systems

Describes a project that uses

Uses Software

• CCSTM

This page was built for publication: Eventually linearizable shared objects

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