The Dining Philosophers Problem

preview_player
Показать описание
Operating System: The Dining Philosophers Problem
Topics discussed:
Classic Problems of Synchronization:
1. The Dining Philosophers Problem.
2. Solution to the Dining Philosophers Problem using Semaphores.
3. Remedies to prevent Deadlocks.

Music:
Axol x Alex Skrindo - You [NCS Release]

#OperatingSystemByNeso #OperatingSystem #ProcessSynchronization #DiningPhilosophersProblem
Рекомендации по теме
Комментарии
Автор

everyone should have their own fork. Using other's fork is not good practice

PythonisLove
Автор

Its really very tough to explain such complicated problems so clearly and also the explanation is so perfect and point to point. Hats

devbhuva
Автор

Three minutes into this video and already like your explanation. Thanks a lot for the content

mdnghbrs
Автор

I wanna be a philosopher, just spend my whole life thinking or eating.

aakashbiju.v
Автор

I owe my CE degree to this channel. THANK YOU!

xsilverx
Автор

At first entered into ur vedio i just switched to another channel but continuously wateching 3minutes i automatically liked ur way of explanation

caamedyyyy
Автор

greatly explained,
No unnecessary code, good theoretical explanation

shivamgupta
Автор

Thanks for the exposition! I thought this is some boring problem computer scientistis made up, but then I realize that 1) there could be a deadlock for naive implementation 2) there are many different ways to address the deadlock 3) different solutions have different pro and cons under different metrics

xigong
Автор

Very Beautifully explained! Thanks, Neso Academy

lalithav
Автор

I think the second remedy was best in a deadlock condition. Because in the first remedy, we are just decreasing the processes and in the last remedy, 1 and 5 sit adjacent but both are odd numbers, so it still creates deadlock as both will pick the left first.

astrovishalthakur
Автор

One of the most Important and famous problem with easiest solution

pranavbakare
Автор

So is it rice or noodles? Forks or chopsticks?

helenmachelen
Автор

why philosopher? why it isn't dining family or friends?

nutislucky
Автор

is one fork not enough to eat noodles??

priyadharzhini
Автор

i don't understand how you can specify the parameters of the problem at the beginning, for over 5 minutes, and then change those parameters at the end. yes, you can allow at most 4 philosophers to sit at the table, but that changes the actual problem you're being asked to solve. if you can reduce the maximum philosophers allowed at the table to solve this problem, then why can't you just increase the maximum forks allowed at the table to solve this problem? how is changing the parameters of the problem to solve it an acceptable solution?

shawazonfire
Автор

Why don't they eat with just one fork? Do they think forks have separation anxiety?

SuyashGaurav
Автор

i like the way Indians talking in English. And, thanks for the explanation.

feritcan
Автор

If I am there in place of philosopher, I would have eaten without even thinking about deadlock 🤣

rohannaidubadarla
Автор

I would like to see the same problem solved with threads. Any plans on making it happen ?

simaobonvalot
Автор

if chopstick[i] is the left chopstick then how chopstick[i+1] is the right chopstick....in @13:18

RohitSamanta-xq
welcome to shbcf.ru