Deadlock 2: Deadlock Avoidance with the Banker's Algorithm

Given information about the resource requests each process will make, the Banker's Algorithm can avoid the circular wait condition, and thus avoid deadlock. Much of this material is based on content from the book Operating Systems: Internals and Design Principles by William Stallings.

[shadmaniqbal]

This is a 10-year-old video, yet it helped me understand banker's algorithm better than in class. Thank you for your contribution to the learning community.

[Durhamred]

Your channel Is so great Jacob, thank you for all the content you produce.

[senthamilselvir]

I search so many videos regarding resource allocation denial but you only explain the real concept... thank you so much...

[germansgentleman]

This video helped me to understand the banker‘s algorithm in less then 15 minutes. Well done. Thank you very much! 🙏🏻 My teacher couldn‘t make it in 3 school blocks 😄

[Polo-tgfo]

Been though alot of Deadlock Videos and this is the best video hands down, fully understood everything i did my past paper questions Thank You !!
Need more videos - 2019

[abugslife]

Thank you! Helped me understand deadlock avoidance a little better. Great video :)

[dungKHTNcs]

what a very intuitive video! Thanks so much!

[HappyLocs]

you sir are a mastermind beast, thank you.

[tonnuanhquynh]

Wow, you make it easier than what my professor does.

[samuelmontypython]

One thing no one can explain to me is the "available" vector. Is that something we make up ourselves as a starting point? or is it gained through an equation? Every video i watch magically has "available" resources already thrown up on screen. Textbooks are the same, with no explanation. I'm racking my brain here lol

[drsrsr]

you save my life thank you for the great explanation

[木漏れ日-vn]

I think we should walk through pathological examples:

• dining philosophers
• order-dependent lock acquisition (previous video)

[noushadibrahimkutty]

changing the availability from 2, 3, 6 to 1, 1, 1