In the code below, three processes are competing for six resources labeled A to F.

a. Using a resource allocation graph, show the possibility of a deadlock in this implementation.

b. Modify the order of some of the get requests to prevent the possibility of any deadlock. You cannot move requests across procedures, only change the order inside each procedure. Use a resource allocation graph to justify your answer.

Transcribed Image Text:

void P0 () void P1 () void P2 () while (true) while (true) ( while (true) get (A) get (B) get (C) // critical region: // use A, B, C release (A) release (B) release (C); get (D) get (E) get (B) // critical region: // use D, E, B release (D) release (E) release (B) get (C) get (F)i get (D) // critical region: // use C, F, D release (C); release (F) release (D)