EASY-HOW-TO Page Replacement Algorithm (FIFO, Optimal, and LRU) Tutorial (Manual)

Sdílet
Vložit
  • čas přidán 23. 03. 2021
  • In this video tutorial, you will learn how to:
    1. Apply First-In-First-Out (FIFO), Optimal, and Least Recently Used (LRU) Page Replacement Algorithms in a given reference string and the number of page frames to be used to show the page frame contents every time there occurs a page fault.
    2. Derive the total number of page faults per page replacement algorithm.
    3. Apply the shortcut method for FIFO, Optimal, and LRU Page Replacement Algorithm to derive the number of page faults faster.
    4. Choose the best page replacement algorithm to be used in a given reference string and the number of page frames context.

Komentáře • 26

  • @xGiraffecookie
    @xGiraffecookie Před rokem +1

    Thank you so much, you went into more detail than my professor and I understand FIFO completely now. :)

    • @BlancaflorArada
      @BlancaflorArada  Před rokem

      You're very welcome! 🥰 Of course, this is a technical concept in Operating Systems. It is a must that we must explain the concept in the simplest way possible so that our students can understand. God Bless!

  • @laminsanneh350
    @laminsanneh350 Před 2 lety +4

    This is wonderful. Thank you so much for the assistance.

    • @BlancaflorArada
      @BlancaflorArada  Před 2 lety

      You're welcome! I am hoping that my content helped you. 😊

  • @jhosuamostar861
    @jhosuamostar861 Před 2 lety +2

    Thank You maam for an amazing presentation and clear explanation of this. Really saves my day.

    • @BlancaflorArada
      @BlancaflorArada  Před 2 lety

      You're most welcome! 😊 It really fills my heart that you understood the page replacement algorithms because of my material.

  • @amosem_
    @amosem_ Před 2 lety +4

    Great explanation and also nice hand writing

  • @AzureeTech
    @AzureeTech Před rokem +1

    You've really explained it so well, books are bit confusing. Thank You☺

    • @BlancaflorArada
      @BlancaflorArada  Před rokem

      You're very welcome! 🥰 I am really flattered that my content is better than published books made by seasoned professors in Computer Science/IT. God Bless!

  • @ayshaeman8762
    @ayshaeman8762 Před 2 lety +2

    thank you so much for this

  • @JIRONewin
    @JIRONewin Před rokem +1

    best explaination thanks.

    • @BlancaflorArada
      @BlancaflorArada  Před rokem

      You're very welcome! 🥰 I am really glad to hear that it helped you understand the Page Replacement Algorithms. God Bless!

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

    you re the best👍👍👍👍👍👍👍👍👍

  • @ambernicoleforbes79
    @ambernicoleforbes79 Před rokem +1

    Thank you for this great explanation! Optimal equals the least amount of page faults but can you help me understand a scenario where it can be feasibly implemented?

    • @BlancaflorArada
      @BlancaflorArada  Před rokem

      You're very welcome! 🥰 I am really glad to hear that it helped you understand the Page Replacement Algorithms. God Bless!
      For your question, please let me get back and update you about this.

  • @TimeYay
    @TimeYay Před rokem +1

    Thanks!

    • @BlancaflorArada
      @BlancaflorArada  Před rokem

      You're very welcome! 🥰 I hope that you learned something from this lecture. God Bless!

  • @nashatalimohammadalrefaipc7923

    why did you choose 3 frames ??? can I choose another number of frames?

  • @Osman_Harun
    @Osman_Harun Před 5 měsíci

    Thank you very much.

  • @simranray5891
    @simranray5891 Před rokem

    thannnnnkkkkkk youuuuuuuuuu souuuuuuuu muchhhhhhhhhh, honestly

    • @BlancaflorArada
      @BlancaflorArada  Před rokem +1

      You're very welcome! 🥰 I hope that you learned something from this tutorial. God Bless!