Deadlock due Thu 07 Mar 13:20

• Exercise 6.11
• Exercise 6.12; as part of your answer define the term ``spinlock''
• Exercise 6.13
• Exercise 6.44; there is no need to actually implement your solution ... it is fine to express your answer using pseudocode similar to that which was provided in a handout.

In addition answer the following questions:

1. Dijkstra's Banker's Algorithm has a number of weaknesses that preclude its effective use in real systems. Comment on why each of the following restrictions may be considered a weakness in the Banker's Algorithm.¹
   1. The number of resources to be allocated remains fixed.
   2. Processes guarantee that they will return held resources within a finite amount of time.
   3. Processes must state maximum resource needs in advance.

2. Suppose an OS has 5 processes (, ... ). There are also 4 shared, non-preemptible resources (, ... ) in quantities of 3, 2, 2, and 2, respectively. Suppose the current state of the OS is as follows:

   Process	Has	Wants
   	1	1
   	1 ; 1	1
   	1	1
   	1 ; 2 's	2 's
   	1	1

   1. Represent this state as a resource graph.
   2. Reduce the graph to determine whether or not deadlock exists. If so, determine which processes and resources are involved in the deadlock.

Your paper should include your name, the due date, and a list of the exercise numbers assigned. Each answer should be labeled clearly with the exercise number.

Footnotes

... Algorithm.¹

This question taken from Operating Systems, 3rd ed., Deitel, et al., p. 326.