Skip to main content
Engineering LibreTexts

4: Consistency

  • Page ID
    58514
  • \( \newcommand{\vecs}[1]{\overset { \scriptstyle \rightharpoonup} {\mathbf{#1}} } \) \( \newcommand{\vecd}[1]{\overset{-\!-\!\rightharpoonup}{\vphantom{a}\smash {#1}}} \)\(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\) \(\newcommand{\id}{\mathrm{id}}\) \( \newcommand{\Span}{\mathrm{span}}\) \( \newcommand{\kernel}{\mathrm{null}\,}\) \( \newcommand{\range}{\mathrm{range}\,}\) \( \newcommand{\RealPart}{\mathrm{Re}}\) \( \newcommand{\ImaginaryPart}{\mathrm{Im}}\) \( \newcommand{\Argument}{\mathrm{Arg}}\) \( \newcommand{\norm}[1]{\| #1 \|}\) \( \newcommand{\inner}[2]{\langle #1, #2 \rangle}\) \( \newcommand{\Span}{\mathrm{span}}\)\(\newcommand{\AA}{\unicode[.8,0]{x212B}}\)

    • 4.1: Overview
    • 4.2: Constraints and Interface Consistency
      Definition of constraints; overview of the models of consistency for maintaining constraints discussed in this chapter: strict vs eventual consistency.
    • 4.3: Cache Coherence
      Methods of maintaining either strict or eventual consistency for one or multiple caches, in the form of read/write coherence: write-through caches, timer expiration, marking variables with a "fluorescent pen," the snoopy cache.
    • 4.4: Durable Storage Revisited - Geographically Separated Replicas
      Considerations for enhancing durable storage by geographically separating replicas. Includes discussion of replicated and single state machines, maintaining data integrity with witnesses, and majorities/quorums in reading replicas.
    • 4.5: Reconciliation
      The process of reconciliation, or repairing differences between replicas intended to be identical. Includes discussion of occasionally connected operation, writing a simple reconciliation algorithm, and possible improvements to this algorithm.
    • 4.6: Perspectives
      Brief discussion of the historical context of systematic applying atomicity to recovery and coordination. The tradeoffs between concurrency and complexity of a coordination scheme. Areas for further study in this field, such as compensation and achieving consensus in the face of hostile behavior.
    • 4.7: Exercises


    This page titled 4: Consistency is shared under a CC BY-NC-SA license and was authored, remixed, and/or curated by Jerome H. Saltzer & M. Frans Kaashoek (MIT OpenCourseWare) .

    • Was this article helpful?