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

1. Purpose

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

1. Mobile Agents

1-1. D'Agent

1. http://agent.cs.dartmouth.edu/
2. David Kotz, Robert Gray, Saurab Nog, Daniela Rus, Sumit Chawla, and George Cybenko, "Agent TCL: Targeting the Needs of Mobile Computers", In Milojicic, D., Douglis, F., and Wheeler, R., editors, Mobility: Processes, Computers, and Agents, ACM Press, 1999, pages 514-523. (available from the instructor)
3. Robert Gray and David Kotz and George Cybenko and Daniela Rus., "Chapter 4: Agent Tcl", In William Cockayne and Michael Zyda, editors, Mobile Agents: Explanations and Examples, chapter 4, Manning, 1997, pages 58-95 (available from the instructor)

1-2. IBM Aglets

1. Danny B. Lange and Mitsuru Oshima, "Mobile Agents with Java: The Aglet API", In Milojicic, D., Douglis, F., and Wheeler, R., editors, Mobility: Processes, Computers, and Agents, ACM Press, 1999, pages 495-512. (available from the instructor)
2. Danny B. Lange and Mitsuru Oshima, "Programming and Deploying Java Mobile Agents with Aglets", Addison-Wesley, June 1998 (available from the instructor)
3. Danny B. Lange and Mitsuru Oshima, "Chapter 6: Aglets Workbench", In William Cockayne and Michael Zyda, editors, Mobile Agents: Explanations and Examples, chapter 6, Manning, 1997, pages 165-183 (available from the instructor)

1-3. Ara

1. http://wwwagss.informatik.uni-kl.de/Projekte/Ara/index_e.html
2. Holger Peine and Torsten Stolpmann, "The Architecture of the Ara Platform for Mobile Agents", In Milojicic, D., Douglis, F., and Wheeler, R., editors, Mobility: Processes, Computers, and Agents, ACM Press, 1999, pages 495-512. (available from the instructor)
3. H. Peine, "Chapter 5: Agents for remote access", In William Cockayne and Michael Zyda, editors, Mobile Agents: Explanations and Examples, chapter 5, Manning, 1997, pages 165-183 (available from the instructor)

1-4. Mole

1. http://mole.informatik.uni-stuttgart.de/
2. J. Baumann, F. Hohl, K. Rothermel, and M. Straser, "MOLE - Concepts of A Mobile Agent System", In Milojicic, D., Douglis, F., and Wheeler, R., editors, Mobility: Processes, Computers, and Agents, ACM Press, 1999, pages 536-556. (available from the instructor)

1-5 Telescript

1. James E. White, "Telescript Technology: Mobile Agents", In Milojicic, D., Douglis, F., and Wheeler, R., editors, Mobility: Processes, Computers, and Agents, ACM Press, 1999, pages 461-493. (available from the instructor)
2. James E. White, "Chapter 3: Telescript", In William Cockayne and Michael Zyda, editors, Mobile Agents: Explanations and Examples, chapter 3, Manning, 1997, pages 37-57 (available from the instructor)

1-6. Messengers

1. http://www.ics.uci.edu/~bic/messengers/
2. Munehiro Fukuda, Lubomire F. Bic, Michael B. Dillencourt, and Fehmina Merchant, "Distributed Coordination with MESSENGERS", Science of Computer Programming Journal, Special Issue on Coordination Models, Languages, and Applications, 31(2), July 1998, pages 291-311 (available from the instructor)
3. Munehiro Fukuda, Lubomire F. Bic, Michael B. Dillencourt, and Fehmina Merchant, "Messages versus Messengers in Distributed Programming", Journal of Parallel and Distributed Computing, 57, 1999, pages 188-211 (available from the instructor)

2. Distributed Shared Memory

2-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 instructor)
2. George Coulouris, Jean Dollimore, and Tim Kindberg, "Sequential Consistency and Ivy", Section 16.3, In Book of Distributed Systems: Concepts and Design, 3rd Ed., Addison-Wesley, 2001, pages 649-657 (Our textbook. If you choose this topic, your review should be more than the textbook's scope.)

2-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)

2-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 16.4, In Book of Distributed Systems: Concepts and Design, 3rd Ed., Addison-Wesley, 2001, pages 657-663 (available from the instructor)

2-4. Linda/Jini/JavaSpace

1. Gelernter, D. and Carriero, N., "Coordination Languages and Their Significance", Communication of ACM, Vol.35 No.2, 1992, pages 97-107 (available from the instructor)
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://wwws.sun.com/software/jini/
4. http://developer.java.sun.com/developer/Books/JavaSpaces/introduction.html
5. JavaSpace Specification (available at http://citeseer.nj.nec.com/microsystems98javaspaces.html)

3. Distributed Synchronization

3-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 instructor)
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)

3-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 instructor)
2. Jefferson, D.R., "Virtual Time", ACM Transactions on Programming Languages and Systems, Vol.7 No.3, 1985, pages 404-425 (available from the instructor)

3-3. Distributed Snapshot(Samadi's)

1. B. Samadi, Distributed Simulation, Algorithms and Performance Analysis. PhD thesis, UCLA, 1985.

3-4. Distributed Snapshot(Mattern's)

1. Mattern, F., "Efficient Algorithms for Distributed Snapshots and Global Virtual Time Approximation", Journal of Parallel and Distributed Computing, Vol.18, No.4, 1993, pages 425-434 (available at http://citeseer.nj.nec.com/mattern93efficient.html)

4. Distributed File Systems

4-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 instructor)
2. George Coulouris, Jean Dollimore, and Tim Kindberg, "Sun Network File System", Section 8.3, In Book of Distributed Systems: Concepts and Design, 3rd Ed., Addison-Wesley, 2001, pages 323-335 (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.nj.nec.com/pawlowski94nfs.html)

4-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, 3rd Ed., Addison-Wesley, 2001, pages 335-344 (Our textbook. If you choose this topic, your review should be more than the textbook's scope.)
2. 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)

4-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 instructor)
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.nj.nec.com/sweeney96scalability.html)

4-4. Plan 9

1. http://www.cs.bell-labs.com/plan9dist/
2. Andrew S. Tanenbaum and Maarten van Steen, "Plan 9: Resources Unified to Files", Section 10.3.1, In Book of Distributed Systems: Principles and Paradigms, Prentice Hall, 2002, pages 623-629 (available from the instructor)

4-5. Log-Strucutre File System (LFS)

1. Mendel Rosenblum and John K. Ousterhout, "The Design and Implementation of a Log-Structured File System", ACM Transactions on Computer Systems, vol.10, no.1, Feb. 1992, pages 26-52 (available at http://citeseer.nj.nec.com/rosenblum91design.html)
2. Mendel Rosenblum and John K. Ousterhout, "The LFS Storage Manager", Proceedings of the USENIX Summer 1990 Technical Conference (available at http://citeseer.nj.nec.com/rosenblum90lfs.html)

5. Replication and Fault Tolerance

5-1. ISIS

1. http://www.cs.cornell.edu/Info/Projects/ISIS/
2. Birman, K.P., "The Process Group Approach to Reliable Distributed Computing" , Communication of ACM, Vol.36, No.12, 1993 pages 36-53 (available from uw1-320-lab:~css434/papers)
3. Birman, K. and Joseph, T., "Exploiting Virtual Synchrony in Distributed Systems", In Proceedings of 11th Symposium on Operating System Principles, 1987 pages 123-138 (available from uw1-320-lab:~css434/papers)
4. Birman, K. and Van Renesse, R. (eds.), "Reliable Distributed Computing with the Isis Toolkit", IEEE Computer Society Press, 1994

5-2. Gossip

1. George Coulouris, Jean Dollimore, and Tim Kindberg, "The Gossip Architecture", Section 14.1.1, In Book of Distributed Systems: Concepts and Design, 3rd Ed., Addison-Wesley, 2001, pages 572-582 (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 instructor)
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)

5-3. Bayou

1. George Coulouris, Jean Dollimore, and Tim Kindberg, "Bayou and the Operational Transformation Approach", Section 14.4.2, In Book of Distributed Systems: Concepts and Design, 3rd Ed., Addison-Wesley, 2001, pages 582-584 (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.nj.nec.com/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.nj.nec.com/petersen97flexible.html)

5-4. 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 instructor)
2. George Coulouris, Jean Dollimore, and Tim Kindberg, "The Coda File System", Section 14.4.3, In Book of Distributed Systems: Concepts and Design, 3rd Ed., Addison-Wesley, 2001, pages 584-591 (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 instructor)

6. Grid Computing

6-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 instructor)

6-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 instructor)

6-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

6-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 instructor)

6-5. J-SEAL2

1. W. Binder, G.D.M. Secrugendo, and J. Hulaas, "Towards a secure and efficient model for grid computing using mobile code", In Proc. 8th ECOOP Workshop on Mobile Object Systems: agent Application and Few Forntiers, Malaga, spain, June 2002.
2. http://www.jseal2.com/

6-6. ENTROPIA

1. ENTROPIA PC Grid Computing

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 instructor.

Email or talk to the instructor by the end of the second 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 instructor by the end of the second week, you will be considered to have dropped off from the class.

3. Presentation

Get prepared for your presentation using PowerPoint. Send your PowerPoint file to the instructor by two days before your acutal presentation day, so that the instructor can make it available through the class web. If you cannot complete your presentation file by then, you are responsible to distribute your hard copy of slides to the audience in the class.

The audience is expected to evaluate each student presentation according to an evaluation sheet passed by the instructor. 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 instructor upon the completion of each student presentation. Based on audience evaluation, the instructor will grade each studnet presentation. Note that the audience evaluation is not 100% reflected to the final grade of your presentation. The instructor 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