A Brief Tour of FLP Impossibility | Paper Trail
the-paper-trail.org · 4,034 words · saved by 1 readers
Writing about distributed systems, compilers, virtual machines, databases and research papers from SOSP, ATC, NSDI, OSDI, EuroSys and others
One of the most important results in distributed systems theory was published in April 1985 by Fischer, Lynch and Patterson. Their short paper 'Impossibility of Distributed Consensus with One Faulty Process' , which eventually won the Dijkstra award given to the most influential papers in distributed computing, definitively placed an upper bound on what it is possible to achieve with distributed processes in an asynchronous environment. This particular result, known as the 'FLP result', settled a dispute that had been ongoing in distributed systems for the previous five to ten years. The probl
saved by
related reading
- Mediumlevelup.gitconnected.com
- Let’s take a crack at understanding distributed consensuspreethikasireddy.com
- A Distributed Systems Reading Listferd.ca
- Time, Clocks, and the Ordering of Events in a Distributed Systemlamport.azurewebsites.net
- ProofsArgsAndZK.pdfpeople.cs.georgetown.edu
- FLT: Anthropic has beaten me to itxenaproject.wordpress.com
- Distributed systems theory for the distributed systems engineer | Paper Trailthe-paper-trail.org
- Verifable Delay Functions (paper)eprint.iacr.org
- 370.pdfeprint.iacr.org
- Definability of Truth in Probabilistic Logic - Christiano 2013intelligence.org
- Determining the Last Process to Failcs.utexas.edu
- Chain Replication for Supporting High Throughput and Availabilitycs.cornell.edu