Fast deterministic consensus in a noisy environment.

It is well known that the consensus problem cannot be solved deterministically in an asynchronous environment, but that randomized solutions are possible. We propose a new model, called noisy scheduling, in which an adversarial schedule is perturbed randomly, and show that in this model randomness i...

Popoln opis

Bibliografske podrobnosti
izdano v:Journal of algorithms. 45, 1 (2002).
Glavni avtor: Aspnes, James
Format: Article
Jezik:English
Teme: