Published:
[Erscheinungsort nicht ermittelbar]: Opodis, 2020
Published in:OPODIS: International Conference on Principles of Distributed Systems, 2020 ; (Jan. 2020)
Extent:
1 Online-Ressource (97 MB, 00:16:02:27)
Language:
English
DOI:
10.5446/52877
Identifier:
Origination:
Footnote:
Audiovisuelles Material
Description:
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 solve common tasks, like randomized consensus, approximate agreement and renaming. This has implications for the m&m-model of Aguilera et al., and for the hybrid, cluster-based model of Imbs and Raynal