TY - GEN
T1 - Benign failure models for shared memory
AU - Afek, Yehuda
AU - Merritt, Michael
AU - Taubenfeld, Gadi
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1993.
PY - 1993
Y1 - 1993
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84976742584&partnerID=8YFLogxK
U2 - 10.1007/3-540-57271-6_28
DO - 10.1007/3-540-57271-6_28
M3 - ???researchoutput.researchoutputtypes.contributiontobookanthology.conference???
AN - SCOPUS:84976742584
SN - 9783540572718
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 69
EP - 83
BT - Distributed Algorithms - 7th International Workshop, WDAG 1993, Proceedings
A2 - Schipe, Andre
PB - Springer Verlag
T2 - 7th International Workshop on Distributed Algorithms, WDAG 1993
Y2 - 27 September 1993 through 29 September 1993
ER -