Weak read/write registers

Gadi Taubenfeld

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review


In [2], Lamport has defined three classes of shared registers which support read and write operations, called - safe, regular and atomic - depending on their properties when several reads and/or writes are executed concurrently. We consider generalizations of Lamport's notions, called k-safe, k-regular and k-atomic. First, we provide constructions for implementing 1-atomic registers (the strongest type) in terms of k-safe registers (the weakest type). Then, we demonstrate how the constructions enable to easily and efficiently solve classical synchronization problems, such as mutual exclusion and ℓ-exclusion, using single-writer multi-reader k-safe bits, for any k ≥ 1. We also explain how, by using k-registers, it is possible to provide some level of resiliency against memory reordering.

Original languageEnglish
Title of host publicationDistributed Computing and Networking - 14th International Conference, ICDCN 2013, Proceedings
Number of pages5
StatePublished - 2013
Externally publishedYes
Event14th International Conference on Distributed Computing and Networking, ICDCN 2013 - Mumbai, India
Duration: 3 Jan 20136 Jan 2013

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7730 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349


Conference14th International Conference on Distributed Computing and Networking, ICDCN 2013


  • Memory barriers
  • Memory ordering
  • Mutual exclusion
  • Shared memory
  • Synchronization
  • k-regular and k-atomic registers
  • k-safe
  • ℓ-exclusion


Dive into the research topics of 'Weak read/write registers'. Together they form a unique fingerprint.

Cite this