Second Chance Algorithm - Page Replacement - Operating System
HTML-код
- Опубликовано: 8 сен 2024
- In this video, we learn the second chance algorithm for page replacement.
C programming series: • Introduction to Pointe...
C++ programming series: • Reference in C++ (Epis...
Great teacher. Clear, concise and with enthusiasm. What a blessing; rare to find even decent teachers around anymore.
You, sir, gave *me* a second chance to actually learn this so I can properly implement it in my program. Thanks a ton!
Great lecture sir, you literally save me around 35 mins of online lectures.
good thing i've found this! i hope it helps me on OS exam :(
I hope it did, I got an OS program about this that I still need to finish lol!
Very detailed analysis. Thanks for the lesson on second chance (clock) algorithm.
Im from Mexico, you have amazing skills for tech, thank you very much , i watch a lot of videos, and yours it the only one that i understand at 100%
Muchisimas Gracias, es muy amable por ti parte!
always the old videos with good content
Best explanation of second chance on RUclips! Glad I found you 😩
Perfect understanding so i appreciate and u r good teacher for the nation
Thank you so much for a great video!
There is an error here after 5:05. When Page 4 is to be brought into memory, the pointer that acts as head of round-robin replacement(i.e. from where we start the replacement Algo) points at Page 1 and hence, the reference bit of Page 2 will not be changed since Page 1 will be replaced immediately!
Refer : www.mathcs.emory.edu/~cheung/Courses/355/Syllabus/9-virtual-mem/SC-replace.html
Saman Singh r u sure???
Thanks a lot Sir. You explained it better than our reference book's explanation.
Awesome explanation
awesome description .. and thanks for saving me for my mid sem exam
I think there is a big mistake. When R of B is 1 and you reset it to 0, then you have to move B to the tail of the list (see Book of Tanenbaum Page 212)
Thank you that helped me out a lot. Very straightforward and comprehensive.
Very clear explanation, good use of visuals. Thank you for this video!
Perfectly explained! Thank you!
very good explanation
Well put. The words at the bottom helped a lot as well. Thank you for a clean video.#allTheWayFromTexas
thanks man! Still a chance to pass my OS exam. :D
You are the best teacher !!
Thank you very much, this helped me clear my doubts.
What happens when all the candidates have their reference bits set to 1?
For example :
Input - 1 2 3 4 4 3 2 1 5
Frame size - 4
@raj sharma and set all the ref bits to 0, right?
All the reference bits get set to 0. Then FIFO applied. In your example, 1 will be replaced.
xbr 10 sir ,,,, help me alot ,, thanks alot from pakistan ,,,,
Explain very well but I found you funny haha
Best explanation ever .
Wishing this guy was my professor instead
Great explanation with a great example
Thank you sir you saved my time
@BBaters ,in 3'rd last table , search will start from old to new (since it is arranged in FIFO) and among 4,5,and 3 (in previous table) 4 is oldest .search will stop at 4 only.and 5 's R bit will remain 1.
very clear to understand
Thanks teacher
Thank you very much
why the ninth page 5's reference bit is still set to 1 ? 2 is already set to 3 , doesn't set the 5's reference bit to 0? sorry about my poor language
陳奕甫 幹認真喔
because we didn't need to apply the second chance property we used normal FIFO
Why Indians explain so good......?
thanks for this lesson, it's very useful for me in the exam
U explained perfectly, thanks.
Thank you. It was very helpful
very nice explanation!!!
Thank you
great teaching, thank you
great video! thanks for the help
Thanks! Helped a lot!
This was so helpful. Thank you.
Nice work, concise, easy to understand! Thank you, as an American I appreciate how well you explain and how clear your english is :)
spacchi come la merda ...you saved my life dude ... india rulz
Only INDIAN accent :) very helpful video Thanks
Thank you! Great explanation
good explanation!.. cheers
thank you sir its a very good lecture.
thaks very much i am understand this easy
please make playlist for separate video lecture it's awesome
awesome work!!!!!!!!!!!!!11
Helpful lecture.
Thanks apu
thaanks you are the best!!
Cheers Bud!
My prof taught us to set the bit as 1 initially while inserting ,if I follow that way the sequence isn't same
will the reference bit become 2 or more?
thank you vally much
The indian accent make it that much better
Thank you 💓
well explained, thank you
Awesome.
I LOVE YOUR VOICE
Thank£
thanks bro...helped me alot
i can say it z one of the bst video in replacmnts..
thankx a lot sir
Good job
very helpful
A big mistake, When a page gets a second chance, its reference bit is cleared, and
its arrival time is reset to the current time.
Due to this page it is not:
www.mathcs.emory.edu/~cheung/Courses/355/Syllabus/9-virtual-mem/SC-replace.html
Look at the 12th and 14th point starting from the beginning.
To my lecture notes what lochu'an says it's right. A page who gets a second chance won't be replace till all other pages have been replaced or given a second chance . This is due to fifo
I think, he did the same. Didn't he? Page 2 had it's reference bit as 1. It was given a second chance when 5 had to be brought in. 5 was brought in, in place of 3. The reference bit of page 2 was made as 0. Did he not do it at a later point of the problem for a different instance?
@@shivajibalijepalli565 It is Fifo order and the get a set in fifo order. When they get second chance bit is cleared and page arrival time is set to current time.
yousri mami frame 5 is still there because, its reference bit is set to 1....when a frame's reference bit is set to 1, it doesn't get replaced instead its given one more chance at the expense of setting its reference bit to 0 making it eligible for replacement next time.
but when 3 gets added at 7:24 all the reference bit should be set to 0......but u have set reference bit of 5 to 1......please explain.....
Does *all* of them get reset?
Is this a 1 bit value (value between 1 and 0) ?
reference bit of 5 when 3 comes in the (9th number) should be set to 0,since there was a page fault.
I don't believe that's the case since 5 is not the number that is going to be replaced. Since 2 was the first number in, 2 is going to be replaced so 5 and its reference bit is not affected
I suggest to make ur accent clear.. btw ur the best explanator hahaha!
very nice explanation which is not given in to few good books.
So the reference bit is set to 1 only when there is page hit . ? if there suppose 5 got second chance and after that we have to replace another bit which is completely new and not in the frame. So we go through FIFO in that or which page will get a second chance
When the first "4" comes, why did you bother "2" and check the reference bit ("2" was the "last" in)?
tnq sir ji
thanks bro........
Nice video, but what if we have a modified bit also?
mamalis is love. mamalis is life.
thanks mate :)
thnks!
What if same page is referenced twice? will the reference bit remain 1?
same thing I am wondering
my teacher says when a new frame is entered the ref bit is set to one what kind of variation is that if it is right
anyone. why the reference bit again set 1 for 5 in second line B/C there is page fault (2 replace with 3). so we need to change the reference bit of 5 to 0??????? please any one .. so confuse...
Helpfull :)
The audio quality 🥲
❤️❤️❤️
at second 7:27/9:45, why frame 5 still have 1? thank you
guys there is a mistake at ruclips.net/video/voiL2-nQmlU/видео.html because we put 2 to end of queue so its refererence bit must be still 1 not 0
What if all pages have 1 as a reference bit ? Please answer
in fifth and sixth iteration .....what if we have 3 and 3 instead of 5 and 2?
sir you have done a small mistake when 9 th page replacement when 4 will came then 3 will be out bcz 3 is the oldest not 4.
In the 7:06th minute reference bit for 5 should have changed to 1 right ? after replacing 2 with 3 in first row. Please confirm
Yes. So totally 8 page faults occur right?
thank you sir !!!
no problem man its pleasure :)
The "1stPC LAB TROL" is everywhere... :D
Lru approximation is same as sca?
osam
If I didn't miss something, no explanation how to know which page is older than those whose look is marked with 0