Paging Algorithms Operating System
Write the simulation Paging Algorithms program for demand paging and show the page scheduling and total number of page faults according to MFU page replacement algorithm. Assume the memory of ‘n’ frames.
Paging Algorithms using C language
|
1 |
# include <br/> # include <br/> # include <br/> # define maxn 50 <br/> typedef struct page <br/> { <br/> int frame ; <br/> int count[maxn],curr[maxn] ; <br/> }page ; <br/> struct page p ; <br/> void fifo(int pages,int page[]) ; <br/> void lru(int pages ,int page[]) ; <br/> void optimal(int pages,int page[]) ; <br/> void main() <br/> { <br/> int ch=0,pages=0,i,j,page[maxn],frames=0,temp3,temp4 ; <br/> char temp ; <br/> clrscr() ; <br/> do <br/> { <br/> printf("\t\t\t\****main menu****\n") ; <br/> printf("\t\t\t1.enter the page information\n"); <br/> printf("\t\t\t2.dispaly page info\n"); <br/> printf("\t\t\t3.fifo\n" ); <br/> printf("\t\t\t4.\lru\n") ; <br/> printf("\t\t\t5.\optimal\n") ; <br/> printf("\t\t\t6.exit\n"); <br/> printf("\t\t\tenter ur choice\n"); <br/> scanf("%d",&ch); <br/> switch (ch) <br/> { <br/> case 1: <br/> clrscr(); <br/> printf("enter the no of pages\n"); <br/> scanf("%d",&pages) ; <br/> printf("enter pages\n"); <br/> for(i=0;i<pages;i++) <br=""> { <br/> printf("page %d\n",i); <br/> scanf("%d",&page[i]) ; <br/> } <br/> printf("enter number of frames .....\n"); <br/> scanf("%d",&p.frame) ; <br/> break ; <br/> case 2: <br/> printf("no of pages%d\n",pages); <br/> printf("page sequence \n"); <br/> for(i=0;i<pages;i++) <br=""> { <br/> printf("page %d\n",page[i]); <br/> } <br/> printf("no of frames/%d",p.frame); <br/> break ; <br/> case 3: <br/> fifo(pages,page) ; <br/> break ; <br/> case 4: <br/> lru(pages ,page); <br/> break ; <br/> case 5: <br/> optimal(pages ,page); <br/> break ; <br/> case 6: <br/> break ; <br/> } <br/> }while(ch!=6 ); <br/> } <br/> void fifo(int pages,int page[]) <br/> { <br/> int i,j,k,flag=0,temp=0,fault=0 ; <br/> for(i=0;i<p.frame;i++) <br=""><br/><br/> { <br/> p.curr[i]=-1 ; <br/> p.count[i]=100 ; <br/> printf("\tpage%d",i+1) ; <br/> } <br/> printf("\tfault\n\n"); <br/> for(i=0;i<pages;i++) <br=""> { <br/> flag=0 ; <br/> temp=0 ; <br/> for(j=0;j<p.frame;j++) <br=""><br/><br/> { <br/> if(p.curr[j]==page[i]) <br/> { <br/> flag=1 ; <br/> break ; <br/> } <br/> if(temp<p.count[j]) <br=""><br/><br/> { <br/> temp=p.count[j] ; <br/> k=j ; <br/> } <br/> } <br/> for(j=0;j<p.frame;j++) <br=""><br/><br/> { <br/> if(flag==0 && k==j) <br/> { <br/> p.curr[j]=page[i] ; <br/> p.count[j]=1 ; <br/> fault++ ; <br/> } <br/> else <br/> if(j<fault) <br=""> p.count[j]++; <br/> if(p.curr[j]!=-1) <br/> printf("\t%d",p.curr[j]) ; <br/> } <br/> if(flag==0) <br/> printf("\t\t\t*") ; <br/> printf("\n") ; <br/> } <br/> printf("no of page fault%d",fault); <br/> } <br/> void lru(int pages ,int page[]) <br/> { <br/> int i,j,k,flag=0,temp=0,fault=0 ; <br/> for(i=0;i<p.frame;i++) <br=""><br/><br/> { <br/> p.curr[i]=-1 ; <br/> p.count[i]=100 ; <br/> printf("\tpage%d",i+1) ; <br/> } <br/> printf("\tfault\n\n"); <br/> for(i=0;i<pages;i++) <br=""> { <br/> flag=0 ; <br/> temp=0 ; <br/> for(j=0;j<p.frame;j++) <br=""><br/><br/> { <br/> if(p.curr[j]==page[i]) <br/> { <br/> flag=1 ; <br/> p.count[j]=0 ; <br/> break ; <br/> } <br/> if(temp<p.count[j]) <br=""><br/><br/> { <br/> temp=p.count[j] ; <br/> k=j ; <br/> } <br/> } <br/> for(j=0;j<p.frame;j++) <br=""><br/><br/> { <br/> if(flag==0 && k==j) <br/> { <br/> p.curr[j]=page[i] ; <br/> p.count[j]=1 ; <br/> fault++ ; <br/> } <br/> else <br/> if(j<fault) <br=""> p.count[j]++; <br/> if(p.curr[j]!=-1) <br/> printf("\t%d",p.curr[j]) ; <br/> } <br/> if(flag==0) <br/> printf("\t\t\t*") ; <br/> printf("\n") ; <br/> } <br/> printf("no of page fault%d",fault); <br/> } <br/> void optimal(int pages,int page[]) <br/> { <br/> int i,j,k,flag=0,temp=0,fault=0,s ; <br/> for(i=0;i<p.frame;i++) <br=""><br/><br/> { <br/> p.curr[i]=-1 ; <br/> p.count[i]=100 ; <br/> printf("\tpage%d",i+1) ; <br/> } <br/> printf("\tfault\n\n"); <br/> for(i=0;i<pages;i++) <br=""> { <br/> flag=0 ; <br/> temp=0 ; <br/> for(j=0;j<p.frame;j++) <br=""><br/><br/> { <br/> if(p.curr[j]==page[i]) <br/> { <br/> flag=1 ; <br/> p.count[j]=0 ; <br/> break ; <br/> } <br/> if(temp<p.count[j]) <br=""><br/><br/> { <br/> temp=p.count[j] ; <br/> k=j ; <br/> } <br/> } <br/> for(j=0;j<p.frame;j++) <br=""><br/><br/> { <br/> if(flag==0 && k==j) <br/> { <br/> p.curr[j]=page[i] ; <br/> p.count[j]=0 ; <br/> fault++ ; <br/> } <br/> else <br/> if(j<fault) <br=""> { <br/> p.count[j]=0 ; <br/> for(s=i+1;s<pages;s++) <br=""> { <br/> if(page[i]==p.curr[j]) <br/> break ; <br/> else <br/> p.count[j]++ ; <br/> } <br/> } <br/> p.count[j]++; <br/> if(p.curr[j]!=-1) <br/> printf("\t%d",p.curr[j]) ; <br/> } <br/> if(flag==0) <br/> printf("\t\t\t*") ; <br/> printf("\n") ; <br/> } <br/> printf("no of page fault%d",fault); <br/> } |
Source projectgeek.com
