Computer Science 322 Operating Systems Mount Holyoke College Spring 2008

Agenda

• Announcements
  • Friday's class meets in Clapp 127
  • Extra office hours, this afternoon 1:30-5
• Lecture assignment recap
• Deadlock wrapup: detection and recovery
• Memory Management
  • Binding time
    • Programming or compile time
    • Load time
    • Execution time
  • Logical vs. Physical Address Space
  • Memory protection
  • Swapping
  • Contiguous allocation
    • Processes are loaded into available chunks
    • Hardware support: base/limit registers
    • Allocation algorithms:
      • first-fit
      • best-fit
      • worst-fit

Lecture Assignment

Due at the start of class, Friday, April 4.

Turn in a short answer to the following question. Please turn in a hard copy (typeset or handwritten are OK). We will discuss these questions during class, so no late submissions are accepted.

SG&G 8.3