Optimal Resilience in Systems That Mix Shared Memory and Message Passing

Abstract

Translate Article

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 mm Michel Raynal and Jiannong Cao, 2019].