Anonymity-Preserving Failure Detectors

Bouzid, Zohir; Travers, Corentin

doi:10.1007/978-3-662-53426-7_13

Cited by 5 publications

(3 citation statements)

References 34 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…An execution is well-formed if each process invokes at most one propose operation and no process invokes a propose or resolve operation before its previous operation has terminated. In any well-formed execution, the object satisfies the following four conditions [2,7]:…”

Section: Safe Agreement Objectmentioning

confidence: 99%

“…Our implementation is a generalization of the anonymous consensus algorithm proposed by Attiya et al [3]. Bouzid and Corentin [7] have proposed an anonymous implementation of a safe agreement object for the case of V = {0, 1}, also based on [3]. However, their implementation does not (directly) extend to the case of an infinite value set.…”

Section: Safe Agreement Objectmentioning

confidence: 99%

See 1 more Smart Citation

A Characterization of t-Resilient Colorless Task Anonymous Solvability

Delporte-Gallet

Fauconnier

Rajsbaum³

et al. 2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

One of the central questions in distributed computability is characterizing the tasks that are solvable in a given system model. In the anonymous case, where processes have no identifiers and communicate through multi-writer/multi-reader registers, there is a recent topological characterization (Yanagisawa 2017) of the colorless tasks that are solvable when any number of asynchronous processes may crash. In this paper, we consider the case where at most t asynchronous processes may crash, where 1 ≤ t < n. We prove that a colorless task is t-resilient solvable anonymously if and only if it is t-resilient solvable non-anonymously. We obtain our results through various reductions and simulations that explore how to extend techniques for non-anonymous computation to anonymous one.

show abstract

Section: Safe Agreement Objectmentioning

confidence: 99%

Section: Safe Agreement Objectmentioning

confidence: 99%

A Characterization of t-Resilient Colorless Task Anonymous Solvability

Delporte-Gallet

Fauconnier

Rajsbaum³

et al. 2018

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

“…Our implementation is a generalization of the anonymous consensus algorithm proposed by Attiya et al [3]. Bouzid and Corentin [6] have proposed an anonymous implementation of the safe agreement object for the case of V = {0, 1}, where their implementation is also based on [3]. However, their implementation is not immediately extended to the case of the infinite value set.…”

Section: Safe Agreement Objectmentioning

confidence: 99%

A characterization of colorless anonymous $t$-resilient task computability

Delporte-Gallet¹,

Fauconnier²,

Rajsbaum³

et al. 2017

Preprint

View full text Add to dashboard Cite

A task is a distributed problem for n processes, in which each process starts with a private input value, communicates with other processes, and eventually decides an output value. A task is colorless if each process can adopt the input or output value of another process. Colorless tasks are well studied in the non-anonymous sharedmemory model where each process has a distinct identifier that can be used to access a single-writer/multi-reader shared register. In the anonymous case, where processes have no identifiers and communicate through multiwriter/multi-reader registers, there is a recent topological characterization of the colorless tasks that are solvable when any number of asynchronous processes may crash.In this paper we study the case where at most t processes may crash, where 1 ≤ t < n. We prove that a colorless task is t-resilient solvable non-anonymously if and only if it is t-resilient solvable anonymously. This implies a complete characterization of colorless anonymous t-resilient asynchronous task computability.

show abstract

Anonymity-Preserving Failure Detectors

Bouzid

Travers

2016

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

The paper investigates the consensus problem in anonymous, failures prone and asynchronous shared memory systems. It introduces a new class of failure detectors, called anonymitypreserving failures detectors suited to anonymous systems. As its name indicates, a failure detector in this class cannot be relied upon to break anonymity. For example, the anonymous perfect detector AP , which gives at each process an estimation of the number of processes that have failed belongs to this class. The paper then determines the weakest failure detector among this class for consensus. This failure detector, called C, may be seen as a loose failures counter: (1) after a failure occurs, the counter is eventually incremented, and (2) when at least two processes do not fail, it eventually stabilizes. Finally, the paper also introduces failure detector C k , a simple generalization of C and shows that it can be used to solve k-set-agreement, a generalization of consensus in which up to k distinct values may be decided.

show abstract

Anonymity-Preserving Failure Detectors

Cited by 5 publications

References 34 publications

A Characterization of t-Resilient Colorless Task Anonymous Solvability

A Characterization of t-Resilient Colorless Task Anonymous Solvability

A characterization of colorless anonymous $t$-resilient task computability

Anonymity-Preserving Failure Detectors

Contact Info

Product

Resources

About