Failure Detectors and Consensus Algorithms
Delve into the intricacies of failure detection, the challenges with unreliable detectors, and the impossibility of achieving consensus in asynchronous systems. Explore key concepts like RFDs, FLP impossibility result, and the role of failure detectors in solving consensus. Optional reading on different categories of detectors and their sufficiency for achieving consensus.
Download Presentation
Please find below an Image/Link to download the presentation.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author. If you encounter any issues during the download, it is possible that the publisher has removed the file from their server.
You are allowed to download the files provided on this website for personal or commercial use, subject to the condition that they are used lawfully. All files are the property of their respective owners.
The content on the website is provided AS IS for your information and personal use only. It may not be sold, licensed, or shared on other websites without obtaining consent from the author.
E N D
Presentation Transcript
Failure detection CSE 552 preparation for reading
Timeouts B seems to have failed A B
Failure detectors B seems to have failed Oops, B is actually OK A B Falcon paper concerns RFDs An unreliable failure detector may say a component has failed if it hasn t A reliable failure detector never says a component has failed if it hasn t
FLP impossibility result But, wait, what about Paxos? Consensus is impossible in an asynchronous system with the possibility of node failure Problem definition includes a strong liveness condition: consensus must terminate Algorithms like Paxos may not terminate. They re only live under certain conditions.
Unreliable failure detectors paper (optional) Key ideas Different categories of failure detectors Sufficiency of very weak failure detector for solving consensus (weak completeness and eventual weak accuracy) Consensus and atomic broadcast equivalence Appendix can be skipped
