Computer Science 322 Operating Systems Mount Holyoke College Spring 2008

Agenda

• Announcements
  • special office hours tonight: 6:30-8:30 or so
• Term project out
• Deadlock
  • Deadlock prevention
  • Deadlock avoidance
    • augmented resource allocation graphs
    • Banker's Algorithm
  • Detection and recovery

Lecture Assignment

Due at the start of class, Wednesday, April 2.

Turn in short answers to these questions. 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 7.1
• A system has two processes and three identical resources. Each process needs a maximum of two resources. Is deadlock possible? Why or why not?
• SG&G 7.11