Reference no: EM13705333

Objective: Demonstrate various page replacement algorithms.

Problem Statement:

For this project you are to implement a program that accepts a choice of a replacement algorithm (FIFO, OPT, or LRU), a number of memory frames, and a reference string. For development purposes you can use the following data:

F,4,2,3,2,1,5,2,4,5,3,2,5,2

O,3,1,2,1,3,1,4,1,5,1,6,1,7,1,8

L,5, 2,3,2,1,5,2,4,5,3,2,5,2

The input file will be given to students through the class web-site.

Your program should calculate the number of page faults and display an output similar, Virtual memory, depending on the algorithm selected. (When no page fault occurs you may show the column as blank or you may simply show the pages that are there without any change.)

You will assume that the reference string is generated by one process and consider local replacement only. This is an example of desired output using FIFO and 4 frames.

for FIFO
2: <2, , , >
3: <2,3, , >
2: <2,3, , >
1: <2,3,1, >
5: <2,3,1,5>
2: <2,3,1,5>
4: <4,3,1,5>
5: <4,3,1,5>
3: <4,3,1,5>
2: <4,2,1,5>

5: <4,2,1,5>

2: <4,2,1,5>

The number of page fault using FIFO = 6

You can use any programming language for the implementation. In addition, you can develop the program on the platform of your choice. Keep in mind how easy it is for the TA to run your program.

Write-up

You should submit a write-up as well as your program. Your write-up should include any known bugs, limitations, and assumptions in your program. This wirte-up should be in text-format and titled as ‘README'. It should be submitted along with your code. TA will use the ‘README' file to compile (or install) and run your program. If the TA has trouble with your program then he will contact you to makeup it.