Lecture 12 (Thurs Oct 3): Synchronization 5: Reader+Writer con't / Deadlock
Intro / Flashback (01:30)
Go Back
Reader / Writer priority (00:42)
Go Back
In general: Choosing orderings (00:31)
Go Back
Simulation of reader/writer lock (03:07)
Go Back
rwlock exercise (10:20)
Go Back
rwlock exercise 2 (02:16)
Go Back
The "Cheeky" solution (00:38)
Go Back
Deadlock analogies (01:32)
Go Back
pipe() deadlock (01:47)
Go Back
Example: moving files (03:55)
Go Back
Deadlock with memory (00:39)
Go Back
Deadlock vs Starvation (01:15)
Go Back
Deadlock requirements (01:51)
Go Back
Exercise: How is deadlock possible? (08:03)
Go Back
Deadlock prevention techniques (04:55)
Go Back
Abort and retry; Livelock (03:03)
Go Back
Preventing Livelock (01:26)
Go Back
Acquiring locks in a consistent order (06:38)
Go Back
Request all resources at once (01:15)
Go Back
Deadlock detection (10:58)
Go Back
Using deadlock detection for prevention (01:16)
Go Back
Beyond threads: Event-based programming (05:33)
Go Back