Crash failures vs. crash + link failures

Anindya Basu; Bernadette Charron-Bost; Sam Toueg

doi:10.1145/248052.248102

Crash failures vs. crash + link failures

Anindya Basu
, Bernadette Charron-Bost
, Sam Toueg

Cornell University

Résultats de recherche: Contribution à une conférence › Papier › Revue par des pairs

Résumé

The problem of tolerating crash/or link failures has been extensively studied. These studies focused on a single link, and how to mask failures of that link. In contrast, this paper studies lossy links in the context of an entire system: it is shown that the effect of lossy links depends on the proportion of faulty processes in the system. The results assume permanent process crashes, and more importantly, the effect of adding link failures on the solvability of problems in general is studied. This approach stresses the importance of the notion of correct-restricted problems.

langue originale	Anglais
Pages	246
Nombre de pages	1
Les DOIs	https://doi.org/10.1145/248052.248102
état	Publié - 1 mai 1996
Modification externe	Oui
Evénement	15th Annual ACM Symposium on Principles of Distributed Computing, PODC 1996 - Philadelphia, PA, USA Durée: 23 mai 1996 → 26 mai 1996

Une conférence

Une conférence	15th Annual ACM Symposium on Principles of Distributed Computing, PODC 1996
La ville	Philadelphia, PA, USA
période	23/05/96 → 26/05/96

Accès au document

10.1145/248052.248102

Contient cette citation

@conference{176bc2d9cb0245f39fa5882e572f78d7,

title = "Crash failures vs. crash + link failures",

abstract = "The problem of tolerating crash/or link failures has been extensively studied. These studies focused on a single link, and how to mask failures of that link. In contrast, this paper studies lossy links in the context of an entire system: it is shown that the effect of lossy links depends on the proportion of faulty processes in the system. The results assume permanent process crashes, and more importantly, the effect of adding link failures on the solvability of problems in general is studied. This approach stresses the importance of the notion of correct-restricted problems.",

author = "Anindya Basu and Bernadette Charron-Bost and Sam Toueg",

year = "1996",

month = may,

day = "1",

doi = "10.1145/248052.248102",

language = "English",

pages = "246",

note = "15th Annual ACM Symposium on Principles of Distributed Computing, PODC 1996 ; Conference date: 23-05-1996 Through 26-05-1996",

}

TY - CONF

T1 - Crash failures vs. crash + link failures

AU - Basu, Anindya

AU - Charron-Bost, Bernadette

AU - Toueg, Sam

PY - 1996/5/1

Y1 - 1996/5/1

N2 - The problem of tolerating crash/or link failures has been extensively studied. These studies focused on a single link, and how to mask failures of that link. In contrast, this paper studies lossy links in the context of an entire system: it is shown that the effect of lossy links depends on the proportion of faulty processes in the system. The results assume permanent process crashes, and more importantly, the effect of adding link failures on the solvability of problems in general is studied. This approach stresses the importance of the notion of correct-restricted problems.

AB - The problem of tolerating crash/or link failures has been extensively studied. These studies focused on a single link, and how to mask failures of that link. In contrast, this paper studies lossy links in the context of an entire system: it is shown that the effect of lossy links depends on the proportion of faulty processes in the system. The results assume permanent process crashes, and more importantly, the effect of adding link failures on the solvability of problems in general is studied. This approach stresses the importance of the notion of correct-restricted problems.

U2 - 10.1145/248052.248102

DO - 10.1145/248052.248102

M3 - Paper

AN - SCOPUS:0029700752

SP - 246

T2 - 15th Annual ACM Symposium on Principles of Distributed Computing, PODC 1996

Y2 - 23 May 1996 through 26 May 1996

ER -

Crash failures vs. crash + link failures

Résumé

Une conférence

Accès au document

Empreinte digitale

Contient cette citation