存贮层次模拟器FIFO、LRU等替换算法

#include <iostream> #include <vector> #include <string> #include <fstream> using namespace std; int GroupFind(vector<pair<int,int> > vecStream,int nMainStore,int GroupLength) { int i=0,j=0; int t=0; int n=nMainStore%vecStream.size(); if(n==0) n+=vecStream.size(); j=(n-1)/GroupLength; t=j*GroupLength; int k=vecStream[j*GroupLength].second; for(i=j*GroupLength;i<GroupLength*(j+1);i++) { if(k<vecStream[i].second||vecStream[i].first==0) { k=vecStream[i].second; t=i; } } return t; } ////////////////////////////////////////////////////////////////////////// //三种相联 int Connect(vector<int> nvec,int nLeafLength,int nCacheLength,int GroupLength,int nelect) { int i=0,j=0;; int nHitTarget=0; vector<vector<pair<int,int> > > leaf; vector<pair<int,int> > vecStream; pair<int,int> pNpiece; vector<string> vecstr; for(j=0;j<nCacheLength;j++) { pNpiece.first=-1; pNpiece.second=0; vecStream.push_back(pNpiece); } for(i=0;i<nvec.size();i++) { bool bflag=false; for(j=0;j<nCacheLength;j++) { if(nvec[i]==vecStream[j].first) { bflag=true; break; } } if(bflag==true) { nHitTarget++; for(int t=0;t<nCacheLength;t++) { vecStream[t].second++; } if (nelect==1) { vecStream[j].second=1; } vecstr.push_back("命中"); } else { int t; t=GroupFind(vecStream,nvec[i],GroupLength); for( int t1=0;t1<nCacheLength;t1++) { vecStream[t1].second++; } if (vecStream[t].first==0) { vecstr.push_back("调进"); } else { vecstr.push_back("替换"); } vecStream[t].second=1; vecStream[t].first=nvec[i]; } leaf.push_back(vecStream); } ////输出替换过程 for (j=0;j<vecStream.size();j++) { cout<<" "; for ( i=0;i<leaf.size();i++) { cout.width(3); cout<<(leaf[i])[j].first-1<<" "; } cout<<endl; } for ( i=0;i<leaf.size();i++) { cout.width(4); cout<<vecstr[i]<<" "; } cout<<endl; return nHitTarget; } int main(int argc, char* argv[]) { int nHitTarget=0; int GroupLength=0; int nLeafLength,nCacheLength; vector<int> nvec; int ninput; int nelect; while (true) { cout<<"请选择映射方式：LFU(1);FIFO(2)"<<endl; cin>>nelect; cout<<"请输入页的个数，cache大小,请输入组的大小："<<endl; cin>>nLeafLength>>nCacheLength>>GroupLength; cout<<"请输入地址流以空格隔开,以-1未结束位："<<endl; while(true) { cin>>ninput; if(ninput==-1) break; else if(ninput<=nLeafLength) { nvec.push_back(ninput+1); } else cout<<"输入错误！"<<endl; } switch(nelect) { case 1: case 2: nHitTarget= Connect(nvec,nLeafLength,nCacheLength,GroupLength,nelect); break; default: break; } cout<<endl; cout<<"命中率为："<<(float)nHitTarget/nvec.size()<<endl; system("pause"); system("cls"); nvec.clear(); } return 0; }