Page Replacement Algorithm in Operating Systems
source link: https://www.geeksforgeeks.org/videos/page-replacement-algorithm-in-operating-systems/
Go to the source link to view the article. You can view the picture content, updated content and better typesetting reading experience. If the link is broken, please click the button below to view the snapshot at that time.
Page Replacement Algorithm in Operating Systems
- 40 Views
- 11/06/2022
In this video, we will be discussing what is Page Replacement & what are the different algorithms which come under the Page replacement algorithm.
Page replacement is the process of bringing a page from the secondary memory to the main memory by replacing a page existing in the main memory. Page Replacement is required if the Operating System uses Virtual Memory and Demand Paging for memory management.
The following page replacement algorithms are used in operating system: - First In First Out (FIFO) - Optimal Page Replacement - Least Recently Used - Last In First Out (LIFO) - Random Page Replacement
FIFO: The page that was brought into the memory first, will be the first one to be replaced by the FIFO algorithm. The oldest page is present at the front of the queue, it will be replaced when a new page has to be brought into the main memory.
Optimal Page Replacement: Optimal Page Replacement algorithm replaces the page that will not be used for the longest time in the future. The page which will be referred to at the farthest time is the one that will be replaced by this algorithm.
Least Recently used: LRU algorithm replaces that page from the main memory which has not been used for a longest time in the past. This algorithm assumes that the pages that have been recently used, will be required again in near future.
Last in First Out: LIFO algorithm replaces the page that was most recently inserted into the main memory. A stack is maintained by the LIFO algorithm to track the recency of pages. Every new page is inserted at the top of the stack.
Random Page replacement: This algorithm randomly selects one of the pages present in the main memory for replacement. This algorithm may generate different results even for the same series of pages requested by the CPU.
Page replacement algorithm: https://www.geeksforgeeks.org/page-replacement-algorithms-in-operating-systems/
Recommend
-
141
cmus — C* Music Player https://cmus.github.io/ Copyright © 2004-2008 Timo Hirvonen [email protected] Copyright ©...
-
48
Support Plan for 32-bit and 64-bit Operating Systems Support Plan for 32-bit and 64-bit Operating Systems ...
-
146
A while ago, we have covered about OSBoxes , a website that offers a collection o...
-
55
DistroTest is free web service that allows you to test 100+ Linux and Unix operating systems for free, without having to install them locally.
-
73
README.md "Operating Systems: Three Easy Pieces"の日本語翻訳 本家サイト:http://pages.cs.wisc.edu/~rem...
-
39
About Genode The Genode OS Framework is a tool kit for building highly secure special-purpose operating systems. It scales from embedded systems with as little as 4 MB of memory to highly dynamic general-pu...
-
6
Minimum Viable Replacement: A New Framework for Retiring Old Systems BY
-
2
Optimal Page Replacement Algorithm in Operating SystemsOptimal Page Replacement Algorithm in Operating Systems27/06/2022In this video, we will be l...
-
1
Random Page Replacement Algorithm in Operating System (OS)Random Page Replacement Algorithm in Operating System (OS)60 Views13/07/2022<...
-
19
Shortest Job First (SJF) Scheduling AlgorithmShortest Job First (SJF) Scheduling Algorithm | Operating SystemsHello everyone. Welcome to Geeks for Gates.
About Joyk
Aggregate valuable and interesting links.
Joyk means Joy of geeK