Question

a. A system has two processes and three identical resources. Each process needs a maximum of two resources. Is deadlock possible? Explain your answer. b. A system has 4 processes, P1 through P4, and 5 types of resources, R1 through R5. Existing resource vector E = (3, 2, 1, 2, 2) Current allocation matrix C = R1 R2 R3 R4 R5 P1 1 1 0 0 0 P2 0 0 1 0 0 P2 1 0 0 20 P4 0 1 0 0 1 Request matrix R = R1 R2 R3 R4 R5 P1 0 0 1 1 0 P2 0 1 0 0 0 P2 0 0 0 0 1 P4 0 0 1 0 0 • What is the initial value of the available resource vector A? Use the deadlock detection with multiple resources algorithm to determine if this system is deadlocked or not. Show the order in which processes can get the resources they need to finish. Show the value of the available resource vector A after each process is marked (after each process finishes). • If the system is deadlocked, indicate which processes are involved in the deadlock.

Answer 1

@ No Deadlock if not possible. Ex Concidre a scenario where the 2 processes needs maximum de sources (given in question that Each process need a maximum of a resources). P 2 P 2 Available resources → Consides we have allocated 2/3 resources to P and 3 resource to Per - As P, has all the resources it needs after some tune it completes ets task and releases the & resources artigned to it. Now we can take 1/2 resource and assign to B b) Given E = 13,2,1,2,2) M - 0 0 - -66- Talat Total - Hallocated

E-c Avadable vector a 12, 23, 2, 1) - (3, 2, 1, 212) - (2,2 R. R₂ R₂ Ru Rr (1, 0, 0, 0,1) = Request matrix R. R/ R / R3 R4 R5] P. Es requesting o instances of instance of R₂ but we don't have Ra as fue so we can not serve it now P es requesting instance of R₂ but we have te honetan of Ren, so we can not serve it - ez es requesting instance of Rs and we have I free ustance of Rs. we can save it. af we serve P ool Available vector A will be (1,0,0,0,0). after some time Po will release all the resources, allocated to at. Now the available vector A