So we have the following table of processes , where A, B and $\Gamma$ are the resources.Here is a pic that i drew with the processes and the resources.So the exact question is this: Using banker's algorithm, calculate the minimum values of $x$ and $y$ in order the system is Deadlock free.I have done pretty much huge paper work and found that $x,y$ should be the numbers 2 and 3. But in order to find this I run the algorithm on paper several times ; for $[x,y] = [0,0],[0,1],[1,0],[1,1],[1,2]$ etc. until I found that for pair $[x=2, y=3]$ the system is deadlock free!So, I think that I am missing the point. All this took me like 1 hour or so. Is there a simple method with less paperwork? Thanks a lot in advance!
Banker's Algorithm and deadlocks
algorithms;reference request;concurrency