✳flâneur — a map of the web's best reading

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

Explore this link on the map →

saved by

related reading