模拟操作系统的页面置换 2011年05.12【荐】.docVIP

//模拟操作系统的页式置换 ///s/blog_5e518b010100kbts.html 优先队列 STL ///605768/ #include iostream #include queue #include vector using namespace std; #define NOT -1 int opt[40000][257]; struct PAGE { int number; int offset; }; class CPage { private: int MAXN ; int size_of_v ; int size_of_vp ; int size_of_m ; int size_of_mp ; int max_vp; int max_mp; int lacks; PAGE * vp_adr; int * mp_flag; int * v_mem_adr; int * vp_map_mp; int * mp_map_vp; protected: bool random(); bool if_in_mem( int number ); public: CPage( ); ~CPage(); static int * vp_flag; bool Init_v( int size_of_v , int size_of_vp ); bool Init_m( int size_of_m , int size_of_mp ); bool VP_TO_MP(); void Show_vm(); void Show_mp(); bool FIFO(); bool OPT(); bool LRU(); struct cmp { bool operator()(const int p1, const int p2) { return vp_flag[p1] vp_flag[p2]; }; }; }; int * CPage::vp_flag = NULL; CPage::CPage( ) { MAXN = 256; srand(0); Init_v(32767,1024); Init_m(1024,1024); } CPage::~CPage() { delete v_mem_adr; delete vp_adr; delete vp_map_mp; delete mp_map_vp; delete mp_flag; delete vp_flag; } bool CPage::Init_v( int a , int b ) { this-size_of_v = a ; this-size_of_vp = b ; cinsize_of_vp; max_vp = size_of_v / size_of_vp + 1; v_mem_adr = new int [MAXN]; vp_adr = new PAGE [MAXN]; vp_flag = new int[max_vp]; vp_map_mp = new int[max_vp]; random(); return true; } bool CPage::Init_m( int a , int b ) { this-size_of_m = a ; this-size_of_mp = b ; cinmax_mp; mp_flag = new int [max_mp]; mp_map_vp = new int [max_mp]; return true; } bool CPage::random() { int i; int a; v_mem_adr[0] = 10000; vp_adr[0].number = 10000 / size_of_vp; vp_adr[0].offset = 10000 % size_of_vp; for(i=1 ; i MAXN ; i++) { a = rand() % 1024 + 1; if( a= 512 ) { v_mem_adr[i] = v_mem_adr[i-1] +1; } else if( a= 769 ) { v_mem_adr[i] = rand() % v_mem_adr[i-1] + 1; } else { v_mem_adr[i] = rand() % (size_of_v - v_mem_adr[i-1]) + v_mem_adr[i-1]; } vp_adr[i].number = v_me