Making objects writable

DOI10.1145/2611462.2611483MaRDI QIDQ2943638zbMATH OpenOpenAlexFDO

Authors Zahra Aghazadeh, Wojciech Golab, Philipp Woelfel

Publication date 3 September 2015

Published in Proceedings of the 2014 ACM symposium on Principles of distributed computing (Search for Journal in Brave)

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

zbMATH Keywords

shared memorymemory management\(k\)-word registerslong-lived test-and-setwritable objects

Mathematics Subject Classification ID

Modes of computation (nondeterministic, parallel, interactive, probabilistic, etc.) (68Q10) Distributed algorithms (68W15) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)

Recommendations

• Concurrent use of write-once memory
• Composite registers
• On the inherent weakness of conditional primitives
• Wait-free linearization with an assertional proof
• Self-stabilization of wait-free shared memory objects

Cited in

(8)

• Fast and fair randomized wait-free locks
• Concurrent use of write-once memory
• An almost tight RMR lower bound for abortable test-and-set
• Principles of Distributed Systems
• Efficient Bounded Timestamping from Standard Synchronization Primitives
• Brief Announcement: Efficient Recoverable Writable-CAS
• Concurrent disjoint set union
• Step-optimal implementations of large single-writer registers

This page was built for publication: Making objects writable

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