Course Materials for Comp 512
Advanced Operating Systems
Spring 2013
Linda Null
Office: W255 Olmsted
Phone: 948-6089
Email:LNull at psu.edu
[Date in brackets indicates date posted]
- [4/10]
Our second exam is scheduled for Tuesday, April 16th.
I have posted a Study Guide.
- [2/19]
Our first exam is scheduled for Tuesday, March 12th.
I have posted a Study Guide.
- [1/22]
Class for Tuesday, 1/22, has been canceled. HW#2 has been
extended another week.
- [1/16]
The due date for HW#1 has been changed from 1/22 to 1/29.
Please note: Homework is due on the date specified, at the BEGINNING of the
class. Late homework is not accepted unless specifically noted in the assignment.
- Recommended readings for Deadlock:
- Deadlock Detection in
Distributed Systems by Mukesh Singhal,
IEEE Computer, Nov, 1989, pp. 37-48.
- Deadlock Detection in Distributed Databases
by Edgar Knapp, ACM Computing Surveys, 19(4), Dec. 1987, pp. 303-328.
- Distributed Deadlock
Detection by K. Mani Chandy, Jayadev Misra, and Laura Haas,
ACM Transactions on Computer Systems, 1(2), May 1983,
pp. 144-156. (The topic of this paper was discussed in class
so you may want to look it over.)
- Some Deadlock Properties of
Computer Systems by Richard C. Holt, Computing Surveys,
4(3), Sept. 1972, pp. 179-196.
- Protocols for Deadlock
Detection in Distributed Database Systems by G.S. Ho and
C.V. Ramamoorthy, Trans. on SWE, 8(6), November 1982, pp. 554-557.
- Distributed Snapshots:
Determining Global States of Distributed Systems by K.M.
Chandy and L. Lamport, Trans. on Computer Systems, 3(1),
Feb. 1985, pp. 3-75.
- Recommended readings for Consensus:
(these papers will not be discussed in class but
they may be helpful in studying for the exam):
-
Reaching Agreement in the Presence of Faults
by M. Pease, R. Shostak, and L. Lamport,
JACM, 27(2), April 1980, pp. 228-234.
-
The Byzantine Generals Problem
by L. Lamport, R. Shostak, and M. Pease,
ACM Transactions on Programming Languages and Systems,
4(7), July 1982, pp. 382-401.
- Recommended readings for Distributed Mutual Exclusion
Algorithms
(these papers will not be discussed in class but
the first two may be helpful in studying for the exam):
-
An Optimal Algorithm for Mutual Exclusion in Computer Networks
by Glenn Ricart and Ashok Agrawala, CACM, 24(1),
January 1981, pp. 9 -17.
- A sqrt(N) Algorithm for Mutual
Exclusion in Decentralized Systems
by M. Maekawa, ACM Transactions on
Computer Systems, 3(2), May 1985, pp. 145-159.
- A Distributed Mutual
Exclusion
Algorithm by I. Suzuki and T. Kasami, ACM Transactions on Computer
Systems, 3(4), November 1985, pp. 344-349.
- A Tree-Based Algorithm for
Distributed Mutual Exclusion
by K. Raymond, ACM Transactions on Computer
Systems, 7(1), February 1989, pp. 61-77.
- Read for February 12,2013
- Read for February 5, 2013
- Read for January 22, 2013
- Read for January 15, 2013
Here is a list of plagiarism links: