LRU页面置换算法的设计实验报告

display(Bsize);Р }Р elseР {Р position = findReplace(Bsize);Р block[position] = page[i]; Р display(Bsize);Р }Р }Р for(int j=0; j<Bsize; j++)Р block[j].timer++;//BLOCK中D所¨´有®D页°3面?TIMER++Р?}Р?cout<<"缺页次数为:"<<20-score<<endl;Р?cout<<"缺页率为: "<<(20-score)*100/20<<"%"<<endl;Р}Рvoid BlockClear(int Bsize)Р{Р?for(int i=0; i<Bsize; i++)Р?{Р block[i].content = -1;Р block[i].timer = 0;Р?}Р}Рint main()Р{Р srand((int)time(NULL));Р int i,QString[20],Bsize;Р for(i=0;i<20;i++)Р { Р QString[i] = rand()%10 ;Р }Р cout<<"页面号引用串: ";Р for(i=0;i<20;i++)Р {Р cout<<QString[i]<<" ";Р }Р cout<<endl<<"------------------------------------------------------"<<endl;Р Bsize = 3;Р Init(QString,Bsize);Р cout<<"LRU算法结果如下:<<endl;Р LRU(Bsize);Р BlockClear(Bsize);Р cout<<"----------------------"<<endl;Р system("pause");Р}Р某次运行结果