| | |
Summary: The Impossibility of Boosting Distributed Service Resilience
Paul Attie1,3
Rachid Guerraoui2
Petr Kouznetsov2
Nancy Lynch3
Sergio Rajsbaum4
(1) College of Computer and Information Science, Northeastern University
(2) Distributed Programming Laboratory, EPFL
(3) MIT Computer Science and Artificial Intelligence Laboratory
(4) Instituto de Matem´aticas, Universidad Nacional Aut´onoma de M´exico (UNAM)
Abstract
We prove two theorems saying that no distributed system
in which processes coordinate using reliable registers and
f-resilient services can solve the consensus problem in the
presence of f +1 undetectable process stopping failures. (A
service is f-resilient if it is guaranteed to operate as long
as no more than f of the processes connected to it fail.)
Our first theorem assumes that the given services are
atomic objects, and allows any connection pattern between
processes and services. In contrast, we show that it is possi-
|
