The Amsterdam chapter of Papers We Love
What was the last paper within the realm of computing you read and loved? What did it inspire you to build or tinker with? Come share the ideas in an awesome academic/research paper with fellow engineers, programmers, and paper-readers. Lead a session and show off code that you wrote that implements these ideas or just give us the lowdown about the paper. Otherwise, just come, listen, and discuss in a low ego, friendly environment.
Papers We Love has a Code of Conduct. Please contact one of the Meetup's organizers if anyone is not following it. Be good to each other and to the PWL community!
Sign-up: Please RSVP for meetings via Meetup.com
Organizers: Michel Rijnders
Marco Rietveld presents "Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster Computing"
About the Paper
In the early 2010s, a team at UC Berkley (Zaharia et al.) developed Apache Spark to analyze large data sets because 2 challenges were not being met by Apache Hadoop and map-reduce. It was (1) hard to do complex multi-stage or iterative analysis of the data and (2) hard to do interactive ad-hoc queries on the data. While the team at UC Berkeley was working on this problem, they hit upon RDDs and Apache Spark was born!
This paper presents the Resilient Distributed Dataset [RDD] abstraction, the primary data abstraction in Apache Spark. RDDs allow Spark to perform much faster than Hadoop and introduce a model that allows programmers and data analyst…
Michel Rijnders presents "Propositions as Types"; details to follow.
Marco Slot present "Spanner: Becoming a SQL System"; you can find the paper here: http://dl.acm.org/citation.cfm?id=3056103&CFID=942648241&CFTOKEN=89780086
Details to follow.…
Jeff Wolski presents "Design patterns for container-based distributed systems", details to follow.…
Daan van Berkel presents "Classic Nintendo Games are (Computationally) Hard". Details to follow.…
Marco Rietveld presents Michael & Scott's paper on their CAS/non-blocking queue algorithm: http://www.cs.rochester.edu/~scott/papers/1996_PODC_queues.pdf
About the Paper
Michael and Scott are among the better known names in the area of synchronization and locking in computer science. This paper from 1996 is one of the first papers that explains a non-blocking algorithm. While the algorithms described in the paper have been improved upon since then, the paper is a good starting point for those interested in non-blocking algorithms and also showcases a number of concepts used in concurrency.
About the Speaker
Marco is a Java Software Engineer at JBoss (by Red Hat) where he works on the jBPM and Drools projects. He stays as far as possible away from anything having to do …
Please join us for our third meetup. Gabriele Modena presents "Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster Computing" - Matei Zaharia et al.
The paper is here: https://www.cs.berkeley.edu/~matei/papers/2012/nsdi_spark.pdf
19:00 ... Welcome, grab seats, pizza
19:15 ... Presentation by Gabriele
20:15 ... Final thoughts, announcements & hangout
20:45 ... End
Please note that Uber will ask you to sign a NDA before entering the office since they risk exposure to internal conversations, data, etc.…
We're kicking things off in style. Daan van Berkel (@daan_van_berkel) presents Leslie Lamport's seminal paper "Time, Clocks, and the Ordering of Events in a Distributed System".…