(FIFO) First-in, First-out page replacement
Vložit
- čas přidán 23. 11. 2016
- Computer Science -Operating systems
Algorithm for paging when virtual memory management is required. This is an inefficient algorithm that would not be used in practice but is presented at university for proof of concept.
You might also want to check out:
Banker's Algorithm explained • Banker's Algorithm exp...
Optimal Page Replacement • Optimal Page Replaceme...
Thank god I found someone in English!!
In PROPER CLEAN English, hell yea !!
i learnt it first in tech support english XD but yeah this helps :D
Maybe google should make a separate youtube for guys who don't use english
Please
Best English i have ever heard.
I swear i been on this for 3h now and you explained it with 1 minute FUCKING FINALLY!
Thank you so much for giving extra attention to the difference between LRU and FIFO.
it's the end of 2023 and this video is the best, big thumbs up!
yhoo finally I understand FIFO... 💯
Post a video for LRU. Also explain the code for the following algorithm if that's possible like for banker's there should have been a code explained accordingly
Thank you for this video ❤
Finally I found an English video
racist.
Thankkk youu alot my Guy. Fcking Savoir right there!
thanks bro
amazing video, I had this exact situation and the video saved me! go usa
At 3:17 why did you skip 3 and 2?
At that point 2 was the longest standing so it should be replaced with 3. so it's 0|3|3 -> 0|3|2 -> ...
He skip them because 3 and 2 don't produce page fault
@dvoraklovelace2801 can you pliz explain
@@Astronomy.532lifenspace hi, i understand it as, the page frame 3:17 currently holds [0|3|2]. once you encounter 3 and 2 in the reference string, it counts as a "page hit" since those are in the page table. since they "hit", they do not page fault. part of the reference string will only page fault when it is not contained in the page frame.
hence, at 3:22, when he encounters 1 in the reference string, he inserts it into the page frame, as it is new and was NOT in the page frame before the specified timestamp.
i think that is correct - hope that helps!
EDIT: corrected some terminology that wasnt consistent
hard
No it was easy