Failure mode assumptions and assumption coverage

Powell, David

doi:10.1109/ftcs.1992.243562

Cited by 170 publications

(99 citation statements)

References 7 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The lack of error and fault handling coverage has been shown to be a drastic limit to dependability improvement [Bouricius et al 1969, Arnold 1973. Similar effects can result from the lack of failure mode coverage: conservative fault assumptions (e.g., Byzantine faults) will result in a higher failure mode coverage, at the expense of necessitating an increase in the redundancy and more complex fault tolerance mechanisms, which can lead to an overall decrease in system dependability and security [Powell 1992]. …”

Section: Implementation Of Fault Tolerancementioning

confidence: 97%

Basic concepts and taxonomy of dependable and secure computing

Avižienis

Laprie

Randell

et al. 2004

IEEE Trans.Dependable and Secure Comput.

4,108

2,435

View full text Add to dashboard Cite

show abstract

Section: Implementation Of Fault Tolerancementioning

confidence: 97%

Basic concepts and taxonomy of dependable and secure computing

Avižienis

Laprie

Randell

et al. 2004

IEEE Trans.Dependable and Secure Comput.

4,108

2,435

View full text Add to dashboard Cite

show abstract

“…More generally, here, the important fact is that the message pattern assumption and the timely link assumption are combined at the "finest possible" granularity level, namely, the link level, allowing thus the design of protocols with a better assumption coverage [22].…”

Section: Combining Both Approachesmentioning

confidence: 99%

Eventual Leader Service in Unreliable Asynchronous Systems: Why? How?

Raynal

2007

Sixth IEEE International Symposium on Network Computing and Applications (NCA 2007)

View full text Add to dashboard Cite

show abstract

“…More precisely, x-obstruction-freedom can benefit from crashes, as it guarantees that any operation on a concurrent object issued by a non-faulty process always terminates as soon as (n − x) or more processes have crashed. Crashes favor the coverage of the assumption on which x-obstruction-freedom relies to become effective [12].…”

Section: Context Of the Workmentioning

confidence: 99%

The x-Wait-Freedom Progress Condition

Imbs

Raynal

2010

Euro-Par 2010 - Parallel Processing

View full text Add to dashboard Cite

The liveness of concurrent objects despite asynchrony and failures is a fundamental problem. To that end several progress conditions have been proposed. Wait-freedom is the strongest of these conditions: it states that any object operation must terminate if the invoking process does not crash. Obstruction-freedom is a weaker progress condition as it requires progress only when a process executes in isolation for a long enough period.This paper explores progress conditions in n-process asynchronous read/write systems enriched with base objects with consensus number x, 1 < x ≤ n (i.e., objects that wait-free solve consensus in a set of x processes). It is easy to solve consensus in such a system if progress is required only when one of the x processes allowed to access the underlying consensus object invokes this object and does not crash. This paper proposes and investigates a stronger progress condition that we call x-wait-freedom (n-wait-freedom is wait-freedom). While it does not need more assumptions than the previous one in order to ensure progress, that condition identifies additional scenarios in which progress is required despite the fact that none of the x processes allowed to access the underlying consensus object participates. The paper then presents and proves correct a consensus algorithm that satisfies this progress condition.

show abstract

Failure mode assumptions and assumption coverage

Cited by 170 publications

References 7 publications

Basic concepts and taxonomy of dependable and secure computing

Basic concepts and taxonomy of dependable and secure computing

Eventual Leader Service in Unreliable Asynchronous Systems: Why? How?

The x-Wait-Freedom Progress Condition

Contact Info

Product

Resources

About