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
- Time, Clocks, and the Ordering of Events in a Distributed Systemlamport.azurewebsites.net
- A Distributed Systems Reading Listferd.ca
- A Brief Tour of FLP Impossibility | Paper Trailthe-paper-trail.org
- Chain Replication for Supporting High Throughput and Availabilitycs.cornell.edu
- Notes on Distributed Systems for Young Bloods – Something Similarsomethingsimilar.com
- endtoend.pdfweb.mit.edu
- Introduction to Real-time Systemsdesign.ros2.org
- pasa.pdfmipmip.org
- Understanding and expressing scalable concurrencyaturon.github.io
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- Chain Replication for Supporting High Throughput and Availabilitypdos.csail.mit.edu
- How to do distributed locking - Martin Kleppmann's blogmartin.kleppmann.com