2026-07-23T06:18:10Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:11814 2024-03-06T10:48:50Z ddc:004 open_access

Optimal Register Construction in M&M Systems Hadzilacos, Vassos Hu, Xing Toueg, Sam asynchronous distributed system shared memory message passing Motivated by recent distributed systems technology, Aguilera et al. introduced a hybrid model of distributed computing, called message-and-memory model or m&m model for short [Marcos K. Aguilera et al., 2018]. In this model, processes can communicate by message passing and also by accessing some shared memory. We consider the basic problem of implementing an atomic single-writer multi-reader (SWMR) register shared by all the processes in m&m systems. Specifically, we give an algorithm that implements such a register in m&m systems and show that it is optimal in the number of process crashes that it can tolerate. This generalizes the well-known implementation of an atomic SWMR register in a pure message-passing system [Attiya et al., 1995]. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Vassos Hadzilacos and Xing Hu and Sam Toueg 2020 Is Part Of LIPIcs, Volume 153, 23rd International Conference on Principles of Distributed Systems (OPODIS 2019) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.OPODIS.2019.28 urn:nbn:de:0030-drops-118148 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2019.28 eng https://creativecommons.org/licenses/by/3.0/legalcode