Determining the Last Process to Fail
cs.utexas.edu · 7,716 words · saved by 1 readers
N/A
Determining the Last Process to Fail DALE SKEEN Cornell University A total failure occurs whenever all processes cooperatively executing a distributed task fail before the task completes. A frequent prerequisite for recovery from a total failure is identification of the last set (LAST) of processes to fail. Necessary and sufficient conditions are derived here for computing LAST from the local failure data of recovered processes. These conditions are then translated into procedures for deciding LAST membership, using either complete or incomplete failure data. The choice of failure data is…
related reading
- A Distributed Systems Reading Listferd.ca
- Notes on Distributed Systems for Young Bloods – Something Similarsomethingsimilar.com
- Time, Clocks, and the Ordering of Events in a Distributed Systemlamport.azurewebsites.net
- A Brief Tour of FLP Impossibility | Paper Trailthe-paper-trail.org
- Distributed systems for fun and profitbook.mixu.net
- Distributed systems theory for the distributed systems engineer | Paper Trailthe-paper-trail.org
- Byzantine fault - Wikipediaen.wikipedia.org
- 2410.21680arxiv.org
- GitHub - aphyr/distsys-class: Class materials for a distributed systems lecture seriesgithub.com
- Distributed Systems Safety Researchjepsen.io
- Three-phase commit protocolen.wikipedia.org
- A Byzantine failure in the real world | The Cloudflare Blogblog.cloudflare.com