The topological structure of asynchronous computability

Herlihy, Maurice; Shavit, Nir

doi:10.1145/331524.331529

Cited by 411 publications

(608 citation statements)

References 9 publications

Supporting

Mentioning

602

Contrasting

Unclassified

Order By: Relevance

“…Then, with Theorem 2, k-set agreement for k + 1 processes can be implemented in B n k and with Theorem 6 it follows that k-set agreement can be implemented in B k+1 k . A contradiction to [1][2][3]. Thus, ¬D(A n , B n k ) which means by Theorem 3 that k-set agreement can be implemented in A n .…”

Section: Robustness Against the Number Of Processesmentioning

confidence: 90%

See 1 more Smart Citation

The Disagreement Power of an Adversary

Delporte-Gallet

Fauconnier

Guerraoui

et al. 2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

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 remaining (2 2 n − n) 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 n equivalence classes of adversaries.

show abstract

Section: Robustness Against the Number Of Processesmentioning

confidence: 90%

“…Since a * ∈ A, Alg has to terminate. D(A, B k ), then k-set agreement cannot be implemented in A, since it is impossible in B k [1][2][3]. If D(A, B k ), then k-set agreement cannot be implemented in A.…”

Section: Consider the Adversaries Frommentioning

confidence: 99%

The Disagreement Power of an Adversary

Delporte-Gallet

Fauconnier

Guerraoui

et al. 2009

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…The set-agreement problem [1] has no deterministic solution in asynchronous systems where any number of processes can fail by crashing [2,3,4] and the remaining processes have no information about such failures. With failure detection however, the impossibility can be circumvented [5].…”

Section: Introductionmentioning

confidence: 99%

The Weakest Failure Detector for Message Passing Set-Agreement

Delporte-Gallet

Fauconnier

Guerraoui

et al. 2008

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Abstract. In the set-agreement problem, n processes seek to agree on at most n−1 different values. This paper determines the weakest failure detector to solve this problem in a message-passing system where processes may fail by crashing. This failure detector, called the Loneliness detector and denoted L, outputs one of two values, "true" or "false" such that:(1) there is at least one process where L outputs always "false", and (2) if only one process is correct, L eventually outputs "true" at this process.

show abstract

“…The latter are a common model for interprocess communication through shared memory as discussed briefly in Section I. For details see [23], [25] and for use and motivation in distributed protocols see [8], [9], [19].…”

Section: Preliminariesmentioning

confidence: 99%

Randomized two-process wait-free test-and-set

Tromp

Vitányi

2002

Distributed Computing

View full text Add to dashboard Cite

Abstract-We present the first explicit, and currently simplest, randomized algorithm for two-process wait-free testand-set. It is implemented with two 4-valued single writer single reader atomic variables. A test-and-set takes at most 11 expected elementary steps, while a reset takes exactly 1 elementary step. Based on a finite-state analysis, the proofs of correctness and expected length are compressed into one table.

show abstract

The topological structure of asynchronous computability

Cited by 411 publications

References 9 publications

The Disagreement Power of an Adversary

The Disagreement Power of an Adversary

The Weakest Failure Detector for Message Passing Set-Agreement

Randomized two-process wait-free test-and-set

Contact Info

Product

Resources

About