CS 239: Distributed Operating Systems
Spring, 2001
| Lectures | Reading Assignments in Chow and Johnson |
|---|---|
| Week 1 | |
| Introduction: What Is a Distributed Operating System? | |
| Concurrent Processes and Synchronization | |
| Week 2 | |
| Interprocess Communications in Distributed Operating Systems | |
| Remote Procedure Calls and Transacations | |
| Week 3 | |
| Naming in Distributed Operating Systems | |
| Mutual Exclusion Methods for Distributed Operating Systems | |
| Week 4 | |
| Distributed File Systems | |
| Replicated File Systems | |
| Week 5 | |
| Distributed Shared Memory | |
| Causally Ordered Communications | |
| Week 6 | |
| Election Algorithms | |
| MIDTERM | |
| Week 7 | |
| Byzantine Agreement and When Concensus is Possible | |
| Security for Distributed Systems | |
| Week 8 | |
| Security for Distributed Systems, Con't | |
| Building Distributed Systems from Components | |
| Week 9 | |
| Memorial Day Holiday | |
| Network of Workstation Systems | |
| Week 10 | |
| To be announced | |
| To be announced |