The Disagreement Power of an Adversary

Abstract : 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 rest ($2^{2^n} -n$) adversaries that might crash certain combination of processes and not others? Given any adversary, what is its disagreement power? i.e., the biggest $k$ for which it can prevent processes from agreeing on $k$ values. This paper answers this question. We present a general characterization of adversaries that enables to directly derive their disagreement power. We use our characterization to also close the question of the weakest failure detector for $k$-set agreement. So far, the result has been obtained for two extreme cases: consensus and $n-1$-set agreement. We answer this question for any $k$ and any adversary.
Document type :
Preprints, Working Papers, ...
Liste complète des métadonnées

Cited literature [18 references]  Display  Hide  Download
Contributor : Andreas Tielmann <>
Submitted on : Monday, April 20, 2009 - 4:17:18 PM
Last modification on : Friday, January 4, 2019 - 5:32:57 PM
Document(s) archivé(s) le : Friday, October 12, 2012 - 4:55:57 PM


Files produced by the author(s)


  • HAL Id : hal-00376981, version 1



Carole Delporte-Gallet, Hugues Fauconnier, Rachid Guerraoui, Andreas Tielmann. The Disagreement Power of an Adversary. 2009. ⟨hal-00376981⟩



Record views


Files downloads