java请求调页存储管理方式的模拟_请求调页存储管理方式的模拟NRU.docx

请求调页存储管理方式的模拟NRU

?#include??#include??#include??#ifndef?_UNISTD_H?#define?_UNISTD_H?#include??#include??#endif??#define?TRUE?1?#define?FALSE?0?#define?INVALID?-1?#define?NULL?0??#define??total_instruction?320?/*指令流长*/?#define?total_vp?32?/*虚页长*/?#define?clear_period?50?/*清0周期*/??typedef?struct?/*页面结构*/?{?int?pn,pfn,counter,time;?}pl_type;?pl_type?pl[total_vp];?/*页面结构数组*/?struct?pfc_struct{??????????????????/*页面控制结构*/??int?pn,pfn;??struct?pfc_struct?*next;?};??typedef?struct?pfc_struct?pfc_type;??pfc_type?pfc[total_vp],*freepf_head,*busypf_head,*busypf_tail;??int?diseffect,??a[total_instruction];?int?page[total_instruction],??offset[total_instruction];??int initialize(int);int NUR(int)?int?main(?)?{??int?s,i,j;?srand(10*getpid());?/*由于每次运行时进程号不同，故可用来作为初始化随机数队列的“种子”*/?s=(float)319*rand(?)/32767/32767/2+1;?//?for(i=0;i319)??{?printf("When?i==%d,Error,s==%d\n",i,s);??exit(0);?}??a[i]=s;??/*任选一指令访问点m*/??a[i+1]=a[i]+1;?/*顺序执行一条指令*/??a[i+2]=(float)a[i]*rand(?)/32767/32767/2;?/*执行前地址指令m'?*/?a[i+3]=a[i+2]+1;?/*顺序执行一条指令*/??s=(float)(318-a[i+2])*rand(?)/32767/32767/2+a[i+2]+2;?if((a[i+2]>318)||(s>319))??printf("a[%d+2],a?number?which?is?:%d?and?s==%d\n",i,a[i+2],s);??}?for?(i=0;i