CSS 434
Paper Review
Professor: Munehiro Fukuda
Student presentation dates: see the syllabus

0. Teamwork

This year, each paper review and presentation will be done by a team of two students. Please find your partner, choose a review topic from the following list of reading assignments, and work with your partner on the assigned paper review and in-class presentation.

1. Purpose

This reading assignment intends to have you experience the very initial step of research activity, i.e., reading research papers. Unlike reading textbooks, you are not required to acquire well-known facts but expected to summarize the key idea of each paper you have read and to discuss the contribution/drawback of the research presented in the paper.

Each student is expected to pick up a notable research/commercial project, to review one or more related papers, and to present his/her understanding of the research project he/she has chosen.

2. Reading Assignment

There are five research topics, each including a couple of projects whose accomplishment has been already published in research papers. The following shows the list of possible papers and web pages you should read. They are accessible from the web, retrieval from uw1-320-lab.uwb.edu: ~css434/papers/ through sftp, or directly given from the professor's office:

A. Distributed Synchronization

A-1. SPEEDES
  1. http://www.speedes.com/
  2. Jeff Steinman, "The Event Horizon", Technical Report, Jet Propulsion Laboratory California Institute of Technology, JPL D-10029, November 1992 (available from the professor)
  3. Jeff S. Steinman, "Discrete-event simulation and the event horizon", ACM SIGSIM Simulation Digest, Vol.24 No.1, pages 39-49, July 1994 (available from uw1-320-lab:~css434/papers)
A-2. Time Warp
  1. David Jefferson, Brian Beckman, Fred Wieland, Leo Blume, Mike DiLoret, Phil Hontalas, Pierre Laroche, Kathy Sturdevant, Jack Tupman, Van Warren, John Wedel, Herb Younger, and Steve Bellonot, "Distributed Simulation and the Time Warp Operating System" Technical Report, UCLA, Agust, 1987 (available from the professor)
  2. Jefferson, D.R., "Virtual Time", ACM Transactions on Programming Languages and Systems, Vol.7 No.3, 1985, pages 404-425 (available from the professor)

B. Distributed Shared Memory

B-1. Ivy
  1. Li, K. and Hudak, P., "Memory Coherence in Shared Virtual Memory Systems", ACM Transactions on Computing Systems, Vol.7, No.4, 1989 pages 321-359 (available from the professor)
  2. George Coulouris, Jean Dollimore, and Tim Kindberg, "Sequential Consistency and Ivy", Section 18.3, In Book of Distributed Systems: Concepts and Design, 4th Ed., Addison-Wesley, 2005, pages 763-771 (Our textbook. If you choose this topic, your review should be more than the textbook's scope.)
B-2. Dash
  1. D. Kenoski, J. Laudon, K. Gharachorloo, W. Weber, A. Gupt, J. Hennessy, M. Horowitz, and M. Lam, "The Stanford DASH multiprocessor", IEEE Computer, Vol.25 No.3, 1992, pages 63-79 (available from uw1-320-lab:~css434/papers)
  2. Leonoski, D., Laudon, J., Joe, T., Nakahira, D., Steves, L. Gupta, A., and Hennesy, J., "The DASH Prototype: Logic Overhead and Performance", IEEE Transaction on Parallel and Distributed Systems, Vol.4, No.1, 1993, pages 41-61 (available from uw1-320-lab:~css434/papers)
B-3. Munin
  1. Carter, J.B., Bennet, J.K., and Zwaenepoel, w., "Techniques for Reducing Consistency-Related Communication in Distributed Shared Memory Systems", ACM Transaction on Computer Systems, Vol.12, 1994 (available from uw1-320-lab:~css434/papers)
  2. Carter, J.B., Bennet, J.K., and Zwaenepoel, W., "Implementation and performance of Munin", In Proceedings 13th ACM Symposium on Operating System Principles, 1991, pages 152-164. (available from uw1-320-lab:~css434/papers)
  3. George Coulouris, Jean Dollimore, and Tim Kindberg, "Release Consistency and Munin", Section 18.4, In Book of Distributed Systems: Concepts and Design, 4th Ed., Addison-Wesley, 2005, pages 771-777 (Our textbook. If you choose this topic, your review should be more than the textbook's scope.)
B-4. Linda/Jini/JavaSpaces
  1. Gelernter, D. and Carriero, N., "Coordination Languages and Their Significance", Communication of ACM, Vol.35 No.2, 1992, pages 97-107 (available from uw1-320-lab:~css434/papers)
  2. Carriero, N., and Gelernter, D., "Linda in Contex", Communication of ACM, Vol.32, No.4, 1989 pages 444-458 (available from uw1-320-lab:~css434/papers)
  3. http://www.jini.org/wiki/Main_Page
  4. http://developer.java.sun.com/developer/Books/JavaSpaces/introduction.html
  5. JavaSpaces Specification (available at http://www.jini.org/wiki/JavaSpaces_Specification)

C. Distributed File Systems

C-1. Sun NSF
  1. Andrew S. Tanenbaum and Maarten van Steen, "SUN Network File System", Section 10.1, In Book of Distributed Systems: Principles and Paradigms, Prentice Hall, 2002, pages 576-603 (available from the professor)
  2. George Coulouris, Jean Dollimore, and Tim Kindberg, "Sun Network File System", Section 8.3, In Book of Distributed Systems: Concepts and Design, 4th Ed., Addison-Wesley, 2005, pages 337-349 (Our textbook. If you choose this topic, your review should be more than the textbook's scope.)
  3. Brian Pawlowski, Chet Juszczak, Peter Staubach, Carl Smith, Diane Lebel, and David Hitz, "NFS Version 3 Design and Implementation", USENIX Summer, 1994 (paper available at http://citeseer.ist.psu.edu/pawlowski94nfs.html)
C-2. AFS
  1. George Coulouris, Jean Dollimore, and Tim Kindberg, "The Andrew File Sytem", Section 8.4, In Book of Distributed Systems: Concepts and Design, 4th Ed., Addison-Wesley, 2005, pages 349-358 (Our textbook. If you choose this topic, your review should be more than the textbook's scope.)
  2. John H Howard, "An Overview of the Andrew Fiel System", in Winter 1988 USENIX Conference Proceedings, 1988 (paper available at http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.112.3194)
  3. M. L. Kazar, "Synchronization and Caching Issues in the Andrew File System", In Proceedings of the USENIX Winter Technical Conference, 1988. (available from uw1-320-lab:~css434/papers)
C-3. XFS
  1. Andrew S. Tanenbaum and Maarten van Steen, "XFS: Serverless File System", Section 10.3.2, In Book of Distributed Systems: Principles and Paradigms, Prentice Hall, 2002, pages 629-635 (available from the professor)
  2. Adam Sweeney, Doug Doucette, Wei Hu, Curtis Anderson, Mike Nishimoto, and Geof Peek, "Scalability in the XFS File System", Proceedings of the USENIX 1996 Technical Conference (paper available at http://citeseer.ist.psu.edu/sweeney96scalability.html)
C-4. PVFS: Parallel Virtual File System
  1. http://www.parl.clemson.edu/pvfs/
  2. Philip H. Carns, Walter B. Ligon, III, Robert B. Ross and Rajeev Thakur, "PVFS: A Parallel File System for Linux Clusters," In Proc. of the 4th Annual Linux Showcase and Conference, October 2000, pages 317--327 (paper available at http://citeseer.ist.psu.edu/294296.html)
  3. In-Chul Hwang, Hojoong Kim, Hanjo Jung, Dong-Hwan Kim, Hojin Ghim, Seung-Ryoul Maeng, and Jung-Wan Cho, "Design and Implementation of the Cooperative Cache for PVFS", Lecture Notes in Computer Science, Volume 3036/2004, pages 43 - 50 (available as uw1-320-lab:~css434/coopcPVM.pdf)

D. Replication and Fault Tolerance

D-1. Gossip
  1. George Coulouris, Jean Dollimore, and Tim Kindberg, "The Gossip Architecture", Section 15.4.1, In Book of Distributed Systems: Concepts and Design, 4th Ed., Addison-Wesley, 2005, pages 622-632 (Our textbook. If you choose this topic, your review should be more than the textbook's scope.)
  2. Randy Chow and Theodore Johnson, "Gossip Update Propagation", Section 6.4.4, In Book of Distributed Operating Systems & Algorithms, Addison-Wesley, 1998 pages 223-226 (available from the professor)
  3. Ladin, R., Liskov, B., Shrira, L., and Ghemawat, S., "Providing Availability Using Lazy Replication", ACM Transactions on Computer Systems, Vol.10, No.4, 1992, pages 360-391 (available from uw1-320-lab:~css434/papers)
D-2. Coda
  1. Andrew S. Tanenbaum and Maarten van Steen, "The Coda File System", Section 10.2, In Book of Distributed Systems: Principles and Paradigms, Prentice Hall, 2002, pages 604-623 (available from the professor)
  2. George Coulouris, Jean Dollimore, and Tim Kindberg, "The Coda File System", Section 15.4.3, In Book of Distributed Systems: Concepts and Design, 4th Ed., Addison-Wesley, 2005, pages 634-641 (Our textbook. If you choose this topic, your review should be more than the textbook's scope.)
  3. James J. Kistler and M. Satyanarayanan, "Disconnected Operation in the Coda File System", In Milojicic, D., Douglis, F., and Wheeler, R., editors, Mobility: Processes, Computers, and Agents, ACM Press, 1999, pages 293-305 (available from the professor)
D-3. GFS: Google File System
  1. Google Research Publication: The Google File System
  2. Cast Study GFS: Evoluation on Fast-forward, (available fat ACM Queue http://queue.acm.org/detail.cfm?id=1594206
D-4. Bayou
  1. George Coulouris, Jean Dollimore, and Tim Kindberg, "Bayou and the Operational Transformation Approach", Section 15.4.2, In Book of Distributed Systems: Concepts and Design, 4th Ed., Addison-Wesley, 2005, pages 632-634 (Our textbook. If you choose this topic, your review should be more than the textbook's scope.)
  2. Alan Demers, Karin Petersen, Mike Spreitzer, Douglas Terry, Marvin Theimer, and Brent Welch, "The Bayou Architecture: Support for Data Sharing among Mobile Users" Proceedings IEEE Workshop on Mobile Computing Systems & Applications, 1994 (available at http://citeseer.ist.psu.edu/demers94bayou.html)
  3. Terry, D., Theimer, M., Petersen, K., Demers, A., Spreitzer, M., and Hauser, C., "Managing update conflicts in Bayou, a weakly connected replicated storage system", In Proceedings of the 15th ACM Symposium on Operating Systems Principles, 1995, pages 172-183 (available from uw1-320-lab:~css434/papers)
  4. Petersen, K., Spreitzer, M., Terry, D., Theimer, M., and Demers, A., "Flexible update propagation for weakly consistent replication", In Proceedings of the 16th ACM Symposium on Operating Systems Principles, pages 228-301, 1997 (available at http://citeseer.ist.psu.edu/petersen97flexible.html)

E. Grid Computing

E-1. NetSolve
  1. http://icl.cs.utk.edu/netsolve/
  2. Henri Casanova, Jack Dongarra, Chris Johnson, and Michelle Miller, "Section 7.3: Case Study: NetSolve", In Ian Foster and Carl Kesselman, editors, The Grid: Blueprint for a New Computing Infrastracture, Morgan Kaufmann Publishers, July 1998, pages 171-175 (available from the professor)
E-2. Legion
  1. http://legion.virginia.edu/
  2. Dennies Gannon and Andrew Gimshaw, "Section 9.4: The Legion Grid Architecture", In Ian Foster and Carl Kesselman, editors, The Grid: Blueprint for a New Computing Infrastracture, Morgan Kaufmann Publishers, July 1998, pages 222-227 (available from the professor)
E-3. Condor
  1. http://www.cs.wisc.edu/condor
  2. Douglas Thain, Todd Tannenbaum, and Miron Livny, "Condor and the Grid", in Fran Berman, Anthony J.G. Hey, Geoffrey Fox, editors, Grid Computing: Making The Global Infrastructure a Reality, John Wiley, 2003. ISBN: 0-470-85319-0 (available from both the above link and uw1-320-lab:~css434/papers)
E-4. Globus
  1. http://www.globus.org/
  2. Ian Foster and Carl Kesselman, "Chapter 11: The Globus Toolkit", In Ian Foster and Carl Kesselman, editors, The Grid: Blueprint for a New Computing Infrastracture, Morgan Kaufmann Publishers, July 1998, pages 222-227 (available from the professor)

Decide one research/commercial project you are interested in, and reviews one or more readings related to the project. Some of them may be research papers published through IEEE or ACM, the others from a textbook section. Of importance is investigating the research project well enough to present your understanding in the class. If you are interested in any well-known research project other than those listed above, you can investigate it provided you receive an approval from the professor.

Email or talk to the professor by the end of the third week about what paper(s) you are interested in reviewing. The readings will be assigned in a first-come-first-service manner. Your presentation time slot will be scheduled depending on which paper(s) you want to read. Review the papers timely and get prepared for your presentation. Note! Note! Note! If you don't notify your choice to the professor by the end of the third week, you will be considered to have dropped off from the class.

3. Presentation

Several student presentations categorized in the same research topic will be scheduled on the same lecture day. Each student has 20 minutes to present his/her understanding of paper(s) as well as a couple of minutes for the following Q&A session

Get prepared for your presentation using PowerPoint. Send your PowerPoint file to the professor by two days before your acutal presentation day, so that the professor can give you some feedback as well as make it available through the class web.

The audience is expected to evaluate each student presentation according to an evaluation sheet passed by the professor. This sheet includes the following 10 criteria:

The depth of a speaker's understanding on the research project
Item 1 Did he/she well understand the paper he/she reviewed?
Item 2 Did he/she well summarized the main idea of papers?
Item 3 Did he/she give clear answers to questions asked by the audience?

The depth of a speaker's critique for the paper(s)
Item 4 Did he/she properly point out the contribution of the papers?
Item 5 Did he/she mention about any drawbacks of the ideas introduced in the papers?
Item 6 Did he/she express his/her own opinions to improve the quality of the papers, research, and projects he/she reviewed?

The quality of a reivewer's slides
Item 7 Did his/her slides help the audience understand the paper(s)?
Item 8 How about the number of slides, the amount of contents on each slide, and the use of colors, different fonts, and animation?

The effectiveness of a reviewer's presentation
Item 9 Did you understand his/her speech? In other words, did he/she well organize his/her presentation and do every effort to let audience understand his/her presentation, (i.e., alternative or additional explanations)?
Item 10 Was his/her presentation interesting? In other words, did he/she try to keep audience attracted to his/her presentation?

Each evaluation criterion will receive the following grade:
very good: 10
good: 9
fair: 8
poor: 7
very poor: 6

The audience will fill out all criteria and turn in an evaluation sheet to the professor upon the completion of each student presentation. Based on audience evaluation, the professor will grade each studnet presentation. Note that the audience evaluation is not 100% reflected to the final grade of your presentation. The professor will take into account all including the quality of your slides, your answer in a question-and-answer session, etc. to finalize your presentation grade.

4. Your Responsibility as Audience

You are responsible to fill out an evaluation sheet for each presentation except your own. Give useful feedback to your classmates. Your critique to the other students is also counted as a part of your grade. Your absence or malicious evaluation will cause 1 point reduction from your 12-point presentation grade for each presentation day. If you must be absent from the class, you should talk to speakers who gave their presentation you missed, understand their paper review, and submit evaluation sheets to the professor within a week.