Optimal Resilience in Systems That Mix Shared Memory and Message Passing

Hagit Attiya, Sweta Kumari, Noa Schiller

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

Abstract

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 [5] and for the hybrid, cluster-based model of [28, 31].

Original languageEnglish
Title of host publication24th International Conference on Principles of Distributed Systems, OPODIS 2020
EditorsQuentin Bramas, Rotem Oshman, Paolo Romano
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
ISBN (Electronic)9783959771764
DOIs
StatePublished - Jan 2021
Externally publishedYes
Event24th International Conference on Principles of Distributed Systems, OPODIS 2020 - Virtual, Online, France
Duration: 14 Dec 202016 Dec 2020

Publication series

NameLeibniz International Proceedings in Informatics, LIPIcs
Volume184
ISSN (Print)1868-8969

Conference

Conference24th International Conference on Principles of Distributed Systems, OPODIS 2020
Country/TerritoryFrance
CityVirtual, Online
Period14/12/2016/12/20

Keywords

  • Approximate agreement
  • Atomic snapshots
  • Cluster-based model
  • Fault resilience
  • M and m model
  • Randomized consensus
  • Register implementations
  • Renaming

Fingerprint

Dive into the research topics of 'Optimal Resilience in Systems That Mix Shared Memory and Message Passing'. Together they form a unique fingerprint.

Cite this