Optimal Resilience in Systems that Mix Shared Memory and Message Passing
share
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 and for the hybrid, cluster-based model.
READ FULL TEXT