实验二时钟算法源码.docxVIP

#includeiostreamusingnamespace std;void Print(intbc[], intblockCount){for (int i = 0; iblockCount; i++){cout bc[i] ;}cout endl;}bool Travel(intbc[], intblockCount, intx){bool is_found = false;int i;for (i = 0; iblockCount; i++){if (bc[i] == x){is_found = true;break;}}return is_found;}int get(intbc[], intblockCount, intx){bool is_found = false;int i;for (i = 0; iblockCount; i++){if (bc[i] == x){is_found = true;break;}}return i;}void CLOCK(intpc[], intbc[], intpageCount, intblockCount, intcurrent){if (pageCount = blockCount){current = 0;int i;for (i = 0; i pageCount; i++){if (!Travel(bc, blockCount, pc[i]))//主存页框里没找到{bc[current++] = pc[i];}}cout 主存页号：; Print(bc, blockCount);cout 缺页次数为： pageCount endl;cout 缺页率为： (float)pageCount / pageCount endl;}else//访问页数大于主存框数{current = 0;int noPage = 0;int i;int *R = newint[blockCount];//设置R位for (i = 0; iblockCount; i++){R[i] = 0;//初始化均为第一次可进行插入}for (i = 0; i blockCount; i++){cout 访问页： pc[i] endl;bc[i] = pc[i];R[i] = 1;noPage++;//缺页次数cout 主存页号：;Print(bc, blockCount);}for (i = blockCount; ipageCount; i++){cout 访问页： pc[i] endl;if (!Travel(bc, blockCount, pc[i]))//主存页框没找到{for ( current; current blockCount; current++)//判断页框里的元素{if (R[current] == 1){R[current] = 0;}elseif (R[current] == 0){break;//可进行插入}if (current == blockCount - 1){current = -1;//实现二次循环}}cout 置换第 current 个元素。;bc[current] = pc[i];R[current] = 1;noPage++;//缺页次数if (current == blockCount - 1){current = -1;//实现二次循环}current++;cout 主存页号：;Print(bc, blockCount);}else{int g = get(bc, blockCount, pc[i]);R[g] = 1;if (g == blockCount - 1){current = 0;}elsecurrent = g + 1;}}cout 缺页次数为: noPage endl;cout 缺页率为: (float)noPage / pageCount endl;delete []R;}}int main(){int pageCount;//页面访问次数int blockCount;//主存页框数(块)int i;int current = 0;cout 页面访问次数： endl;cin pageCount;int *pc = newint[pageCount];//页面访问次序cout 输入页面访问次序： endl;for (i = 0; ipageCount; i++){cin pc[i];}cout 输入主存页框数 endl;cin blockCount;int *bc = newint[blockCount];for (i = 0; iblockCount; i