CS5204: Operating Systems

The overheads are provided as PDF documents, with either 2 slides per page or 6 slides per page. These are listed in the Overheads bullet for each day as "2-up" and "6-up", respectively. All PDF documents viewed should all appear in the same window, which will be separate from the main website window.

Please note that the contents of this page and the files to which it links may change at any time; please check for updates frequently. You may not want to print many slides ahead of time, as they will most likely change throughout the semester.

Course Introduction

1. Tuesday, August 24
• Course Overview
• Overheads: 2-up / 6-up
• Text: Read Chapter 1 by the next class.
• Text: Read Section 2.1-2.5 by the next class.

Section 1: Object Model

2. Thursday, August 26
• Overheads: 2-up / 6-up
• Text: Read Section 2.6.1
• Read: about the Monitor model

 
3. Tuesday, August 31
• Overheads: 2-up / 6-up
• Code samples given in class
• Using a Monitor in Java
• References and optional readings:
• Using threads in Java
• Java tutorial
• Another tutorial
• Java Language Specification
• Java as a Language for Concurrent and Distributed Programming
• A summary
• Concurrent programming examples and discussion

 
4. Thursday, September 2
• Path Expressions
• Overheads: 2-up / 6-up
• Text: Section 2.6.3

 
5. Tuesday, September 7
• Communicating Sequential Processes (CSP)
• Overheads: 2-up / 6-up
• Text: Section 2.6.4
• Optional Reading: CSP
• Optional References: the CSP archive of related work

 
6. Thursday, September 9
• Overheads: 2-up / 6-up


• Text: Sections 4.1-4.6
• Read: Remote Procedure Calls (introduction, overview)
• Read: Corba (OMG, overview)
• References and Optional Readings:
• Data streams (sockets) (in Java)
• Remote Procedure Calls (used with XML)
• Remote Method Invocations (specification, tutorial)
• Corba (paper)
• Corba, DCOM and Java paper

Section 2: Tuple Spaces and Agent Models

7. Tuesday, Setpember 14
• Overheads: 2-up / 6-up


• Read: Tuple Spaces (Linda)
• Read: Mobile Agents ( motivation, Java agents)
• Optional: Examples of tuple space systems
• IBM: Tspaces (HTML)
• Sun JavaSpaces:
• (Overview)
• Specification (in PDF)
• Optional: Examples mobile agent systems
• Voyager (papers, download)
• Concordia (overview, white paper, site)
• Aglets(overview, site)

Section 3: Event Ordering and System State

8. Thursday, September 16
• Time and Event Ordering
• Overheads: 2-up / 6-up


• Lamport's logical time ( Postscript)
• Vector Clocks
• Text: Sections 5.1-5.4
 
9. Tuesday, September 21
• Message Ordering
• Distributed Snapshots
• Overheads: 2-up / 6-up


• Text: Sections 5.5-5.6

 
10. Thursday, September 23
• Cuts in a distributed computation
• Termination
• Overheads: 2-up / 6-up
• Text: Sections 5.7 - 5.8

Section 4: Metacomputing Model

11. Tuesday, September 28
• Metasystems (in PDF)
• Overview of metasystems (in PDF)
• Globus Architecture (PS, PDF)
• Legion (PDF, PS)

 
12. Thursday, September 30
• Distributed Scheduling


• Overheads: 2-up / 6-up
• Read: Section 11.1 - 11.5

 
13. Tuesday, October 5
• Distributed Scheduling (cont.)
• Overheads (same as yesterday's): 2-up / 6-up
• Read: Sections 11.6-11.9
• Review for Midterm Exam

* Midterm Exam *

14. Thursday, October 7
• Midterm Exam

Section 5: Recovery and Checkpointing

15. Tuesday, October 12
• Review of the Midterm Exam
• Recovery Protocols
• Read: Sections 12.1 - 12.8

 
16. Thursday, October 14
• Fault Tolerance


• Read: Sections 13.1-13.4
• Two-Phase Commit Protocol

 
17. Tuesday, October 19
• Three-Phase Commit Protocol
• Read: Section 13.5

Section 6: Security

18. Thursday, October 21
• Overview, Access Matrix Model, Lock Key Method
• Protection: Basic Models
• Safety, Take-Grant Model
• Take-Grant Systems


• Protection: Bell-Lapadula Model
• Lattice Model, Information Flow
• Lattice Model of Information Flow (by Olivier Marchand)
• Read: Sections 14.1 - 14.6

 
19. Tuesday, October 26
• Cryptography
• Public Key Systems, RSA
• Digital Signatures in Public Key Cryptosystems
• Cryptography: RSA Algorithm
• Authentication, Digital Signatures, Public Key
• Read: Section 15.1 - 15.6

 
20. Thursday, October 28
• Private Key Systems
• Kerberos case study
• Read: Section 15.8 - 15.9

 
21. Tuesday, November 2
• New material will be added

Section 7: Transaction Model

22. Thursday, November 4
• Distributed DBMS Model
• Serializability Theory
• Read: Chapter 18, Sections 19.1-19.5

 
23. Tuesday, November 9
• Two-Phase Locking
• Read: Chapter 18, Sections 20.1-20.20.3.4

 
24. Thursday, November 11
• Timestamp-based Locking


• Basic Timestamp Ordering Algorithm
• Read: Section 20.3.5, Section 20.4.1

 
25. Tuesday, November 16
• Conservative Timestamp Ordering Algorithm
• Multiversion Timestamp Ordering Algorithm
• Optimistic Algorithm
• Read: Sections 20.4.3-20.4.4; Section 20.5

Section 8: Formal Model

26. Thursday, November 18
• Calculus of Communicating Systems ( CCS)


• Optional: other overheads about CCS
• CCS

 
Thanksgiving Break
 
27. Tuesday, November 30
• CCS (cont.)

 
28. Thursday, December 2
• CCS (cont.)

 
29. Tuesday, December 7
• Review for Final Exam
• Course Evaluation