RMR-efficient implementations of comparison primitives using read and write operations

DOI10.1007/s00446-011-0150-8zbMath1429.68026OpenAlexW2063992960MaRDI QIDQ1938362

Philipp Woelfel, Danny Hendler, Vassos Hadzilacos, Wojciech Golab

Publication date: 4 February 2013

Published in: Distributed Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00446-011-0150-8

zbMATH Keywords

shared memoryconsensusmutual exclusionremote memory referencescomparison primitivesload-linked/store-conditional

Mathematics Subject Classification ID

Distributed systems (68M14)

Related Items (3)

Word-Size RMR Tradeoffs for Recoverable Mutual Exclusion ⋮ Recoverable mutual exclusion ⋮ Unnamed Item

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Closing the complexity gap between FCFS mutual exclusion and mutual exclusion
• A generic local-spin fetch-and-\(\phi\)-based mutual exclusion algorithm
• A complexity separation between the cache-coherent and distributed shared memory models
• On the space complexity of randomized synchronization
• Contention in shared memory algorithms
• An Ω ( n log n ) lower bound on the cost of mutual exclusion
• Randomized wait-free concurrent objects (extended abstract)
• Practical implementations of non-blocking synchronization primitives
• An $O(1)$ RMRs Leader Election Algorithm
• Constant-RMR implementations of CAS and other synchronization primitives using read and write operations
• Distributed Computing

This page was built for publication: RMR-efficient implementations of comparison primitives using read and write operations