Disadvantages of Semaphores

[@anshrohatgi8602]

stundent starvation for os ends here , indeed such aa gemmm 🙌🙌🙌🙌🙌🙌🙌🙌🙌🙌🙌🙌🙌🙌🙌🙌🙌🙌🙌🙌

[@LavanayaMalhotra-k1m]

00:07 Disadvantage: Busy Waiting in Semaphores 01:31 Busy waiting in semaphores wastes CPU cycles 02:46 Modifying weight and signal operations to overcome busy waiting 04:06 Blocking a process prevents it from busy waiting 05:27 Implementing semaphores with waiting queue can lead to deadlocks and starvation. 06:50 Deadlock can occur when using semaphores. 08:13 Concurrency issues with semaphore usage 09:40 Semaphores can lead to deadlocks Crafted by Merlin AI.

[@nightcrawler4293]

1- Semaphores belongs to the non-active waiting solutions for synchronization . passive waiting solutions : semaphores , locks , cs , monitor . 2 - the solution you discussed , we took it in college as the semaphore form directly .

[@findynx]

l enjoyed the tutorial, so insightful and well presented. Thank you!!

[@kwakuboateng7525]

Wowww. Lovely teachings. Do you have a website where I can learn more?. Very well done!! :)

[@VivekRaj-kk5jb]

Please unlock rest of the chapters like deadlock, virtual memory etc. so that we can complete the course.

[@nesoacademy]

Hi, you can access them on our website/app after getting the Neso Fuel.

[@PradeepYadav-fg2yg]

@@nesoacademy what is neso fuel

[@josephjoy7080]

@@PradeepYadav-fg2yg its a subscription$ , i would subscribe if i was you. his OS videos are the best and the prices are really cheap compared to other!

[@nikunjhemani7093]

@@josephjoy7080 neso ka broker😂😂😂

[@sharondjongo9470]

Merci beaucoup.

[@c.d.premkumar6867]

It is not "need for busy wIting" it should be "overcome the problem of busy waiting".

[@rahulshaw7457]

Nice sir❣️❣️❣️❣️

[@keremaksoy8007]

I think the deadlock is not about only the semaphores with waiting quaes. It can also happens with binary semaphores if we implement them in a same way like in the video, am I right ?

[@kerematasen399]

I guess so.

[@adolfocarrillo248]

No, deadlock can not happen in a binary semaphore, a binary semaphore is like a mutual exclusion algorithm.

[@NisargaChowdaiah]

No, bcz binary semaphores only for 2 processes

[@AbhishekKumar-kk6qs]

This busy waiting for all solution you discussed all have this busy waiting.

[@MeabuOP]

thats what i think

[@unmandarinoalgiorno...9321]

@@MeabuOP Indeed i didn't understand the waiting-queue solution to resolve busy waiting problem. It seems to me that the busy waiting exists always.

[@samibouguerra3154]

@@unmandarinoalgiorno...9321 when its on busy waiting it drains the cpu and that happens when its on the while loop , now when it blocks itself by entering a waiting queue its not on the while loop so it doesnt drain cpu thats what he explained

[@venkataswamykadiyam977]

Please upload atleast 2 videos for a day sir

[@mdminhazulislamroyel2709]

End on ONE NIGHT RUN

[@Sparkler210]

Deadlock: Resource1 Assigned to Waiting for Process1 Process2 Waiting for assigned to Resource2

[@clv603]

CPU scheduler: I'm just doing my job

[@narimanvatankhah1269]

[@mudassarsiddiqui4112]

👍👍

[@udbhavvikramsingh3449]

I didn't understand what is two semaphore S & Q means here Why process need two semaphore 🤔🤔🤔🤔

[@shaziasamreen8584]

Each resources has its own semaphore. So think it as P0 is first trying for resource S and P1 is trying for Resource Q.After they get them P0 will wait for Resource Q which is acquired by P1 and P1 will wait for resource S which is acquired by P0 which is a deadlock condition.Hope this helps.Correct me of I am wrong

[@chandran-youtube]

@@shaziasamreen8584 cool

[@MeabuOP]

@@shaziasamreen8584 nice