Outline for April 28, 2008

Reading: Text, §4.4, 5

1. Greetings and felicitations!
2. External Priority Methods
   1. Worst service next
   2. Response ratio guarantee
   3. Deadline scheduling
   4. Fair-share scheduling
3. Memory Management
   1. How programs interact with memory
   2. Compilers, assemblers, linkers, loaders
   3. Absolute addressing and the execution cycle
4. Hardware
   1. Bare machine
   2. Resident monitors and fence addresses
   3. Implementing fence addresses
5. Relocation
   1. When to bind program addresses to absolute addresses
   2. Loading process into memory
   3. Dynamic relocation
   to be continued