Reading Assignments
This page will be updated during the semester.
The papers below are made available here only for the convenience of the students
in CMSC 621, Fall 2003. These papers are copyrighted by their individual publishers;
DO NOT USE, COPY, OR DISTRIBUTE these papers unless you are a student in the class.
Required Reading:
- TBA
- By September 15:
- Chapters 1-3 of the textbook.
-
C. A. R. Hoare,
Communicating Sequential Processes,
CACM, 21 (8), pp. 666-677, 1978. (Recommended)
-
R. C. Holt, Some Deadlock Properties
of Computer Systems, ACM Computing Surveys, 4 (3), pp. 179-196, 1972.
- By October 8:
- Chapters 4-6 of the textbook.
- By October 21:
- Chapters 7 and 9 of the textbook.
- Michael N. Nelson, Brent B. Welch, And John K. Ousterhout,
Caching in the Sprite Network
File System,
ACM Transactions on Computer Systems, Vol. 6, No. 1, February 1988, pp. 134-154.
- M. Satyanarayanan, et al, Coda: A Highly Available
File System for a Distributed Workstation Environment,
IEEE Transactions On Computers, Vol. 39, No. 4, pp. 447-459, April 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).
- Clocks and Distributed Mutual Exclusion
- L. Lamport,
Time, Clocks, and the Ordering of Events in a
Distributed System,
Communications of The ACM, Volume 21, Number 7, July 1978, pp. 558-565.
- G. Ricart and A. K. Agrawala,
An Optimal Algorithm for Mutual Exclusion
in Computer Networks,
Communications of The ACM, Volume 24, Number 1, January 1981, pp. pp. 9-17.
- M. Maekawa,
A sqrt(N) Algorithm for Mutual Exclusion in
Decentralized Systems,
ACM Transactions on Computer Systems, Vol. 3, No. 2, May 1985, pp. 145-159.
- I. Suzuki and T. Kasami,
A Distributed Mutual Exclusion Algorithm,
ACM Transactions on Computer Systems, Vol. 3, No. 4, November 1985, pp. 344-349.
- K. Raymond,
A Tree-Based Algorithm for Distributed Mutual Exclusion,
ACM Transactions on Computer Systems, Vol. 7, No. 1, February 1989, pp 61-77.
- Hector Garcia-Molina and Daniel Barbara,
How to Assign Votes in a Distributed System,
Journal of the Association for Computing Machinery, Vol. 32, No. 4.
October 1985, pp. 841-860.
- Divyakant Agrawal and Amr El Abbadi,
An Efficient and Fault-Tolerant Solution
for Distributed Mutual Exclusion,
ACM Transactions on Computer Systems, Vol. 9, No 1, February 1991, Pages 1-20.
- David Peleg and Avishai Wool,
Crumbling Walls: A Class of Practical and Efficient
Quorum Systems,
Distributed Computing, 10(2):8798, 1997.
- David K. Gifford,
Weighted Voting for Replicated Data.
ACM Operating Systems Review, SIGOPS, 1979.
- Robert Thomas, A Majority Consensus Approach
to Concurrency Control for Multiple Copy Databases.
ACM Transactions on Database Systems, 4(2): 180-209 (1979).
- Global State in Distributed Computations
- K. M. Chandy and L. Lamport,
Distributed Snapshots: Determining Global States
of Distributed Systems,
ACM Transactions on Computer Systems, Vol. 3, No. 1, February 1985, pp. 63-75.
- K. Birman, A. Schiper, and P. Stephenson,
Lightweight Causal and Atomic Group Multicast,
ACM TransactIons on Computer Systems, Vol 9, No. 3, August 1991, pp 272-314.
- S. T. Huang,
Detecting Termination of Distributed
Computation using External Agents,
Proceedings of the 9th IEEE Conference on Distributed Computing Systems,
June 1989, pp. 79-84.
- Distributed Deadlock Detection
- K. M. Chandy, J. Misra, and L. M. Haas,
Distributed Deadlock Detection,
ACM Transactions on Computer Systems, Vol. 1, No. 2, May 1983, pp. 144-156.
- G. S. Ho and C. V. Ramamoorthy,
Protocols for Deadlock Detection
in Distributed Database Systems, IEEE Transactions on Software Engineering,
Volume SE-8, Number 6, November 1982, pp. 554-557.