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

Поділитися
Вставка
  • Опубліковано 23 бер 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.

КОМЕНТАРІ • 26

  • @xGiraffecookie
    @xGiraffecookie Рік тому +1

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

    • @BlancaflorArada
      @BlancaflorArada  Рік тому

      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 2 роки тому +4

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

    • @BlancaflorArada
      @BlancaflorArada  2 роки тому

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

  • @AzureeTech
    @AzureeTech Рік тому +1

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

    • @BlancaflorArada
      @BlancaflorArada  Рік тому

      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!

  • @jhosuamostar861
    @jhosuamostar861 2 роки тому +2

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

    • @BlancaflorArada
      @BlancaflorArada  2 роки тому

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

  • @amosem_
    @amosem_ 2 роки тому +4

    Great explanation and also nice hand writing

  • @ayshaeman8762
    @ayshaeman8762 2 роки тому +2

    thank you so much for this

  • @JIRONewin
    @JIRONewin Рік тому +1

    best explaination thanks.

    • @BlancaflorArada
      @BlancaflorArada  Рік тому

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

  • @TimeYay
    @TimeYay Рік тому +1

    Thanks!

    • @BlancaflorArada
      @BlancaflorArada  Рік тому

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

  • @fadabbeyy4865
    @fadabbeyy4865 4 місяці тому

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

  • @ambernicoleforbes79
    @ambernicoleforbes79 Рік тому +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  Рік тому

      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.

  • @nashatalimohammadalrefaipc7923
    @nashatalimohammadalrefaipc7923 7 місяців тому

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

  • @Osman_Harun
    @Osman_Harun 5 місяців тому

    Thank you very much.

  • @simranray5891
    @simranray5891 Рік тому

    thannnnnkkkkkk youuuuuuuuuu souuuuuuuu muchhhhhhhhhh, honestly

    • @BlancaflorArada
      @BlancaflorArada  Рік тому +1

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