(FIFO) First-in, First-out page replacement

Sdílet
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...

Komentáře • 25

  • @eher12na22
    @eher12na22 Před 7 lety +91

    Thank god I found someone in English!!

    • @hello_world_0
      @hello_world_0 Před 7 lety +18

      In PROPER CLEAN English, hell yea !!

    • @Shradheya15
      @Shradheya15 Před 7 lety +1

      i learnt it first in tech support english XD but yeah this helps :D

    • @brightontendekai8743
      @brightontendekai8743 Před 6 lety +7

      Maybe google should make a separate youtube for guys who don't use english

    • @gnarkill32
      @gnarkill32 Před 6 lety

      Please

    • @gnarkill32
      @gnarkill32 Před 6 lety +4

      Best English i have ever heard.

  • @NinjaOG1
    @NinjaOG1 Před 3 měsíci +3

    I swear i been on this for 3h now and you explained it with 1 minute FUCKING FINALLY!

  • @denizerdemozkan
    @denizerdemozkan Před měsícem

    Thank you so much for giving extra attention to the difference between LRU and FIFO.

  • @jfkdujgujmc5jtrppdlwkscsce709
    @jfkdujgujmc5jtrppdlwkscsce709 Před 7 měsíci +1

    it's the end of 2023 and this video is the best, big thumbs up!

  • @boithlomolomotloung9455
    @boithlomolomotloung9455 Před 3 lety +2

    yhoo finally I understand FIFO... 💯

  • @ajinkyaparaskar7543
    @ajinkyaparaskar7543 Před 5 lety +1

    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

  • @Dramatically__Yours
    @Dramatically__Yours Před 6 měsíci

    Thank you for this video ❤

  • @tula1308
    @tula1308 Před rokem +2

    Finally I found an English video

  • @yobinauq
    @yobinauq Před dnem

    Thankkk youu alot my Guy. Fcking Savoir right there!

  • @chiengdorkcy4851
    @chiengdorkcy4851 Před 3 lety +1

    thanks bro

  • @samirvzw
    @samirvzw Před 7 lety +3

    amazing video, I had this exact situation and the video saved me! go usa

  • @nullpointer8553
    @nullpointer8553 Před rokem +6

    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 -> ...

    • @dvoraklovelace2801
      @dvoraklovelace2801 Před 10 měsíci

      He skip them because 3 and 2 don't produce page fault

    • @Astronomy.532lifenspace
      @Astronomy.532lifenspace Před 4 měsíci

      ​@dvoraklovelace2801 can you pliz explain

    • @fahtongfah
      @fahtongfah Před 4 měsíci

      @@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

  • @furkansarmehmet9568
    @furkansarmehmet9568 Před 7 měsíci +1

    hard