Peterson’s Solution
Вставка
- Опубліковано 8 сер 2024
- Operating System: Peterson’s Solution
Topics discussed:
1. Peterson’s solution to The Critical-Section Problem.
Follow Neso Academy on Instagram: @nesoacademy (bit.ly/2XP63OE)
Follow me on Instagram: @jaiz_itech (bit.ly/2M3xyOa)
Contribute: www.nesoacademy.org/donate
Memberships: bit.ly/2U7YSPI
Books: www.nesoacademy.org/recommend...
Website ► www.nesoacademy.org/
Forum ► forum.nesoacademy.org/
Facebook ► goo.gl/Nt0PmB
Twitter ► / nesoacademy
Music:
Axol x Alex Skrindo - You [NCS Release]
#OperatingSystemByNeso #OperatingSystem #ProcessSynchronization #PetersonsSolution
I am doing a paid course and I couldn't understand their explanation so I came here and wow this explanation is soo better xD .. Neso academy rocks!!
what is the course for? Can u share it?
yes. same qn
@@mArjunyadav doesn't matter
Neso academy has far good content for a free cost..
We like everything free if it is available anywhere..
@@anonymousguy9263 Lol no bro it ain't free, you gotta pay for the chapters further
@@ChaitanyaRacharla yes ı know and ı paıd for ıt..
It ıs very nominal..
Hands down the best explanation of Peter's Solution. The concept of 'humbly giving the other turn' made it much more clear.
Your videos are amazingly simple and easy to understand and most importantly your humble variable 😀 first of its own kind man!!
Peterson's solution be like - "Pehle aap jaiye, nhi nhi pehle aap, " 😅😂
😂🎁
The best lecture on Peterson's solution that I have watched till now 🔥
Thank you I understand it clearly now, the key is to draw the two processes and trace the instructions
These videos are excellent. I like to watch these first and then glide through the textbook after.
I think the while loop is supposed to be while(flag[j] && turn=j); instead of turn=[j] since j is an int, not an array. but anyway, I agree with everyone! you're videos have helped me so much!!
thank you so much for this video, I could not understand my textbook at all. you explained this so clearly, I understood it right away!
well explained, made me pass my exam. thank you so much for the great content.
best tutorials..loved watching them...extremely helpful.
The explanation is simply fabulous
Thankyou Very much
Clear and lucid Explanation
Able to understand easily..😊
Very well explanation, easy to understand
Thank you Neso Academy for the amazing explanation ❤️
I was sceptic about watching this video due to its length. However, very good and thorough explanation.
I came up with this real life example when both processes want to enter their critical section:
1. You and your friend both want to enter a bus.
2. You insist your friend that he/she enters first.
3. But your friend is insisting that you enter first.
4. Not to cause any delay, you enter first.
5. Your friend enters after you.
P.S. Happens to me many times in real life. I want to let people go first and they insist that I go first. So, to not delay any further I go first.
The topics are explained so well.
it's 3:30 am . I've exam at 11 and this video can't be more awesome than it is😎
I'm in the same position dude
@@radaefilms3150 hold on 😂
@@SonuGupta-wj6dg lol guess who join the squad :"")
bois you forgot about me
@@heutras 😂😂😂 na were in this together how'd ur exam go
So well explained 👏👏
Really awesome class thank you so much sir for this good class 🙏😊
Very much satisfied with the answer. Thanks for the flawless explanation.
I was literally waiting for this....thank you so much
Thank you so much for the informative video!
the best video i've ever watched about peterson's solution. i think you used feynman technique in a good way :)
the explanation!!! truly amazing
Thank you for the OS save! Could not understand this via the textbook.
Best explanation ❤. Thank you sir
This is so well made, ty so much. I understood it perfectly
Thanks,the explanation of semicolon after while helps me a lot
Most clear explanation of Peterson solution ,Thanks for the video👍👍
Your explanation is very good sir❤ & it's very much helpful
its the best explaination ...to the exceution ..thank u so much
Thanks a lot for the clear explanation
Awesome explanation sir.
Thank you ❤ for the beautiful lecture
Very helpful, thank you.
Very clear, thank u
Well explanation sir... really you are God gifted one❤️
WOWWWW, what can i say... This is hands down the absolute best explanation of Peterson's Solution!!! My book was def not enough to get it, and I just didn't even try to understand it, but with ur video, I feel like I understood all of the algorithm!
Nicely explained 💯🙏🏻❤️
Excellent explanation
Thank you so much. Well explained.
Well Explained. Thanks a lot!
Thank you so much
amazing explanation sir
Thankyou so much...
Thank you so much for this video. It's amazing how bad college professors can be at explaining something
Thank you very much
Your teaching is next level
awesome explanation !!
Thankyou so much sir
this was the best video on Peerson's Solution. Thanks man
Thank you very much 🙏
tq soooooooooooooooooooooooooooooooooooooooooooooooooooo much you helped me lot
Really helpful thanks bro
Thank you sir!!
Awesome Explanation
tré tré bonne explication😍😍
JazakAllah😇
Thank you sir
Sir upload the video of control system
Awesome explaination..
beautiful, thank you!
thanks
tks alot
what a clear explanation
Thanks ❣️
Thank You
Thanks ❤❤
Thank you!
💫💫✨✨Better explnation than our college🔥🔥🔥🔥🔥🔥
well explained👍👍👍
Will neso academy upload electrical machines topic?
you are amazing sir really . thank you soo much. you deserve to be honoured by best teacher of india. i really want to recommend for this honour . thank you
💜💜
thanks man !
but how can i know who is the last one to modify the turn variable? (who will be the first one to enter the critical section)
does the processor just choose one of them randomly?
holy this is amazing, THANKS ALOT
well explained !
Allah sizden razı olsun
omg finally i understand, thx neso
Thank you for making me understand ! Even in Korea, I'm watching this ~~ ;)
you guys are life savers😭😭
Wonder explanation...
Best explanation than the book 😍
thanks a lot ❤
when Pi writes its flag value it is possible that Pj could also be attempting to read from that value in that instant of execution if Pi's write is not atomic then could'nt this cause another race condition on Pi's flag value such that Pj reads
a half written/corrupt value
Just amazing one
thank you so muchhhhh
OMG I understood it! Thank you!
Can you please explain why the solution doesn't work on modern computer architectures?
I prefer "interested" instead of "flag"
I want to ask that how can you make sure the updation of variable flag[] and turn is synchronized? If they are not been synchronized, this solution doesn't work right? Anyone can explain this?
Thank you, well-explained!
Be humble! 😅
Mind blowing!!!!
bestest explanation ever on youtube🤩
From 12:42 watch for detail explanation ~~~🫶🔥🔥
Superb
really awesomeee...
Is it use ful Msc CS students
so great