Lecture 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12? | 13? | Index


To add a question because something is unclear or was not understood, just insert the question and add the prefix %q% for each addition (q like question). This is the "question-style". Like this:

* %q% What kind of problems could have decentralized nature?
  • What kind of problems could have decentralized nature?

If you want to answer a question or add a comment please put a %a% in front. This is thea "answer-style" (a lilke answer). An example:

* %a% This is an addition to something that I consider important.
  • This is an addition to something that I consider important.

For citations or references to the slides of Prof. Suri pleas add the lecture and slide number in braces: (<lecture>.<slide>).

Please make sure that you enter an author name, else your changes will not be saved!


Lecture 6 - Paradigms for distributed Fault Tolerance

  • Definition of Dependability?
  • Threads for a dependable system (6.5)
    • Fault
    • Error
    • Failure
  • Error processing (6.7)
    • Error detection
      • Error recovery
        • Backward error recovery
        • Forward error reconvery
      • Error masking (compensation)

  • Failure semantics (1.27, 6.8)
    • How do components fail and what ce be done about it?
    • Create a failure model to extend a components specs to include ways it can "legally" fail.
      • Fail-Stop: fails "cleanly" and detectably
      • Crash: fails "cleanly"
      • Timing: too late or too early
      • Omission: does not reply
      • Value: sends wrong reply
      • Byzantine: can send wront reply, "two-faced" behaviour (see lecture 1)
  • Measuring and validating dependability (6.9)
  • Fault models (6.10)
    • Omissive faults (6.11)
      • Crash
      • Omission
      • Timing
    • Assertive faults (6.12)
      • Syntactic
      • Semantic
    • Arbitrary faults (6.13)
      • Assertive
      • Omissive
      • Assertive + omissive
      • Byzantine faults
    • Coverage (6.15)
  • Fault-tolerance requires redundancy (6.16)
    • Space redundancy
    • Time redundancy
    • Value redundancy
  • Agreement (6.18)
    • Exact agreement
    • Inexact agreement (use convergence function)
      • Convergence functions (6.19)
        • Fault-tolerant midpoint (MME?)
        • Fault-tolerant average
  • Failure detection (6.20)
    • Local failure detection (6.21)
      • Self-check
      • Guardian
      • Watchdog
      • System diagnosis (6.22)
        • Diagnosis ring (6.24)
    • Distributed failure detection (6.25)
      • Perfect failure detector (2.26)
        • Strong accuracy
        • Strong completeness
      • Imperfect failure detection (2.27)
        • Weak accuracy
        • Weak completeness
      • Asynchronous failure detection (eventually weak failure detection) (2.29)
        • Eventually weak accuracy
        • Weak completeness
  • Fault-tolerant consensus (6.30)
    • Locking a value (6.33)
    • Uniform consensus (6.36)
    • Non-uniform consensus (weaker) (6.36)
  • Membership (6.39)
    • Consists of:
      • Process group
      • Membership
      • Membership service
    • Consistend membership (6.40)
      • Linear membership service (6.42)
      • Partial membership (6.43)
        • Strong partial membership
  • Fault-tolerant communication (6.44)
    • Reliable delivery (6.45)
      • Error masking (spatial)
      • Error masking (temporal)
      • Error recovery
        • Positive ACK
        • Negative ACK
    • Multicast fault-tolerance (6.47)
      • Unreliable
      • Best-effort
      • Reliable
  • Tolerating fautls
    • Tolerating value faults (6.49)
    • Tolerating arbitrary (byzantine) faults (6.50)
  • Implementing fault tolerant order
    • Implementing causal order (6.54)
    • Implementing total order (6.55)

Nach oben

Lecture 1 | 2 | 3 | 4 | 5 | 6 | 7 | 8 | 9 | 10 | 11 | 12? | 13? | Index


Recent Changes


Nach oben

Zuletzt geändert am 05 März 2005 23:15 Uhr von chrschn