2026-07-23T06:22:47Z https://drops.dagstuhl.de/oai

oai:drops-oai.dagstuhl.de:13501 2024-03-06T10:52:12Z ddc:004 open_access

Optimal Resilience in Systems That Mix Shared Memory and Message Passing Attiya, Hagit Kumari, Sweta Schiller, Noa fault resilience m&m model cluster-based model randomized consensus approximate agreement renaming register implementations atomic snapshots We investigate the minimal number of failures that can partition a system where processes communicate both through shared memory and by message passing. We prove that this number precisely captures the resilience that can be achieved by algorithms that implement a variety of shared objects, like registers and atomic snapshots, and solve common tasks, like randomized consensus, approximate agreement and renaming. This has implications for the m&m-model of [Aguilera et al., 2018] and for the hybrid, cluster-based model of [Damien Imbs and Michel Raynal, 2013; Michel Raynal and Jiannong Cao, 2019]. Schloss Dagstuhl – Leibniz-Zentrum für Informatik Hagit Attiya and Sweta Kumari and Noa Schiller 2021 Is Part Of LIPIcs, Volume 184, 24th International Conference on Principles of Distributed Systems (OPODIS 2020) InProceedings Text doc-type:ResearchArticle publishedVersion application/pdf doi:10.4230/LIPIcs.OPODIS.2020.16 urn:nbn:de:0030-drops-135019 https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.OPODIS.2020.16 eng https://creativecommons.org/licenses/by/3.0/legalcode