论文标题
混合共享内存和消息传递的系统中的最佳弹性
Optimal Resilience in Systems that Mix Shared Memory and Message Passing
论文作者
论文摘要
我们研究了可以通过共享内存和消息传递进行处理的系统进行分区的最小故障数量。我们证明，这个数字精确地捕获了实现各种共享对象（例如寄存器和原子快照）的算法可以实现的弹性，并解决了共同的任务，例如随机共识，近似协议和重命名。这对M＆M模型和基于聚类的模型具有影响。
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.
