Home

About

Advanced Search

Browse by Discipline

Scientific Societies

E-print Alerts

Add E-prints

E-print Network
FAQHELPSITE MAPCONTACT US


  Advanced Search  

 
The Impossibility of Boosting Distributed Service Resilience # Paul Attie 1,3 Rachid Guerraoui 2 Petr Kouznetsov 2 Nancy Lynch 3 Sergio Rajsbaum 4
 

Summary: The Impossibility of Boosting Distributed Service Resilience #
Paul Attie 1,3 Rachid Guerraoui 2 Petr Kouznetsov 2 Nancy Lynch 3 Sergio Rajsbaum 4
(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­
ble to boost the resilience of systems solving problems eas­
ier than consensus: the k­set consensus problem is solvable
for 2k -1 failures using 1­resilient consensus services. The
first theorem and its proof generalize to the larger class of

  

Source: Attie, Paul - Department of Computer Science, American University of Beirut

 

Collections: Computer Technologies and Information Sciences