Resource Allocation Graph

Resource Allocation Graph
watch more videos at
www.tutorialspoint.com/videot...
Lecture By: Mr. Arnab Chakraborty, Tutorials Point India Private Limited

[@TutorialsPoint_]

Get Certification in Complete Operating System: www.tutorialspoint.com/operating_system/index.asp
Use coupon ""RUclips12"" to get “FLAT 12%’’ OFF at Checkout.

[@LMSStanley]

Thanks so much for this explanation in 8 minutes , 100x better then how my lecturer explained it

[@joshuavanvelzen965]

Absolutely brilliant. Thank you so much. You saved me of 50 marks for an assignment.

[@Hotel-20]

about to write an OS and Architecture exam and this video has saved me. thank you! 😂🙏🏾

[@W9cC.nzKc5gexo-4npqy35mu_TYcK]

Absolutely amazing... understood at once.. thank you sir..

[@San_Jan_]

It was very easy to understand .Good Lecture.

[@123puccazinha]

Finally understood that ! Great teacher, thank you

[@clancastle3511]

Best one. Thanks a lot. Watching the video right before my os exam.

[@saram1403]

I finally understood. Thank you, sir!

[@abdulahihamuud5273]

Idont know how thank u but promise that i'll view your every video n like it when ever isee it tnkxxxxxxx
Saved me from my finall exam

[@md.muradhossain9748]

Goood lecture , Sir easily representation and helpful tutorial, Thanks a Lot , Sir

[@SalmanQadeer]

Nicely done, sir! love from Pakistan! liked and subscribed.

[@firnasmohamed8547]

Thanks for your deeply explanation 👍 i understood about resource allocation graph in deadlock

[@bg7370]

The only Indian whose tutorial videos I watch

[@yingzhenglee4204]

Thank you for posting this videos sir, appreciate the effort that goes into making this playlist! One question though, both the 2nd and 3rd graphs are similar in that they have processes that are holding and waiting on resources, thus forming a cycle, but the difference between them is the number of resource instances available. So because the number of resource instances at any one of the R nodes in the 3rd graph is equals to or more than the number of edges, whether incoming or outgoing, the processes and resources are able to resolve with one another to finish all the processes. but in Node R3 of the 2nd graph, its number of instances (as shown by the 2 dots) is less than the total number of incoming and outgoing (total 3) edges, therefore unable to resolve the resources to their respective processes and a deadlock occurs. So to put it simply, the holding and waiting that forms a cycle may imply the occurrence of a deadlock, but the key factor here is that the number of instances of R3 in the 2nd graph cannot meet the request + allocation (supply + demand) of the 3 processes, hence the deadlock occurs

[@sanjeev4103]

Thank you sir ur lecturing is super...!

[@kalyan455]

thank you for providing the knowledge it was an easy understanding

[@nirmalpandey600]

wow understand everything!!! It's great!!!!

[@mahatma2147]

thanks to u for making these videos for us💥

[@mdshamimsarker739]

thank u sir..........
Absolutely you are brilliant.......

[@md.mostafizurrahman254]

Excellent description sir :)

[@ankitjain7698]

Nice lecture sir thanks a lot

[@md.mahbubulislam6220]

thanks a lot sir. it was very easy to understand

[@kartiksharma2131]

Good explanation
Good job

[@_MilonPaul]

Tank you sir for Nice lecture

[@kasunhasanga1595]

Nice and short explain ❤❤

[@KuldeepSingh-og2pj]

Amazing skills sir

[@engineeringschool1992]

excellent lecture

[@jasleensabharwal5654]

very good explaination

[@amethyst-01]

Is there a playlist for database management, if yes I'll like to have the link

[@nickichandan7761]

awesome 👍

[@lynnm2962]

Other RUclipsrs wanted me to watch for 30 mins to learn this

[@srisaiprakashiragavarapu9623]

Thanku very much sir....

[@statusshortz2269]

Thank you sir nice explanation sir

[@innosphere1905]

Amazing

[@SenseiBuni]

Thank you very much sir

[@xyz5354]

Thank u so much 😍

[@Shiva-zy7jq]

Nice lecture sir

[@aniruddhadas1778]

Best at its length

[@michaelneftali8711]

Thank you so much sir. My exams is today

[@UdayKumar-ny5ed]

Super sir

[@gossipgirls960]

👏👏👏

[@rebeccabecky2010]

thank u sir

[@HuzaifaShahbaz786]

In a computer you have 5 processors (P), 2 memory cards (MC), 4 drives (D) and 3 modems
(M). You have four processes (C++ compiler, word file, power point, chrome)
Processes Allocated Max Need(Claim)
P,MC,D,M P,MC,D,M
C++ compiler 2,0,1,1 3,1,1,1
Word file 0,1,0,0 0,2,1,2
Power point 1,0,1,1 3,1,1,1
Chrome 1,1,0,1 1,1,1,1
a) Draw Resource Allocation Graph (RAG) for the given scenario. can you me help how to solve this question

[@TamilPublicNews]

Yes I got the logic

[@kiche_allan]

Thanks

[@michaelkaufman5119]

If each process/ thread node in a graph has a cycle then the graph is in deadlock. VE + E^2

[@padminikalburagi1783]

If there is no cycle then no deadlocks if there is a cycle deadlocks may be present or may not...Tq sir😊

[@balunani8328]

Tq sir

[@rishabhdube5936]

Beneficial

[@kakashisenpai99]

Bengali baba

[@saifullahkhan6710]

Thank you sir

[@anjaliyadav8701]

Thank you sir