|
|
Lecture schedule
Monday | Tuesday | Wednesday | Thursday | Friday | |
May | 21 Introduction and history (Barr) slides |
22 Background: architecture (Atkin) |
23 Processes (Barr) slides |
||
26 Memorial day |
27 Processes (Barr) slides section #1: slides |
28 Processes (Barr) slides |
29 Threads (Barr) slides |
30 Virtual machines (Barr) hw1: processes slides |
|
June | 2 Synchronisation (Atkin) section: slides |
3 Synchronisation (Atkin) |
4 Synchronisation (Atkin) |
5 Synchronisation (Atkin) Solution to monkeys and bananas problem |
6 Deadlocks (Atkin) |
9 Deadlocks (Atkin) p1: threads hw2: synchronisation |
10 Scheduling (Atkin) |
11 Scheduling (Atkin) |
12 I/O (Barr) slides |
13 Midterm |
|
16 Disks (Atkin) |
17 File system (Atkin) hw3: scheduling |
18 File system (Atkin) |
19 File system (Atkin) p2: preemption |
20 File system (Atkin) |
|
23 Memory (Barr) hw4: file systems slides |
24 Memory (Barr) slides |
25 Memory (Barr) slides |
26 Memory (Barr) slides |
27 Protection and security (Barr) hw5: virtual memory |
|
July | 30 Mobile computing (Atkin) p3: file system |
1 Distributed systems and review (Barr) |
2 Final exam |
Copyright 2003, Rimon Barr and Ben Atkin, Cornell University |
![]() |