操作系統模擬之地址轉換算法。
文件共3份，其中1份cpp，2份.h，代碼如下：

main.cpp

#include "init.h"int main() {printf("歡迎進入演示系統！\n");printf("\n現在需要對進程數據初始化\n");printf("通過鍵盤輸入請輸入1\n");printf("通過構造函數直接生成請輸入2\n");int num_initialize;scanf("%d", &num_initialize);printf("\n");node process;if(num_initialize == 1){printf("請輸入進程的數量：\n");int process_number;scanf("%d", &process_number);if(process_number > 0)process.set(process_number);}else if(num_initialize != 2)printf("您的輸入有誤！\n");process.act();printf("\n感謝您的使用，下次再見！\n");return 0; }

init.h

#include<bits/stdc++.h> using namespace std; class node{public:int number; vector<string> name;vector<int> arrive_time;vector<int> serve_time;vector<int> priority;vector<int> begin_time;vector<int> end_time;vector<int> round_time;vector<double> weighted_round_time;vector<string> path;public:node();void set(int num);void act();void process_print();void alo_fcfs();void alo_sjp();void alo_pri1();void alo_pri2();void alo_piece(int num); };node::node() {system("cls");printf("開始初始化進程數據\n");number = 5;string s[5] = {"A","B","C","D","E"};int arrive[5] = {0,1,2,3,4};int serve[5] = {4,3,5,2,4};int pri[5] = {4,2,3,5,1};for(int i = 0; i < number; i++){name.push_back(s[i]);arrive_time.push_back(arrive[i]);serve_time.push_back(serve[i]);priority.push_back(pri[i]);}printf("進程數據初始化完成！\n"); }void node::set(int num) {number = num;name.clear();arrive_time.clear();serve_time.clear();priority.clear();for(int i = 1; i <= num; i++){printf("\n現在輸入第%d個進程的數據\n", i);printf("請依次輸入進程名、到達時間、服務時間和靜態優先權：\n");string process_name;int time_arrive, time_serve, process_priority;cin >> process_name;cin >> time_arrive >> time_serve >> process_priority);name.push_back(process_name);arrive_time.push_back(time_arrive);serve_time.push_back(time_serve);priority.push_back(process_priority);}system("cls");printf("進程數據錄入完成！\n\n"); }void node::act() {while(1){begin_time.clear();end_time.clear();round_time.clear();weighted_round_time.clear();printf("\n請按回車鍵繼續！\n");getchar();getchar();system("cls"); printf("FCFS算法請輸入1\n");printf("SJ(P)F算法請輸入2\n");printf("優先權算法請輸入3\n");printf("時間片輪轉算法請輸入4\n");printf("退出程序請輸入0\n\n"); printf("請選擇相應的算法：\n");int choice;scanf("%d", &choice);if(choice == 0)break;else if(choice == 1)alo_fcfs();else if(choice == 2)alo_sjp();else if(choice == 3){printf("\n非搶占優先權算法請輸入1\n");printf("搶占優先權算法請輸入2\n");int choice_pri;scanf("%d", &choice_pri);if(choice_pri == 1)alo_pri1();else if(choice_pri == 2)alo_pri2();elseprintf("您的輸入有誤！\n"); }else if(choice == 4){printf("請輸入時間片Q的大小：\n");int Q_size;scanf("%d", &Q_size);alo_piece(Q_size);}process_print();} }void node::process_print() {for(int i = 0; i < number; i++){round_time.push_back(end_time[i] - arrive_time[i]);weighted_round_time.push_back(1.0 * round_time[i] / serve_time[i]);}system("cls");printf("現在輸出進程規劃：\n");printf("進程名 到達時間 服務時間 開始時間 完成時間 周轉時間 帶權周轉時間\n");for(int i = 0; i < number; i++){cout << " " << name[i];printf("%8d%9d%9d%10d%9d%12.1f\n", arrive_time[i], serve_time[i], begin_time[i], end_time[i], round_time[i], weighted_round_time[i]);}double res1 = 0.0, res2 = 0.0;for(int i = 0; i < number; i++){res1 += round_time[i];res2 += weighted_round_time[i];}res1 = 1.0 * res1 / number;res2 = 1.0 * res2 / number;printf("平均 %44.1f %10.1f\n\n", res1, res2);printf("輪轉順序為：");for(int i = 0; i < path.size(); i++){if(i > 0)printf("-");cout << path[i];} printf("\n");path.clear(); }void node::alo_fcfs() {int vis[1005] = {0};int bg[1005] = {0};int finished = 0, nowtime = 0;while(finished < number){int u = -1, mind = 0x3f3f3f3f;for(int i = 0; i < number; i++){if(vis[i] == 0 && arrive_time[i] < mind && nowtime >= arrive_time[i]){mind = arrive_time[i];u = i;} }if(u == -1)break;bg[u] = nowtime;nowtime += serve_time[u];for(int k = 0; k < serve_time[u]; k++)path.push_back(name[u]);vis[u] = nowtime;}for(int i = 0; i < number; i++){begin_time.push_back(bg[i]);end_time.push_back(vis[i]);} }void node::alo_sjp() {int vis[1005] = {0};int bg[1005] = {0};int finished = 0, nowtime = 0;while(finished < number){int u = -1, mind = 0x3f3f3f3f;for(int i = 0; i < number; i++){if(vis[i] == 0 && serve_time[i] < mind && nowtime >= arrive_time[i]){mind = serve_time[i];u = i;} }if(u == -1)break;bg[u] = nowtime;for(int k = 0; k < serve_time[u]; k++)path.push_back(name[u]);nowtime += serve_time[u];finished++;vis[u] = nowtime;}for(int i = 0; i < number; i++){begin_time.push_back(bg[i]);end_time.push_back(vis[i]);} }void node::alo_pri1() {int vis[1005] = {0};int bg[1005] = {0};int finished = 0, nowtime = 0;while(finished < number){int u = -1, mind = 0x3f3f3f3f;for(int i = 0; i < number; i++){if(vis[i] == 0 && priority[i] < mind && nowtime >= arrive_time[i]){mind = priority[i];u = i;} }if(u == -1)break;bg[u] = nowtime;for(int k = 0; k < serve_time[u]; k++)path.push_back(name[u]);nowtime += serve_time[u];vis[u] = nowtime;}for(int i = 0; i < number; i++){begin_time.push_back(bg[i]);end_time.push_back(vis[i]);} }void node::alo_pri2() {int vis[1005] = {0};int bg[1005] = {0};memset(bg, -1, sizeof(bg));int have[1005] = {0};int finished = 0, nowtime = 0;while(finished < number){int u = -1, mind = 0x3f3f3f3f;for(int i = 0; i < number; i++){if(have[i] < serve_time[i] && priority[i] < mind && nowtime >= arrive_time[i]){mind = priority[i];u = i;} }if(u == -1)break;if(bg[u] == -1)bg[u] = nowtime;nowtime ++;path.push_back(name[u]);have[u] ++;if(have[u] == serve_time[u]){vis[u] = nowtime;finished ++;}}for(int i = 0; i < number; i++){begin_time.push_back(bg[i]);end_time.push_back(vis[i]);} }void node::alo_piece(int num) {vector<string> str;int all_time = 0;int have[1005];for(int i = 0; i < number; i++){have[i] = serve_time[i];all_time += serve_time[i];}int nowtime = 0;int now = 0;while(nowtime < all_time){int t = now % number;for(int w = 0; w < num; w++){if(have[t] > 0 && nowtime >= arrive_time[t]){str.push_back(name[t]);nowtime ++;have[t] --;}}now++;}int len = str.size();for(int i = 0; i < number; i++){for(int j = len-1; j >= 0; j--){if(str[j] == name[i]){end_time.push_back(j+1);break;}}for(int i = 0; i < number; i++){for(int j = 0; j < len; j++){if(str[j] == name[i]){begin_time.push_back(j);break;}}}path = str; }

page.h

#include <bits/stdc++.h> using namespace std;class pages{public:int page_size;int page_number;vector<int> v;public:pages();void data_ini_random();void data_ini_write();void print_data();void data_cal();bool data_check(); }; pages::pages() {int menu_choice;bool data_flag = false; while(!data_flag){system("cls");printf("你選擇的是分頁方式\n");printf("請選擇數據初始化的方式：\n");printf("選擇隨機生成請輸入0\n");printf("選擇手動輸入請輸入1\n");scanf("%d", &menu_choice);if(menu_choice == 0){data_ini_random();if(!data_check()){printf("\n隨機生成的數據有誤！\n");printf("\n按任意鍵重新初始化數據：\n");getchar();getchar();}elsedata_flag = true;} else if(menu_choice == 1){data_ini_write();if(data_check())data_flag = true;}elseprintf("您的輸入有誤，請重新輸入！\n");}printf("\n您的數據初始化成功！\n"); }void pages::data_ini_random() {system("cls");printf("現在開始隨機數據初始化：\n");v.clear();int size[3] = {1,2,4};srand(unsigned(time(NULL)));page_size = size[rand()%3];printf("\n請輸入頁表項個數：\n");scanf("%d", &page_number);for(int i = 0; i < page_number; i++)v.push_back(rand()%100); }void pages::data_ini_write() {system("cls");printf("現在開始數據初始化：\n");v.clear();printf("\n請輸入每頁大小：");scanf("%d", &page_size);printf("\n請輸入頁表項個數：\n");scanf("%d", &page_number);int temp_id; bool input_flag;for(int i = 0; i < page_number; i++){while(1){printf("\n現在請輸入第%d個頁號對應的塊號：\n", i);scanf("%d", &temp_id);if(find(v.begin(), v.end(), temp_id) >= v.end()){v.push_back(temp_id);break;}else{printf("您輸入的塊號有誤！\n");int same_id;for(int j = 0; j < v.size(); j++)if(v[j] == temp_id){same_id = j;break;}printf("與第%d號頁面輸入的塊號重復\n", same_id);printf("請重新輸入第%d號頁面對應的塊號!\n", i);}}} }void pages::print_data() {printf("\n您選擇了分頁方式，輸入的數據如下：\n");printf("每頁大小%dK，頁表為：\n", page_size); printf("頁號 塊號\n");for(int i = 0; i < page_number; i++)printf("%2d %8d\n", i, v[i]);printf("\n請輸入任意鍵繼續：\n");getchar();getchar(); }void pages::data_cal() {system("cls");printf("\n請開始你的表演!\n");printf("請輸入邏輯地址：\n");int temp;bool input_flag = false;while(!input_flag){scanf("%d", &temp);if(temp <= (page_number * page_size * 1024))input_flag = true;elseprintf("您的輸入超出地址的最大范圍，請重新輸入！\n");} printf("\n您選擇了分頁方式，輸入的邏輯地址為%d\n", temp);int temp_page = temp / (page_size*1024);int delta = temp % (page_size*1024);printf("其對應的頁號為%d，頁偏移為%d\n", temp_page, delta);printf("該地址對應的塊號為%d，塊偏移為%d，物理地址為%d", v[temp_page], delta, page_size*v[temp_page]*1024 + delta);printf("\n按任意鍵繼續：\n");getchar();getchar(); }bool pages::data_check() {set<int> s;for(int i = 0; i < page_number; i++)s.insert(v[i]);if(s.size() == page_number)return true;else return false; }

總結

以上是生活随笔為你收集整理的地址转换算法 C++实现的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。