1 / 3

Analysis of Page Replacement Algorithms in Demand Paging

This document provides insight into the behavior of various page replacement algorithms such as FIFO, LRU, and MIN in demand paging scenarios. It highlights the fault rates encountered in different sequences of page references, illustrating how each algorithm handles memory management under load. Using example data, the paper discusses the effectiveness and performance of these algorithms, drawing conclusions on when and why certain strategies may be preferable. This analysis can benefit computer science students and professionals interested in operating systems and memory management.

overton
Télécharger la présentation

Analysis of Page Replacement Algorithms in Demand Paging

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Page Replacement PageRefs A B C D A B E A B C D E A A A A A A E E E E D D 10faults B B B B B B A A A A E FIFO C C C C C C B B B B D D D D D D C C C A A A A A A A A A A D D 6faults B B B B B B B B B B B MIN C C C C C C C C C C D D D E E E E E E A A A A A A A A A A A E 8faults B B B B B B B B B B B LRU C C C C E E E E D D D D D D D D C C C CS 140 Lecture Notes: Demand Paging

  2. More Memory Isn't Always Better PageRefs A B C D A B E A B C D E A A A D D D E E E E E E 9faults B B B A A A A A C C C FIFO C C C B B B B B D D A A A A A A E E E E D D 10faults B B B B B B A A A A E FIFO C C C C C C B B B B D D D D D D C C C CS 140 Lecture Notes: Demand Paging

  3. CS 140 Lecture Notes: Demand Paging

More Related