Fault-Tolerance

• The FLP Impossibility Result: Why Distributed Consensus Is Fundamentally Hard · 2025-01-15

  Explore the landmark Fischer-Lynch-Paterson result that proved no deterministic algorithm can achieve consensus in an asynchronous system with even one faulty process — and how the field evolved around this impossibility.

• Renewal Theory for Computer Science: The Renewal Equation, Key Renewal Theorem, and Applications in Cache Analysis and Failure Recovery · 2022-02-12

  A rigorous journey through renewal theory—the mathematics of recurring events—from the renewal equation and key renewal theorem to applications in garbage collection, cache replacement, and fault-tolerant system analysis.