This page will be updated during the semester
Required Reading
- By February 4:
- Chapters 1-2 of the textbook.
- By February 11:
-
C. A. R. Hoare, Communicating Sequential Processes,
Communications of the ACM, 21 (8), pp. 666-677, 1978.
- Chapter 3 of the textbook.
-
R. C. Holt, Some Deadlock Properties of Computer Systems,
ACM Computing Surveys, 4 (3), pp. 179-196, 1972.
- By March 11:
- Chapters 4, 5, and 6 (except 6.9 and 6.12) of the textbook.
- Chapter 7 (except 7.7.1, "Other Edge-Chasing Algorithms", and 7.7.4)
of the textbook.
- Articles
- D. Agrawal and A. El Abbadi, An Efficient
and Fault-Tolerant Solution for Distributed Mutual Exclusion,
ACM Transactions on Computer Systems, Vol. 9, No. 1, pp. 1-20, 1991.
- D. Peleg and A. Wool, Crumbling Walls:
A Class of Practical and Efficient Quorum Systems,
Distributed Computing 10(2): 87-97 (1997)
- H. Garcia-Molina and D. Barbara,
How to assign votes in a
distributed system.
Journal of the ACM, 32(4):841--860, 1985.
- By April 8, 2002:
- Chapter 9 (except for 9.5.3 and 9.5.5).
- Articles
- M. Nelson, B. Welch, and J. Ousterhout,
Caching in the Sprite Network File System,
ACM Transactions on Computer Systems, (6) 1, pp. 134-154, 1988.
-
Satyanarayanan, M., Kistler, J.J., Kumar, P., Okasaki, M.E., Siegel, E.H.,
Steere, D.C.,
Coda: A Highly Available File System for a Distributed Workstation
Environment.
IEEE Transactions on Computers, 39 (4), pp. 447-459, 1990.
Recommended Reading
- Review of undergraduate material (if you need to):
Chapters 1-13, 15, 19-21, and 24 from the book Operating Systems Concepts,
Silberschatz and Galvin, Addison-Wesley, 1998 (5th Edition or later).