| Autor: |
Delporte-Gallet, Carole, Fauconnier, Hugues, Guerraoui, Rachid, Tielmann, Andreas |
| Zdroj: |
Distributed Computing (9783642043543); 2009, p8-21, 14p |
| Abstrakt: |
At the heart of distributed computing lies the fundamental result that the level of agreement that can be obtained in an asynchronous shared memory model where t processes can crash is exactly t + 1. In other words, an adversary that can crash any subset of size at most t can prevent the processes from agreeing on t values. But what about the remaining ( ]> ) adversaries that might crash certain combination of processes and not others? This paper presents a precise way to characterize such adversaries by introducing the notion of disagreement power: the biggest integer k for which the adversary can prevent processes from agreeing on k values. We show how to compute the disagreement power of an adversary and how this notion enables to derive nequivalence classes of adversaries. [ABSTRACT FROM AUTHOR] |
| Databáze: |
Complementary Index |
| Externí odkaz: |
|
