模拟比较页面置换页算法及缺页率 源代码.doc

模拟比较页面置换页算法及缺页率 源代码 #include stdio.h #include stdlib.h #includetime.h int add[256]/*地址*/,page[256]/*页面*/; int k,j,ram,t; float rate;/*缺页率*/ struct s1 { int page; int free; int tag; } fifo[33],opt[33],lru[33]; struct s2 { int time;}; void address(); float FIFO(int ram);/*先进先出*/ float LRU(int ram);/*最近最久未使用页面置换*/ float OPT(int ram);/*理想型*/ int main() { int i,p[256];/*页号*/ address(); for (k=1; k=8;) /*页面大小: 1k,2k,4k,8K*/ { printf(the size of a page is %d k\n ,k); printf(the page num is ...\n); for (i=0; i256; i++) {p[i]=add[i]/(k*1024);/*将指令地址生成相应的页号*/ printf(%d ,p[i]); }j=0; for (i=0; i256; i++) { while (p[i]==p[i+1])i++; page[j]=p[i]; j++;} printf(\nafter connect the same pages the page num is:\n); for (i=0; ij; i++) printf(%d ,page[i]); printf(\n); getchar(); for (ram=1; ram=32; ram++) { if (ram==10) getchar(); printf(\nblock=%d pages= %d,absent rate: ,ram,j); printf(FIFO=%0.2f%% ,FIFO(ram)); printf(LRU =%0.2f%% ,LRU(ram)); printf(OPT =%0.2f%% ,OPT(ram)); } k=k*2; getchar(); } return 0; } void address() /*产生指令地址*/ { int i,x; add[0]=1000; srand((int)time(0)); for (i=1; i=255; i++) { x=rand()%1024; if ((x=0)(x512)) add[i]=add[i-1]+1; if ((x=512)(x768)) add[i]=rand()%(add[i-1]-1)+1; if ((x=768)(x1024)) add[i]=add[i-1]+rand()%(30*1024-add[i-1]-1)+1; }} float FIFO(int ram) { int absent=0,t=0,i,z,l,yn; for (i=0; iram; i++) { fifo[i].page=-1; fifo[i].free=1; fifo[i].tag=0;} i=0; while (ij) { yn=0; for (z=0; zram; z++) /*the page is in the ram?*/ if (fifo[z].page==page[i]) { yn=1; for (z=0; zram; z++) if (fifo[z].free==0) fifo[z].tag+=1; } if (yn!=1) { absent+=1; /*count the absent page*/ l=0; while ((lram)(fifo[l].free==0)) l++;