{
  "slug": "fail-stop",
  "term": "Fail-stop processor",
  "aliases": [
    "fail-stop failure model"
  ],
  "definition": "A fail-stop processor combines halting before faulty state becomes visible, detectable failure and stable storage accessible to other processors.",
  "note": "Schneider's 1984 formulation combines three properties: halt before an erroneous state change becomes visible, allow another processor to detect failure, and preserve readable stable storage. A machine that merely stops responding does not establish all three. [s84]\n\nThe 1983 treatment separates volatile state from stable state and permits recovery on another processor or on the repaired original processor. Fail-stop therefore should not be silently equated with crash-stop's no-recovery process model. Recovery code must still handle intermediate states left by interrupted work; halting does not make a multi-step update atomic. [ss83]\n\nStable storage is a behavioral abstraction, not a synonym for one nonvolatile drive. The papers construct bounded-fault approximations using replicated processors and memory. A k-fail-stop construction guarantees the abstraction only within its stated fault budget; correlated faults and communication assumptions require separate scrutiny. [ss83] [s84]\n\nFor a storage design, state the fault containment, detection, surviving-state access and restart contracts separately. A perfect failure detector specifies detection properties, not the historical stable-storage guarantee. [ct96] [s84]",
  "related": [
    "crash-stop",
    "perfect-failure-detector",
    "fail-stutter"
  ],
  "citations": [
    {
      "id": "ss83",
      "title": "Schlichting and Schneider. Fail-Stop Processors: An Approach to Designing Fault-Tolerant Computing Systems. TOCS 1983, sections 2 and 3.1.",
      "url": "https://www.cs.cornell.edu/fbs/publications/Fail_Stop.pdf",
      "accessed": "2026-11-20"
    },
    {
      "id": "s84",
      "title": "F. B. Schneider. Byzantine Generals in Action: Implementing Fail-Stop Processors. TOCS 2(2), 145-154, 1984; sections 1-2.",
      "url": "https://pages.cs.wisc.edu/~dusseau/Classes/CS739-S06/Papers/ByzGensInAction.pdf",
      "accessed": "2026-11-20"
    },
    {
      "id": "ct96",
      "title": "T. D. Chandra and S. Toueg. Unreliable Failure Detectors for Reliable Distributed Systems. JACM 43(2), 225-267, 1996; sections 1 and 2.1-2.4.",
      "url": "https://www.cs.utexas.edu/~lorenzo/corsi/cs380d/papers/p225-chandra.pdf",
      "accessed": "2026-11-20"
    }
  ],
  "status": "unknown",
  "advantages": [],
  "limitations": [
    {
      "text": "Different uses of fail-stop may assume different detection and storage contracts. A protocol's explicit fault model determines which guarantees apply.",
      "citationIds": [
        "ss83",
        "s84"
      ]
    }
  ],
  "supersedes": [],
  "supersededBy": [],
  "firstSeen": null,
  "lastSeen": null,
  "updated": "2026-11-20",
  "provenance": [
    "Source synthesis, not a claim that commodity hardware implements an ideal fail-stop processor.",
    "The 1983 recovery discussion and 1984 three-property formulation are distinguished explicitly; publication dates are not claimed as invention dates."
  ]
}
