計算機(jī)操作系統(tǒng)實(shí)驗(yàn)程序僅供參考clock

1、/FIFO.cpp:Definestheentryforthe#include #include#defineM#defineN typedef/FIFO.cpp:Definestheentryforthe#include #include#defineM#defineN typedefstruct/用于改進(jìn)的CLOCK typedefstructPage voidi,j=0,q=P,r; while (j e)for(i=j;i j+if (i=listi= (q+rand()for(i=j;i j+if (i=listi= (q+rand()%e)%j= r=rand()%100; if

2、(r t)q=rand()%q=(q+ 1) % voidi,for(i=0;i prop)moi=moi=voidfor(i=1;if(void prj,for(j=0;jvoid prj,for(j=0;je;j+)f(for(i=0;ifor(j=0;j%c,f(%2df( voidInit_Clock(Page_clocki, j;for(i=0;ib_clocki.num=- for(i=0;ifor(j=0;jcij=-cij=- i, j;for(i=0;ibi.num=-bi.visit=for(i=0;ifor(j=0;jcij=-/Clockvoid ival1,p0;pf

3、or(i=0;i= 0)for(i = 0;i M;i+)if(i!=b_clocki.visit=for(i=0;ifor(i=0;i while(valval = p;p = (p + 1) % M;b_clockval.visit = 1; for(i = 0;i =bval.visit = 1; /被 bval.modifymodiff; for(i = 0;i M;i+)if(i!=bi.visit=for(i=0;iif(bi.num=-while(valfor(i=0;ip=(p+1)% if(bp.modify=0)&(bp.visit=if (val 0)for(i=0;ip

4、=(p+1)% if(bp.modify=1)&(bp.visit=if(bp.modify=1)&(bp.visit=bp.visit=bval.num = fold; bval.modify = modiff; bval.visit = 1;for(i=0;iif(i!=bi.visit=P = 1;e, m,prop,f(請輸入工作集中包含的頁數(shù)em:n); scanf(%d %d,&e,&m);t= generate_list(a,e,m,generate_modify(mo,e,/Clock 算法實(shí)現(xiàn) for(i = 0;i e;i+)for(j= 0;j cji=/Clock 算法實(shí)現(xiàn) for(i = 0;i e;i+)for(j= 0;j cji=(e, a);nin= nin-f(缺頁次數(shù)為：%dn缺頁率：%.2fn,nin,nin*1.0/e); /改進(jìn)的Clock算法實(shí)現(xiàn) for