计算机操作系统实验指导书讲述.doc

实 验 目 录 实验一 动态优先权进程调度 3 实验二 作业调度 9 实验三 动态分区首次适应分配算法模拟 18 实验四 请求分页存储管理页面淘汰模拟 24 实验五 磁盘调度算法模拟 31 实验一 动态优先权进程调度 实验目的与要求： 掌握进程调度中的优先权调度算法过程； 掌握进程调度中时间片轮转调度算法的过程； 加深掌握程序在Visual C++6.0环境下的编译、调试和运行。 实验内容： 编写程序，用C语言来实现对N个进程采用动态优先权算法的进程调度。每个进程使用进程pcb结构来描述。优先数改变原则：进程在就绪队列中多呆一个时间片，优先数增加1；进程每运行一个时间片，优先数减3。 实验器材： 微机+windows操作系统+VC++6.0 实验步骤： #include iostream #include iomanip #include algorithm #include define.h using namespace std; PCB READY_QUEUE; // 就绪队列 PCB BLOCK_QUEUE; // 阻塞队列 bool compare_priority(const PCB p1, const PCB p2) { return p1.PRIORITY p2.PRIORITY; } bool compare_id(const PCB p1, const PCB p2) { return p1.ID p2.ID; } // inital PCB data PCB produces[5]= { {0,9,0,3,2,3,READY,NULL}, {1,38,0,3,-1,0,READY,NULL}, {2,30,0,6,-1,0,READY,NULL}, {3,29,0,3,-1,0,READY,NULL}, {4,0,0,4,-1,0,READY,NULL} }; // inital queue( ready queue , block queue ); void inital_queue() { READY_QUEUE.NEXT = NULL; BLOCK_QUEUE.NEXT = NULL; PCB * r = READY_QUEUE; PCB * b = BLOCK_QUEUE; // sort order by PRIORITY (DEC) sort(produces, produces[4], compare_priority); for(int i=0; i5; i++) { if(produces[i].ALLTIME == 0) { produces[i].STATE = FINISH; continue; } if(produces[i].STATE == BLOCK produces[i].BLOCKTIME == 0) {// block - ready r-NEXT = produces[i]; produces[i].STATE = READY; r = r-NEXT; } else if(produces[i].STATE == BLOCK produces[i].BLOCKTIME != 0) {// block - blcok b-NEXT = produces[i]; produces[i].STATE = BLOCK; b = b-NEXT; } else if(produces[i].STATE == READY produces[i].STARTBLOCK == 0) {// ready - block b-NEXT = produces[i]; produces[i].STATE = BLOCK; b = b-NEXT; } else if(produces[i].STATE == READY produces[i].STARTBLOCK != 0) {// ready - ready r-NEXT = produces[i]; produces[i].STATE = READY; r = r-NEXT; } } } void run() { PCB * r = READY_QUEUE.NEXT; // r point to the ready queue first pcb PCB * b = BLOCK_QUEUE.NEXT; // b point to the block queue first pcb PCB * running_pcb = r; r = r-NEXT; cout正在执行的进程 endl; cout running produces ID = running_pcb-ID en