操作系统课程设计报告 B10521 张路生.doc

C+程序设计课程设计报告目录第一章 绪论1第二章 系统设计及实现22.1 进程调度算法22.1.1 先来先服务22.1.2 短作业优先22.1.3 优先级调度22.1.4 调试与运行22.2 生产者与消费者问题模拟3第三章 总结4参考文献5 第一章 绪论本程序实现的是进程调度算法：设计地点：教七二楼机房；设计目的：了解进程调度算法，选择适当的进程调度算法；设计的意义：通过对几种算法的比较，了解各种算法的性能，使其磁盘驱动能够更好的运行；设计内容：本次设计包括三种调度算法先来先服务；短作业优先；优先级算法实验的环境：在VC+下运行。 第二章 系统设计及实现2.1 进程调度系统设计2.1.1 进程调度方法 1、先来先服务算法 2、短作业优先 3、优先级算法2.1.2 源代码#include using namespace std;#define MAX 10struct task_struct char name10; /*进程名称*/ int number; /*进程编号*/ float come_time; /*到达时间*/ float run_begin_time; /*开始运行时间*/ float run_time; /*运行时间*/ float run_end_time; /*运行结束时间*/ int priority; /*优先级*/ int order; /*运行次序*/ int run_flag; /*调度标志*/ tasksMAX;int counter; /*实际进程个数*/int fcfs(); /*先来先服务*/int ps(); /*优先级调度*/int sjf(); /*短作业优先*/int hrrn(); /*响应比高优先*/int pinput(); /*进程参数输入*/int poutput(); /*调度结果输出*/void main() int option;int flag=1;char yesno;while(flag) pinput();int tag=1; while(tag) printf(请选择调度算法（04）:n);printf(1.先来先服务n);printf(2.优先级调度n);printf(3.短作业优先n);printf(4.响应比高优先n);printf(0.退出n);scanf(%d,&option);switch (option) case 0: printf(运行结束。n); flag=0;tag=0; break; case 1: printf(对进程按先来先服务调度。nn); fcfs(); poutput(); printf(您还要进行本项调度或其他调度吗？是请按y或者Y); scanf(%s,&yesno); if(yesno!=y&yesno!=Y) tag=0; break;case 2: printf(对进程按优先级调度。nn); ps(); poutput(); printf(您还要进行本项调度或其他调度吗？是请按y或者Y); scanf(%s,&yesno); if(yesno!=y&yesno!=Y) tag=0; break;case 3: printf(对进程按短作业优先调度。nn); sjf(); poutput(); printf(您还要进行本项调度或其他调度吗？是请按y或者Y); scanf(%s,&yesno); if(yesno!=y&yesno!=Y) tag=0; break;case 4: printf(对进程按响应比高优先调度。nn); hrrn(); poutput(); printf(您还要进行本项调度或其他调度吗？是请按y或者Y); scanf(%s,&yesno); if(yesno!=y&yesno!=Y) tag=0; break; int fcfs() /*先来先服务*/float time_temp=0;int i;int number_schedul;time_temp=e_time;for(i=0;icounter;i+) tasksi.run_begin_time=time_temp; tasksi.run_end_time=tasksi.run_begin_time+tasksi.run_time; tasksi.run_flag=1; time_temp=tasksi.run_end_time; number_schedul=i; tasksnumber_schedul.order=i+1;return 0;int ps() /*优先级调度*/float temp_time=0;int i=0,j;int number_schedul,temp_counter;int max_priority;max_priority=tasksi.priority;j=1;while (jtasksi.priority) max_priority=tasksj.priority; i=j; j+; /*查找第一个被调度的进程*/*对第一个被调度的进程求相应的参数*/number_schedul=i;tasksnumber_schedul.run_begin_time=tasksnumber_e_time;tasksnumber_schedul.run_end_time=tasksnumber_schedul.run_begin_time+tasksnumber_schedul.run_time;tasksnumber_schedul.run_flag=1;temp_time=tasksnumber_schedul.run_end_time;tasksnumber_schedul.order=1;temp_counter=1;while (temp_countercounter) max_priority=0; for(j=0;jcounter;j+) if(e_timemax_priority) max_priority=tasksj.priority; number_schedul=j; /*查找下一个被调度的进程*/ /*对找到的下一个被调度的进程求相应的参数*/ tasksnumber_schedul.run_begin_time=temp_time; tasksnumber_schedul.run_end_time=tasksnumber_schedul.run_begin_time+tasksnumber_schedul.run_time;tasksnumber_schedul.run_flag=1;temp_time=tasksnumber_schedul.run_end_time;temp_counter+;tasksnumber_schedul.order=temp_counter; return 0;int sjf() /*短作业优先*/float temp_time=0;int i=0,j;int number_schedul,temp_counter;float run_time;run_time=tasksi.run_time;j=1;while (jcounter)&(e_time=e_time) if (tasksj.run_timetasksi.run_time) run_time=tasksj.run_time; i=j; j+; /*查找第一个被调度的进程*/*对第一个被调度的进程求相应的参数*/number_schedul=i;tasksnumber_schedul.run_begin_time=tasksnumber_e_time;tasksnumber_schedul.run_end_time=tasksnumber_schedul.run_begin_time+tasksnumber_schedul.run_time;tasksnumber_schedul.run_flag=1;temp_time=tasksnumber_schedul.run_end_time;tasksnumber_schedul.order=1;temp_counter=1;while (temp_countercounter) for(j=0;jcounter;j+) if(e_time=temp_time)&(!tasksj.run_flag) run_time=tasksj.run_time;number_schedul=j;break; for(j=0;jcounter;j+) if(e_time=temp_time)&(!tasksj.run_flag) if(tasksj.run_timerun_time) run_time=tasksj.run_time; number_schedul=j; /*查找下一个被调度的进程*/ /*对找到的下一个被调度的进程求相应的参数*/ tasksnumber_schedul.run_begin_time=temp_time; tasksnumber_schedul.run_end_time=tasksnumber_schedul.run_begin_time+tasksnumber_schedul.run_time; tasksnumber_schedul.run_flag=1; temp_time=tasksnumber_schedul.run_end_time; temp_counter+; tasksnumber_schedul.order=temp_counter; return 0;int hrrn() /*响应比高优先*/ int j,number_schedul,temp_counter;float temp_time,respond_rate,max_respond_rate;/*第一个进程被调度*/tasks0.run_begin_time=e_time;tasks0.run_end_time=tasks0.run_begin_time+tasks0.run_time;temp_time=tasks0.run_end_time;tasks0.run_flag=1;tasks0.order=1;temp_counter=1;/*调度其他进程*/while(temp_countercounter) max_respond_rate=0; for(j=1;jcounter;j+) if(e_timemax_respond_rate) max_respond_rate=respond_rate; number_schedul=j; /*找响应比高的进程*/ tasksnumber_schedul.run_begin_time=temp_time; tasksnumber_schedul.run_end_time=tasksnumber_schedul.run_begin_time+tasksnumber_schedul.run_time; temp_time=tasksnumber_schedul.run_end_time; tasksnumber_schedul.run_flag=1; temp_counter+=1; tasksnumber_schedul.order=temp_counter; return 0;int pinput() /*进程参数输入*/ int i; printf(please input the process counter:n); scanf(%d,&counter);for(i=0;icounter;i+) printf(*n); printf(please input the process of %d th :n,i+1); printf(please input the name:n); scanf(%s,); printf(please input the number:n); scanf(%d,&tasksi.number); e_time=rand()%11; tasksi.run_time=rand()%11; tasksi.priority=rand()%11; tasksi.run_begin_time=0; tasksi.run_end_time=0; tasksi.order=0; tasksi.run_flag=0;return 0;int poutput() /*调度结果输出*/int i;float turn_round_time=0,f1,w=0;printf(name number come_time run_time run_begin_time run_end_time priority order turn_round_timen);for(i=0;icounter;i+) f1=tasksi.run_end_e_time; turn_round_time+=f1; w+=(f1/tasksi.run_time); printf( %s, %d, %5.3f, %5.3f, %5.3f, %5.3f, %d, %d, %5.3fn,,tasksi.number,e_time,tasksi.run_time,tasksi.run_begin_time,tasksi.run_end_time,tasksi.priority,tasksi.order,f1);printf(average_turn_round_timer=%5.2fn,turn_round_time/counter);printf(weight_average_turn_round_timer=%5.2fn,w/counter);return 0;2.1.3调试与运行2.2 生产者与消费者算法模拟2.2.1 源代码#include #include const unsigned short SIZE_OF_BUFFER = 10; /缓冲区长度unsigned short ProductID = 0; /产品号unsigned short ConsumeID = 0; /将被消耗的产品号unsigned short in = 0; /产品进缓冲区时的缓冲区下标unsigned short out = 0; /产品出缓冲区时的缓冲区下标int g_bufferSIZE_OF_BUFFER; /缓冲区是个循环队列bool g_continue = true; /控制程序结束HANDLE g_hMutex; /用于线程间的互斥HANDLE g_hFullSemaphore; /当缓冲区满时迫使生产者等待HANDLE g_hEmptySemaphore; /当缓冲区空时迫使消费者等待DWORD WINAPI Producer(LPVOID); /生产者线程DWORD WINAPI Consumer(LPVOID); /消费者线程int main() /创建各个互斥信号 g_hMutex = CreateMutex(NULL,FALSE,NULL); g_hFullSemaphore = CreateSemaphore(NULL,SIZE_OF_BUFFER-1,SIZE_OF_BUFFER-1,NULL); g_hEmptySemaphore = CreateSemaphore(NULL,0,SIZE_OF_BUFFER-1,NULL); /调整下面的数值，可以发现，当生产者个数多于消费者个数时， /生产速度快，生产者经常等待消费者；反之，消费者经常等待 const unsigned short PRODUCERS_COUNT = 3; /生产者的个数 const unsigned short CONSUMERS_COUNT = 1; /消费者的个数 /总的线程数 const unsigned short THREADS_COUNT = PRODUCERS_COUNT+CONSUMERS_COUNT; HANDLE hThreadsPRODUCERS_COUNT; /各线程的handle DWORD producerIDCONSUMERS_COUNT; /生产者线程的标识符 DWORD consumerIDTHREADS_COUNT; /消费者线程的标识符 /创建生产者线程 for (int i=0;iPRODUCERS_COUNT;+i) hThreadsi=CreateThread(NULL,0,Producer,NULL,0,&producerIDi); if (hThreadsi=NULL) return -1; /创建消费者线程 for (i=0;iCONSUMERS_COUNT;+i) hThreadsPRODUCERS_COUNT+i=CreateThread(NULL,0,Consumer,NULL,0,&consumerIDi); if (hThreadsi=NULL) return -1; while(g_continue) if(getchar() /按回车后终止程序运行 g_continue = false; return 0;/生产一个产品。简单模拟了一下，仅输出新产品的ID号void Produce() std:cerr Producing +ProductID . ; std:cerr Succeed std:endl;/把新生产的产品放入缓冲区void Append() std:cerr Appending a product . ; g_bufferin = ProductID; in = (in+1)%SIZE_OF_BUFFER; std:cerr Succeed std:endl; /输出缓冲区当前的状态 for (int i=0;iSIZE_OF_BUFFER;+i) std:cout i : g_bufferi; if (i=in) std:cout - 生产; if (i=out) std:cout - 消费; std:cout std:endl; /从缓冲区中取出一个产品void Take() std:cerr Taking a product . ; ConsumeID = g_bufferout; out = (out+1)%SIZE_OF_BUFFER; std:cerr Succeed std:endl; /输出缓冲区当前的状态 for (int i=0;iSIZE_OF_BUFFER;+i) std:cout i : g_bufferi; if (i=in) std:cout - 生产; if (i=out) std:cout - 消费; std:cout std:endl; /消耗一个产品void Consume() std:cerr Consuming ConsumeID . ; std:cerr Succeed std:endl;/生产者DWORD WINAPI Producer(LPVOID lpPara) while(