Skip to Main content Skip to Navigation
Conference papers

Progress-Space Tradeoffs in Single-Writer Memory Implementations

Abstract : Many algorithms designed for shared-memory distributed systems assume the single-writer multi-reader (SWMR) setting where each process is provided with a unique register that can only be written by the process and read by all. In a system where computation is performed by a bounded number n of processes coming from a large (possibly unbounded) set of potential participants, the assumption of an SWMR memory is no longer reasonable. If only a bounded number of multi-writer multi-reader (MWMR) registers are provided, we cannot rely on an a priori assignment of processes to registers. In this setting, implementing an SWMR memory, or equivalently, ensuring stable writes (i.e., every written value persists in the memory), is desirable. In this paper, we propose an SWMR implementation that adapts the number of MWMR registers used to the desired progress condition. For any given k from 1 to n, we present an algorithm that uses n + k − 1 registers to implement a k-lock-free SWMR memory. In the special case of 2-lock-freedom, we also give a matching lower bound of n + 1 registers, which supports our conjecture that the algorithm is space-optimal. Our lower bound holds for the strictly weaker progress condition of 2-obstruction-freedom, which suggests that the space complexity for k-obstruction-free and k-lock-free SWMR implementations might coincide.
Complete list of metadata

Cited literature [17 references]  Display  Hide  Download
Contributor : Damien Imbs Connect in order to contact the contributor
Submitted on : Monday, May 7, 2018 - 6:39:59 PM
Last modification on : Thursday, July 14, 2022 - 4:07:01 AM
Long-term archiving on: : Tuesday, September 25, 2018 - 9:53:21 AM


Publisher files allowed on an open archive


Distributed under a Creative Commons Attribution 4.0 International License



Damien Imbs, Petr Kuznetsov, Thibault Rieutord. Progress-Space Tradeoffs in Single-Writer Memory Implementations. 21st International Conference on Principles of Distributed Systems (OPODIS 2017), Dec 2017, Lisbon, Portugal. ⟨10.4230/LIPIcs.OPODIS.2017.9⟩. ⟨hal-01787848⟩



Record views


Files downloads