Henry Robinson (https://twitter.com/HenryR) from Cloudera (http://www.cloudera.com/content/cloudera/en/home.html) will present the paper "Impossibility of Distributed Consensus with One Faulty Process (http://macs.citadel.edu/rudolphg/csci604/ImpossibilityofConsensus.pdf)" by Fischer, Lynch and Patterson. This paper won the Dijkstra award given to the most influential papers in distributed computing so make sure you don't miss this!
Note that Henry will be focusing on the JACM version of the paper, not the PODS version. The JACM version is linked in the paper title above and you can also find it here (http://macs.citadel.edu/rudolphg/csci604/ImpossibilityofConsensus.pdf).
If anyone really wants extra reading, you might consider the following:
• FLP proof walkthrough from Henry's blog ( http://the-paper-trail.org/blog/a-brief-tour-of-flp-impossibility/ )
• Lynch's '100 impossibility results for distributed computing' ( http://groups.csail.mit.edu/tds/papers/Lynch/MIT-LCS-TM-394.pdf )
• Chandra and Toueg's 'The weakest failure detector for solving consensus' ( http://www.cs.utexas.edu/~lorenzo/corsi/cs380d/papers/p685-chandra.pdf )
Henry is an engineer at Cloudera, where he has worked for five years on a wide variety of distributed systems. He currently works full-time on Impala, a SQL query engine for data stored in HDFS. Before Cloudera, he worked on ad-hoc networking at Cambridge University. He writes infrequently about databases and distributed systems at http://the-paper-trail.org/
Doors open at 6:30 pm; the presentation will begin at 7:00 pm; and, yes, there will be beer and pizza.
After Henry presents the paper, we will open up the floor to discussion and questions.
We hope that you'll read the papers before the Meetup (and if you don't, no worries). If you have any questions, thoughts, or related information, please visit our *github-thread* on the matter: https://github.com/papers-we-love/papers-we-love/issues/130