先决条件：页面替换算法
在使用分页进行内存管理的操作系统中，需要页面替换算法来决定当新页面进入时需要替换哪个页面。每当新页面被引用并且不在内存中时，就会发生页面错误并且操作系统替换其中之一现有页面和新需要的页面。不同的页面替换算法建议不同的方法来决定替换哪个页面。所有算法的目标都是减少页面错误的数量。
以L东ecentlyùSED(LRU)是最近最少使用算法ř贪婪算法，其中要被替换的页面。该想法基于引用的位置，最近最少使用的页面不太可能
假设页面引用字符串7 0 1 2 0 3 0 4 2 3 0 3 2 。最初我们有 4 个空的页槽。
最初所有的槽都是空的，所以当 7 0 1 2 被分配给空槽时 —> 4 Page faults
0 已经是他们的了 —> 0 Page fault。
当 3 出现时，它将取代 7，因为它最近最少使用 —> 1 Page fault
0 已经在内存中，所以 —> 0 Page fault 。
4 将取代 1 —> 1 Page Fault
现在对于进一步的页面引用字符串-> 0 Page fault因为它们已经在内存中可用。
_Page_Replacement_algorithm_0.jpg)
给定内存容量(作为它可以容纳的页面数)和一个表示要引用的页面的字符串，编写一个函数来查找页面错误的数量。
Let capacity be the number of pages that
memory can hold. Let set be the current
set of pages in memory.
1- Start traversing the pages.
i) If set holds less pages than capacity.
a) Insert page into the set one by one until
the size of set reaches capacity or all
page requests are processed.
b) Simultaneously maintain the recent occurred
index of each page in a map called indexes.
c) Increment page fault
ii) Else
If current page is present in set, do nothing.
Else
a) Find the page in the set that was least
recently used. We find it using index array.
We basically need to replace the page with
minimum index.
b) Replace the found page with current page.
c) Increment page faults.
d) Update index of current page.
2. Return page faults.下面是上述步骤的实现。
C++
//C++ implementation of above algorithm
#include
using namespace std;
// Function to find page faults using indexes
int pageFaults(int pages[], int n, int capacity)
{
// To represent set of current pages. We use
// an unordered_set so that we quickly check
// if a page is present in set or not
unordered_set s;
// To store least recently used indexes
// of pages.
unordered_map indexes;
// Start from initial page
int page_faults = 0;
for (int i=0; i Java
// Java implementation of above algorithm
import java.util.HashMap;
import java.util.HashSet;
import java.util.Iterator;
class Test
{
// Method to find page faults using indexes
static int pageFaults(int pages[], int n, int capacity)
{
// To represent set of current pages. We use
// an unordered_set so that we quickly check
// if a page is present in set or not
HashSet s = new HashSet<>(capacity);
// To store least recently used indexes
// of pages.
HashMap indexes = new HashMap<>();
// Start from initial page
int page_faults = 0;
for (int i=0; i itr = s.iterator();
while (itr.hasNext()) {
int temp = itr.next();
if (indexes.get(temp) < lru)
{
lru = indexes.get(temp);
val = temp;
}
}
// Remove the indexes page
s.remove(val);
//remove lru from hashmap
indexes.remove(val);
// insert the current page
s.add(pages[i]);
// Increment page faults
page_faults++;
}
// Update the current page index
indexes.put(pages[i], i);
}
}
return page_faults;
}
// Driver method
public static void main(String args[])
{
int pages[] = {7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2};
int capacity = 4;
System.out.println(pageFaults(pages, pages.length, capacity));
}
}
// This code is contributed by Gaurav Miglani C#
// C# implementation of above algorithm
using System;
using System.Collections.Generic;
class GFG
{
// Method to find page faults
// using indexes
static int pageFaults(int []pages,
int n, int capacity)
{
// To represent set of current pages.
// We use an unordered_set so that
// we quickly check if a page is
// present in set or not
HashSet s = new HashSet(capacity);
// To store least recently used indexes
// of pages.
Dictionary indexes = new Dictionary();
// Start from initial page
int page_faults = 0;
for (int i = 0; i < n; i++)
{
// Check if the set can hold more pages
if (s.Count < capacity)
{
// Insert it into set if not present
// already which represents page fault
if (!s.Contains(pages[i]))
{
s.Add(pages[i]);
// increment page fault
page_faults++;
}
// Store the recently used index of
// each page
if(indexes.ContainsKey(pages[i]))
indexes[pages[i]] = i;
else
indexes.Add(pages[i], i);
}
// If the set is full then need to
// perform lru i.e. remove the least
// recently used page and insert
// the current page
else
{
// Check if current page is not
// already present in the set
if (!s.Contains(pages[i]))
{
// Find the least recently used pages
// that is present in the set
int lru = int.MaxValue, val = int.MinValue;
foreach (int itr in s)
{
int temp = itr;
if (indexes[temp] < lru)
{
lru = indexes[temp];
val = temp;
}
}
// Remove the indexes page
s.Remove(val);
//remove lru from hashmap
indexes.Remove(val);
// insert the current page
s.Add(pages[i]);
// Increment page faults
page_faults++;
}
// Update the current page index
if(indexes.ContainsKey(pages[i]))
indexes[pages[i]] = i;
else
indexes.Add(pages[i], i);
}
}
return page_faults;
}
// Driver Code
public static void Main(String []args)
{
int []pages = {7, 0, 1, 2, 0, 3,
0, 4, 2, 3, 0, 3, 2};
int capacity = 4;
Console.WriteLine(pageFaults(pages,
pages.Length, capacity));
}
}
// This code is contributed by 29AjayKumar Javascript
Java
// Java program for page replacement algorithms
import java.util.ArrayList;
public class LRU {
// Driver method
public static void main(String[] args) {
int capacity = 4;
int arr[] = {7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2};
// To represent set of current pages.We use
// an Arraylist
ArrayList s=new ArrayList<>(capacity);
int count=0;
int page_faults=0;
for(int i:arr)
{
// Insert it into set if not present
// already which represents page fault
if(!s.contains(i))
{
// Check if the set can hold equal pages
if(s.size()==capacity)
{
s.remove(0);
s.add(capacity-1,i);
}
else
s.add(count,i);
// Increment page faults
page_faults++;
++count;
}
else
{
// Remove the indexes page
s.remove((Object)i);
// insert the current page
s.add(s.size(),i);
}
}
System.out.println(page_faults);
}
} Python3
# Python3 program for page replacement algorithm
# Driver code
capacity = 4
processList = [ 7, 0, 1, 2, 0, 3, 0,
4, 2, 3, 0, 3, 2]
# List of current pages in Main Memory
s = []
pageFaults = 0
# pageHits = 0
for i in processList:
# If i is not present in currentPages list
if i not in s:
# Check if the list can hold equal pages
if(len(s) == capacity):
s.remove(s[0])
s.append(i)
else:
s.append(i)
# Increment Page faults
pageFaults +=1
# If page is already there in
# currentPages i.e in Main
else:
# Remove previous index of current page
s.remove(i)
# Now append it, at last index
s.append(i)
print("{}".format(pageFaults))
# This code is contributed by mahi_07C#
// C# program for page replacement algorithms
using System;
using System.Collections.Generic;
class LRU
{
// Driver method
public static void Main(String[] args)
{
int capacity = 4;
int []arr = {7, 0, 1, 2, 0, 3, 0,
4, 2, 3, 0, 3, 2};
// To represent set of current pages.
// We use an Arraylist
List s = new List(capacity);
int count = 0;
int page_faults = 0;
foreach(int i in arr)
{
// Insert it into set if not present
// already which represents page fault
if(!s.Contains(i))
{
// Check if the set can hold equal pages
if(s.Count == capacity)
{
s.RemoveAt(0);
s.Insert(capacity - 1, i);
}
else
s.Insert(count, i);
// Increment page faults
page_faults++;
++count;
}
else
{
// Remove the indexes page
s.Remove(i);
// insert the current page
s.Insert(s.Count, i);
}
}
Console.WriteLine(page_faults);
}
}
// This code is contributed by Rajput-Ji 输出：
6另一种方法：(不使用HashMap)
Java
// Java program for page replacement algorithms
import java.util.ArrayList;
public class LRU {
// Driver method
public static void main(String[] args) {
int capacity = 4;
int arr[] = {7, 0, 1, 2, 0, 3, 0, 4, 2, 3, 0, 3, 2};
// To represent set of current pages.We use
// an Arraylist
ArrayList s=new ArrayList<>(capacity);
int count=0;
int page_faults=0;
for(int i:arr)
{
// Insert it into set if not present
// already which represents page fault
if(!s.contains(i))
{
// Check if the set can hold equal pages
if(s.size()==capacity)
{
s.remove(0);
s.add(capacity-1,i);
}
else
s.add(count,i);
// Increment page faults
page_faults++;
++count;
}
else
{
// Remove the indexes page
s.remove((Object)i);
// insert the current page
s.add(s.size(),i);
}
}
System.out.println(page_faults);
}
}
蟒蛇3
# Python3 program for page replacement algorithm
# Driver code
capacity = 4
processList = [ 7, 0, 1, 2, 0, 3, 0,
4, 2, 3, 0, 3, 2]
# List of current pages in Main Memory
s = []
pageFaults = 0
# pageHits = 0
for i in processList:
# If i is not present in currentPages list
if i not in s:
# Check if the list can hold equal pages
if(len(s) == capacity):
s.remove(s[0])
s.append(i)
else:
s.append(i)
# Increment Page faults
pageFaults +=1
# If page is already there in
# currentPages i.e in Main
else:
# Remove previous index of current page
s.remove(i)
# Now append it, at last index
s.append(i)
print("{}".format(pageFaults))
# This code is contributed by mahi_07
C＃
// C# program for page replacement algorithms
using System;
using System.Collections.Generic;
class LRU
{
// Driver method
public static void Main(String[] args)
{
int capacity = 4;
int []arr = {7, 0, 1, 2, 0, 3, 0,
4, 2, 3, 0, 3, 2};
// To represent set of current pages.
// We use an Arraylist
List s = new List(capacity);
int count = 0;
int page_faults = 0;
foreach(int i in arr)
{
// Insert it into set if not present
// already which represents page fault
if(!s.Contains(i))
{
// Check if the set can hold equal pages
if(s.Count == capacity)
{
s.RemoveAt(0);
s.Insert(capacity - 1, i);
}
else
s.Insert(count, i);
// Increment page faults
page_faults++;
++count;
}
else
{
// Remove the indexes page
s.Remove(i);
// insert the current page
s.Insert(s.Count, i);
}
}
Console.WriteLine(page_faults);
}
}
// This code is contributed by Rajput-Ji
输出：
6