Scribd
Upload
8 views4 pages

Program For Page Replacement

module exam for CPE105

Uploaded by

LEBRON JAMES
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
8 views4 pages

Program For Page Replacement

module exam for CPE105

Uploaded by

LEBRON JAMES
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 4

#include <iostream>

#include <vector>

#include <list>

#include <unordered_set>

using namespace std;

// Function to perform FIFO page replacement algorithm

double FIFO(vector<int>& pages, int frames) {

list<int> frameList;

unordered_set<int> frameSet;

int pageFaults = 0;

for(int page : pages) {

if(frameSet.find(page) == frameSet.end()) {

if(frameList.size() == frames) {

int front = frameList.front();

frameSet.erase(front);

frameList.pop_front();

frameList.push_back(page);

frameSet.insert(page);

pageFaults++;

return 1.0 - (double)pageFaults / pages.size();

}
// Function to perform LRU page replacement algorithm

double LRU(vector<int>& pages, int frames) {

list<int> frameList;

unordered_set<int> frameSet;

int pageFaults = 0;

for(int page : pages) {

if(frameSet.find(page) == frameSet.end()) {

if(frameList.size() == frames) {

int back = frameList.back();

frameSet.erase(back);

frameList.pop_back();

frameList.push_front(page);

frameSet.insert(page);

pageFaults++;

} else {

frameList.remove(page);

frameList.push_front(page);

return 1.0 - (double)pageFaults / pages.size();

// Function to perform Optimal page replacement algorithm

double Optimal(vector<int>& pages, int frames) {

vector<int> frame(frames, -1);

int pageFaults = 0;
for(int i = 0; i < pages.size(); ++i) {

bool pageFound = false;

for(int j = 0; j < frames; ++j) {

if(frame[j] == pages[i]) {

pageFound = true;

break;

if(!pageFound) {

int pageToReplace = -1;

int farthest = i;

for(int j = 0; j < frames; ++j) {

int k;

for(k = i; k < pages.size(); ++k) {

if(frame[j] == pages[k]) {

break;

if(k == pages.size()) {

pageToReplace = j;

break;

if(k > farthest) {

farthest = k;

pageToReplace = j;

}
frame[pageToReplace] = pages[i];

pageFaults++;

return 1.0 - (double)pageFaults / pages.size();

int main() {

vector<int> pages = {7,5,3,1,2,0,3,2,7,1,0,3,2,0,1,7,5,3,6,3,2,0};

int frames = 3;

double hitRatioFIFO = FIFO(pages, frames);

double hitRatioLRU = LRU(pages, frames);

double hitRatioOptimal = Optimal(pages, frames);

cout << "FIFO Hit Ratio: " << hitRatioFIFO * 100 << "%" << endl;

cout << "LRU Hit Ratio: " << hitRatioLRU * 100 << "%" << endl;

cout << "Optimal Hit Ratio: " << hitRatioOptimal * 100 << "%" << endl;

return 0;

You might also like

pFad - Phonifier reborn

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.


Alternative Proxies:

Alternative Proxy

pFad Proxy

pFad v3 Proxy

pFad v4 Proxy