I have this assignment question but I am a bit unsure how to go about answering it. The question is as follows and accompanied by the image below:
Three processes are competing for six resources labelled A to F as shown below.
Using a resource allocation graph, show the possibility of a deadlock in the implementation above.
I know how to do the graph but what I am struggling to understand is, do I take the
Release(); methods into consideration or only the
Get(); methods. And also, would
P0() access resources A, B and C first or will each process run simultaneously meaning
P0() access resource A,
P1() access resource D and
P2() access resource C, and then the second set of
Get() methods are requested simultaneously? Lastly it does not specify how many instances (dots) are in each resource, is there any indication as to how to determine/go about working with this? As soon as I can clear up these misunderstandings I can draw the diagram