Possible Readings

• Possible Readings

There will be two different types of summaries for different types of papers. Research papers will require research paper summaries. Other papers (e.g., survey papers) will require a survey paper summary. The format of these will be made available in advance.

Paper Summaries

• Information and examples

Background / Helpful Readings

• Paper Reading Check List,
  Sugih Jamin, jamin@eecs.umich.edu.
• How to Read a Research Paper,
  by Spencer Rugaber
• Efficient Reading of Papers in Science and Technology
  Prepared by Michael J. Hanson, Updated by Dylan J. McNamee, January 6, 2000.

Readings

• Week 0: January 6, 2011
  • Course Overview
  • General Discussion
  
  
  
• Week 1: January 13, 2011 (Summary Due Wed Jan 12, 1 pm)
  (NOTE: Only one summary required, research paper summary for, An Analysis of Linux Scalability to Many Cores).
  1. The Future of Microprocessors,
     Kunle Olukotun and Lance Hammond, IEEE Queue, September, 2005.
  2. Software and the Concurrency Revolution,
     Herb Sutter and James Larus, IEEE Queue, September, 2005.
  3. Extreme Software Scaling
     Richard McDougall, IEEE Queue, September, 2005.
  4. An Analysis of Linux Scalability to Many Cores,
     Silas Boyd-Wickizer, Austin T. Clements, Yandong Mao, Aleksey Pesterev, M. Frans Kaashoek, Robert Morris, and Nickolai Zeldovich, OSDI, October, 2010.
  
  
  
• Week 2: January 20, 2011 (Summary Due Wed Jan 19, 1 pm)
  Summaries will be required for all papers this week.
  1. The Multikernel: A New OS Architecture for Scalable Multicore Systems Andrew Baumann, Paul Barham, Pierre-Evariste Dagand Tim Harris, Rebecca Isaacs, Simon Peter Timothy Roscoe, Adrian Schupbach, Akhilesh Singhania,
     SOSP 2009.
  2. An operating system for multicore and clouds: mechanisms and implementation
     David Wentzlaff, Charles Gruenwald III, Nathan Beckmann, Kevin Modzelewski, Adam Belay, Lamia Youseff, Jason Miller, Anant Agarwal Proceedings of the 1st ACM symposium on Cloud computing (SoCC '10), 2010.
  
  
  
• Week 3: January 27, 2011 (Summary Due Wed Jan 26, 1 pm)
  Summaries will be required for all papers this week.
  1. FlexSC: Flexible System Call Scheduling with Exception-Less System Calls
     Livio Soares and Michael Stumm, OSDI 2010.
  2. Finding a needle in Haystack: Facebook's photo storage,
     Doug Beaver, Sanjeev Kumar, Harry C. Li, Jason Sobel and Peter Vajgel, OSDI 2010.
  
  
  
• Week 4: February 3, 2011 (Summary Due Wed Feb 2, 1 pm)
  Summaries will be required for all papers this week.
  1. First-Class User-Level Threads,
     Brian D. Marsh, Michael L. Scott, Thomas J. LeBlanc, and Evangelos P. Markatos,
     SOSP, 1991.
  2. SEDA: An Architecture for Well-Conditioned, Scalable Internet Services,
     Matt Welsh, David Culler, and Eric Brewer, SOSP, 2001.
  
  
  
• Week 5: February 10, 2011 (Summary Due Wed Feb 9, 1 pm)
  Summaries are NOT required for 1 and 2 this week.
  1. Why Threads Are A Bad Idea (for most purposes)
     John Ousterhout, Talks at USENIX, 1996.
  2. Why Events Are A Bad Idea (for high-concurrency servers),
     Rob von Behren, Jeremy Condit and Eric Brewer, HOTOS, 2003.
  3. Capriccio: Scalable Threads for Internet Services,
     Rob von Behren, Jeremy Condit, Feng Zhou, George C. Necula, and Eric Brewer, SOSP 2003.
     
  4. Comparing the Performance of Web Server Architectures,
     David Pariag, Tim Brecht, Ashif Harji, Peter Buhr, and Amol Shukla, Eurosys 2007.
  
  
  
• Week 6: February 17, 2011 (Summaries Due Wed Feb 16, 1 pm)
  
  1. FAWN: A Fast Array of Wimpy Nodes,
     David G. Andersen, Jason Franklin, Michael Kaminsky, Amar Phanishayee, Lawrence Tan, Vijay Vasudevan,
     SOSP 2009.
  2. Migrating enterprise storage to SSDs: analysis of tradeoffs,
     Dushyanth Narayanan, Eno Thereska, Austin Donnelly, Sameh Elnikety, Antony Rowstron,
     Eurosys 2009.
  
  
  
• Week 7: February 24, 2011
  Reading Week. No Class.
  
  
• Week 8: March 3, 2011 (Summaries Due Wed Mar 2, 1 pm)
  
  1. MapReduce: Simplied Data Processing on Large Clusters,
     Jeffrey Dean and Sanjay Ghemawat,
     SOSP 2004.
  2. Scalable Performance of the Panasas Parallel File System,
     Brent Welch, Marc Unangst, Zainul Abbasi, Garth Gibson, Brian Mueller, Jason Small, Jim Zelenka and Bin Zhou,
     FAST, 2008.
  
  
  
• Week 9: March 10, 2011
  No Class.
  
  
• Week 10: March 17, 2011 (Summaries Due Wed Mar 16, 1 pm)
  
  1. Coda: A Highly Available File System for a Distributed Workstation Environment,
     M. Satyanarayanan, James Kistler, Puneet Kumar, Maria Okasaki, Ellen Siegel, and David Steere
     IEEE TOCS, 1990.
  2. Disco: Running Commodity Operating Systems on Scalable Multiprocessors,
     Edouard Bugnion, Scott Devine, and Mendel Rosenblum
     SOSP, 1997.
     
  
  
  
• Week 11: March 24, 2011 (Summaries Due Wed Mar 23, 1 pm)
  
  1. A Case for Scaling Applications to Many-core with OS Clustering,
     Xiang Song, Haibo Chen, Rong Chen, Yuanxuan Wang, and Binyu Zang,
     Eurosys, 2011
     
  2. X10: An Object-oriented approach to non-uniform Clustered Computing,
     Charles, Donwa, Ebcioglu, Grothoff, Kielstra, von Praun, Saraswat, and Sarkar,
     OOPLA, 2005.
     
  
  
  
• Week 12: March 31, 2011 (Question Answers Due: Wed March 30, 1 pm, Project Paper Thu March 31, 1 pm)
  Answer these questions and and email me a pdf file using the same approach used to sending summaries.
  NO SUMMARIES DUE. Question answers due, projects due.
  We will use your the questions and your answers as well as your project experiences to drive our wrap up discussion.
  
  
  
• Week 13: April 7, 2011 (Paper Reviews Due: Wed April 6, 1 pm)
  We will have a program committee meeting to discuss the course papers.