| 1 |
11 Jan |
Introduction. Processes, fork/join, cobegin/coend, properties.Finite
progress axiom. |
| 2 |
13 Jan |
Mutual exclusion. Peterson's algorithm, using
special instructions. How to implement processes. |
| 3 |
18 Jan |
Semaphores: definition, mutual exclusion. Fairness. Implementation. |
| 4 |
20 Jan |
Producer-consumer. |
| 5 |
25 Jan |
Bounded-buffer, dining philosophers. Semaphores with special hardware. |
| 6 |
27 Jan |
Monitors. |
| 7 |
1 Feb |
Deadlock: four necessary conditions. Waits-for graphs. |
| 8 |
3 Feb |
Deadlock avoidance and deadlock prevention. |
| 9 |
8 Feb |
Absolute and static memory management. |
| 10 |
10 Feb |
Paging and segmentation. |
| 11 |
15 Feb |
Page replacement, stack algorithms. |
| 12 |
17 Feb |
Working set, WS Clock. |
| 13 |
22 Feb |
MIDTERM covering material in lectures 1-8. |
| 14 |
24 Feb |
Scheduling: objective functions and priority inversion. |
| 15 |
29 Feb |
File systems: basic architecture. Physical file systems. |
| 16 |
2 Mar |
Logical file systems, directories. |
| 17 |
7 Mar |
Security and protection. |
| 18 |
9 Mar |
Access control lists and capabilities. |
| 19 |
14 Mar |
Cryptography, user authentication. |
| 20 |
16 Mar |
TBD. |