Loading...
Please wait, while we are loading the content...
Similar Documents
Indulgent algorithms (preliminary version
| Content Provider | CiteSeerX |
|---|---|
| Author | Guerraoui, Rachid |
| Description | Informally, an indulgent algorithm is a distributed algorithm that tolerates unreliable failure detection: the algorithm is indulgent owards its failure detector. This paper formally characterises such algorithms and states some of their in-teresting features. We show that indulgent algorithms are inherently safe and uniform. We also state impossibility results for indulgent solutions to divergent problems like consensus, and failure-sensitive problems like non-blocking atomic commit and terminat ing reliable broadcast. 1 Introduct ion Indulgent algorithms. The notion of partial failures is a fun-damental characteristic of a distr ibuted system: some of the processes might fail whereas others might keep executing their algorithm. A usual metric to evaluate the reliability |
| File Format | |
| Language | English |
| Publisher Institution | In PODC 2000, ACM |
| Access Restriction | Open |
| Subject Keyword | Introduct Ion Indulgent Algorithm Preliminary Version Distributed Algorithm Indulgent Algorithm Indulgent Solution Partial Failure Whereas Others Failure-sensitive Problem Fun-damental Characteristic Reliable Broadcast State Impossibility Result Non-blocking Atomic Commit In-teresting Feature Distr Ibuted System Failure Detector Indulgent Owards Unreliable Failure Detection |
| Content Type | Text |
| Resource Type | Article |
