- lect07 (Slide 30-36) Review Classic File Organization methods
- lect16 (140513) 1:24: Top/bottom interrupt handling
- lect16 (140514) 0:10: Drivers are re-entrant
- lect16 (140514) Read up on the various I/O buffering in Tanenbaum
- lect17 (140520) Why favour I/O bound processes over CPU-bound processes?
- lect17 (140520) 00:31 Traditional UNIX scheduler (how priorities self-adjust with clock ticks etc.)
- lect17 (140520) 00:48 (Slide 62) Formula for scheduling
- lect17 (140520) 1:48 Why exactly do we favour Rate Monotonic scheduling other than that it is easier to implement (why is it easier to implement?)
- lect18 (Slide 12) What is the per-CPU private memory used for exactly?
- lect18 (140521) 0:19 (Slide 26) Why do we get better cache locality with symmetric multiprocessors?
- lect18 (140521) 0:40 (Slide 42) Cache lines?
- lect18 (140528) MCS Lock aquire and release functions. http://www.quora.com/How-does-an-MCS-lock-work
- lect18 (140528) 0:45 How longer blocking-locks are implemented with shorter spin-locks.
- lect18 (140528) 0:52 Surround the scheduler's shared resource (queue) with spinning lock rather than blocking lock. Why not blocking lock?
Last active
August 29, 2015 14:02
-
-
Save ltiao/919d9f2a4b6972c73a6f to your computer and use it in GitHub Desktop.
Sign up for free
to join this conversation on GitHub.
Already have an account?
Sign in to comment