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

Wojciech Golab, Vassos Hadzilacos, Danny Hendler, Philipp Woelfel

Research output: Contribution to journalArticlepeer-review

16 Scopus citations


We consider asynchronous multiprocessors where processes communicate only by reading or writing shared memory. We show how to implement consensus, com-pare-and-swap and other comparison primitives, as well as load-linked/store-conditional (LL/SC) using only a constant number of remote memory references (RMRs), in both the cache-coherent and the distributed-shared-memory models of such multiprocessors. Our implementations are blocking, rather than wait-free: they ensure progress provided all processes that invoke the implemented primitive are live. Our results imply that any algorithm using read and write operations, and either comparison primitives or LL/SC, can be simulated by an algorithm that uses read and write operations only, with at most a constant-factor increase in RMR complexity.

Original languageEnglish
Pages (from-to)109-162
Number of pages54
JournalDistributed Computing
Issue number2
StatePublished - 1 May 2012


  • Comparison primitives
  • Consensus
  • Load-linked/store-conditional
  • Mutual exclusion
  • Remote memory references
  • Shared memory

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Hardware and Architecture
  • Computer Networks and Communications
  • Computational Theory and Mathematics


Dive into the research topics of 'RMR-efficient implementations of comparison primitives using read and write operations'. Together they form a unique fingerprint.

Cite this