| 1 |
9 Jan |
Introduction. Processes, fork/join, cobegin/coend, properties.Finite
progress axiom. |
| 2 |
11 Jan |
Mutual exclusion. Peterson's algorithm, using
special instructions. How to implement processes. |
| 3 |
16 Jan |
Semaphores: definition, mutual exclusion. Fairness. Implementation. |
| 4 |
18 Jan |
Bounded buffer and readers-writers. Virtual clock and I/O. |
| 5 |
23 Jan |
Monitors. |
| 6 |
25 Jan |
Deadlock: four necessary conditions. Waits-for graphs. |
| 7 |
30 Jan |
Deadlock avoidance and deadlock prevention. |
| 8 |
1 Feb |
Absolute and static memory management. |
| 9 |
6 Feb |
Paging and segmentation. |
| 10 |
8 Feb |
Page replacement, stack algorithms. |
| 11 |
13 Feb |
MIDTERM |
| 12 |
15 Feb |
Working set, WS Clock. |
| 13 |
20 Feb |
Scheduling: objective functions, priority inversion. |
| 14 |
22 Feb |
File systems: basic architecture. Physical file systems. |
| 15 |
27 Feb |
Logical file systems, directories. |
| 16 |
1 Mar |
Case study: Unix FFS. |
| 17 |
6 Mar |
Security and protection. |
| 18 |
8 Mar |
Access control lists and capabilities. |
| 19 |
13 Mar |
Cryptography, user authentication |
| 20 |
15 Mar |
Communications: client/server, RPC. |