If bankers algo doesnt know process-interdependencies, how can it always prevent deadlocks?
Assume we have 5 of some resource, and process A needs a max of 3 of them, and process B also needs a max of 3 of them. Let’s assume that process B can’t finish until A finishes.
**
tldr; B is dependent on A to finish, but the algorithm seems to assume that B can always finish no problem once it obtains its max number of resources.
If bankers algo doesnt know process-interdependencies, how can it always prevent deadlocks?
Assume we have 5 of some resource, and process A needs a max of 3 of them, and process B also needs a max of 3 of them. Let’s assume that process B can’t finish until A finishes.
**
tldr; B is dependent on A to finish, but the algorithm seems to assume that B can always finish no problem once it obtains its max number of resources.
If bankers algo doesnt know process-interdependencies, how can it always prevent deadlocks?
Assume we have 5 of some resource, and process A needs a max of 3 of them, and process B also needs a max of 3 of them. Let’s assume that process B can’t finish until A finishes.
**
tldr; B is dependent on A to finish, but the algorithm seems to assume that B can always finish no problem once it obtains its max number of resources.