CS262a: Reading Assignment #21 Due Thursday, November 6th

1. MapReduce: Simplified Data Processing on Large Clusters
   Jeffrey Dean and Sanjay Ghemawat. Appears in Communications of the ACM, Vol. 51, No. 1, pp 107-113. January 2008
2. A Comparison of Approaches to Large-Scale Data Analysis
   Andrew Pavlo, Erik Paulson, Alexander Rasin, Daniel J. Abadi, David J. DeWitt, Samuel Madden, Michael Stonebraker. Appears in Proceedings of the ACM SIGMOD International Conference on Management of Data, 2009
3. Spark: Cluster Computing with Working Sets
   M. Zaharia, M. Chowdhury, M.J. Franklin, S. Shenker and I. Stoica. Appears in Proceedings of HotCloud 2010, June 2010.

You must also:

Submit a summary for each paper.

Optional Reading for Paper #1:

• MapReduce and Parallel DBMSs: Friends or Foes?
  Michael Stonebraker, Daniel Abadi, David J. DeWitt, Sam Madden, Erik Paulson, Andrew Pavlo, and Alexander Rasin. Appears in Proceedings of the Communications of the ACM (CACM), Vol. 53, No. 1, pp64-71, January 2010
• HadoopDB: An Architectural Hybrid of MapReduce and DBMS Technologies for Analytical Workloads
  Azza Abouzeid, Kamil BajdaPawlikowski, Daniel Abadi, Avi Silberschatz, Alexander Rasin. Appears in Proceedings of ACM Conference on Very Large Databases (VLDB), 2009

Optional Readings for Paper #2:

• Resilient Distributed Datasets: A Fault-Tolerant Abstraction for In-Memory Cluster Computing. Matei Zaharia, Mosharaf Chowdhury, Tathagata Das, Ankur Dave, Justin Ma, Murphy McCauley, Michael J. Franklin, Scott Shenker, Ion Stoica. Appears in Proceedings of the 9th USENIX conference on Networked Systems Design and Implementation (NSDI), 2012

Back to CS262a page