请求分页式存储管理页面置换算法

= cunchujisuanguocheng[hang, lie -1]; }}else {//如果没有命中,则向下移一位,新的进来置换过程 for (hang =0;hang <alpage; hang++) {cunchujisuanguocheng[hang, lie] = cunchujisuanguocheng[hang, lie -1]; 10}cunchujisuanguocheng[lie, lie] = Convert .ToInt32(ref_chars[lie]); }}}}}bool flag =false ;for (int loop =alpage; loop <ref_chars.Length; loop++) // 需要淘汰页时需要癮计算替换{flag =false ;for (int i=0;i<alpage; i++) {if((Phy_Blk[i].data == Convert .ToInt32(ref_chars[loop]))) {flag =true ;}}if(flag) //不缺页,不置换,但是要计数{for (int i=0;i<alpage; i++) {cunchushifoumingzhong[loop] =i; Phy_Blk[i].count =0; for (int l=0;l<i;l++) {Phy_Blk[i].count++; }for (int k=i+1;k<alpage; k++) {Phy_Blk[k].count++; } }}else //缺页,置换所有的页都不相等{for (int i=0;i<alpage; i++) {if(maxCount ==Phy_Blk[i].count) {Phy_Blk[i].data = Convert .ToInt32(ref_chars[loop]);