Benign failure models for shared memory

Yehuda Afek, Michael Merritt, Gadi Taubenfeld

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

Abstract

This paper introduces two benign failure models for shared memory in distributed systems, crash-omission and crash-eventual. These models are of intermediate power between the crash model and omission models of [JCT92]. (They exhibit more faulty behaviors than crash and fewer than omission.) Unlike the crash model, crash-omission is shown to have universal, gracefully-degrading constructions. That is, for any integer k, any shared object may be constructed from shared registers and consensus objects, so that: (1) if no more than k of the components suffer crash-omission failures, the constructed object exhibits no failures, and (2) if more than k of the components suffer crash-omission failures, the constructed object exhibits crash-omission failures. Simple constructions also demonstrate that registers and consensus objects in the (apparently) less benign crash-eventual model can be used to construct corresponding objects in the crash-omission model. These results are cited as evidence that the crash-omission failure model may be an appropriate choice to consider in the formulation of a more extensive theory of fault-tolerant shared objects.

Original languageEnglish
Title of host publicationDistributed Algorithms - 7th International Workshop, WDAG 1993, Proceedings
EditorsAndre Schipe
PublisherSpringer Verlag
Pages69-83
Number of pages15
ISBN (Print)9783540572718
DOIs
StatePublished - 1993
Externally publishedYes
Event7th International Workshop on Distributed Algorithms, WDAG 1993 - Lausanne, Switzerland
Duration: 27 Sep 199329 Sep 1993

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume725 LNCS
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference7th International Workshop on Distributed Algorithms, WDAG 1993
Country/TerritorySwitzerland
CityLausanne
Period27/09/9329/09/93

Fingerprint

Dive into the research topics of 'Benign failure models for shared memory'. Together they form a unique fingerprint.

Cite this