This lab project addresses the implementation of page$-$replacement algorithms in a demand$-$paging system.

Each process in a demand$-$paging system has a page table that contains a list of entries. For each logical page of the process, there is an entry in the table that indicates if the page is in memory. If the page is in memory, the memory frame number that page is resident in is indicated. Also, for each page, the time at which the page has arrived in memory, the time at which it has been last referenced, and the number of times the page has been referenced since the page arrived in memory are maintained.

The page table data structure is a simple array of page$-$table entries $($PTEs$).$ Each PTE contains five fields as defined below:

struct PTE $\{$

int is$\_$valid;

int frame$\_$number;

int arrival$\_$timestamp;

int last$\_$access$\_$timestamp;

int reference$\_$count;

$\}$

Each process in the system has a page table that is simply an array of PTEs. Each process also has a pool of frames that is allocated. The frame pool for a process is represented as an array of integers, where each Integer represents the frame number of a frame that is free and is available for use by the process. Note that in order to get the frame number in the pool, you first need to access the integer in the array.

This lab project aims to exercise the various policies for page replacement. In particular, we study the following three page$-$replacement policies:

$1.$ First$-$In$-$First$-$Out $($FIFO$)$

$2.$ Least$-$Recently$-$Used $($LRU$)$

$3.$ Least$-$Frequently$-$Used $($LFU$)$

int process$\_$page$\_$access$\_$fifo$($struct PTE page$\_$table$[$TABLEMAX$],$int $*$table$\_$cnt$,$ int page$\_$number, int frame$\_$pool$[$POOLMAX$],$int $*$frame$\_$cnt$,$ int current$\_$timestamp$)$;

int count$\_$page$\_$faults$\_$fifo$($struct PTE page$\_$table$[$TABLEMAX$],$int table$\_$cnt$,$ int refrence$\_$string$[$REFERENCEMAX$],$int reference$\_$cnt$,$int frame$\_$pool$[$POOLMAX$],$int frame$\_$cnt$)$;

int process$\_$page$\_$access$\_$lru$($struct PTE page$\_$table$[$TABLEMAX$],$int $*$table$\_$cnt$,$ int page$\_$number, int frame$\_$pool$[$POOLMAX$],$int $*$frame$\_$cnt$,$ int current$\_$timestamp$)$;

int count$\_$page$\_$faults$\_$lru$($struct PTE page$\_$table$[$TABLEMAX$],$int table$\_$cnt$,$ int refrence$\_$string$[$REFERENCEMAX$],$int reference$\_$cnt$,$int frame$\_$pool$[$POOLMAX$],$int frame$\_$cnt$)$;

int process$\_$page$\_$access$\_$lfu$($struct PTE page$\_$table$[$TABLEMAX$],$int $*$table$\_$cnt$,$ int page$\_$number, int frame$\_$pool$[$POOLMAX$],$int $*$frame$\_$cnt$,$ int current$\_$timestamp$)$;

int count$\_$page$\_$faults$\_$lfu$($struct PTE page$\_$table$[$TABLEMAX$],$int table$\_$cnt$,$ int refrence$\_$string$[$REFERENCEMAX$],$int reference$\_$cnt$,$int frame$\_$pool$[$POOLMAX$],$int frame$\_$cnt$)$;