实验三 利用预约表编程计算非线性流水线的任务调度方案.doc

实验三_利用预约表编程计算非线性流水线的任务调度方案实验目的通过本实验帮助学生理解单功能非线性流水线基本任务调度方法。实验环境开发工具使用windows平台下的vc++。实验内容给定某单功能非线性流水线的预约表,通过编程求出所有不冲突的任务调度方案并输出。流水线功能段数随机。实验结果#include<>#include<>#include<>#include<>constintMAXJOB=50;//定义数据结构体typedefstructnode{ intnumber; intreach_time; intreach_hour; intreach_minite; intneed_time; intprivilege; floatexcellent; intstart_time; intwait_time; intvisited;}job; jobjobs[MAXJOB];intquantity;//初始化函数voidinitial(){ inti; for(i=0;i<MAXJOB;i++){ jobs[i].number=0; jobs[i].reach_time=0; jobs[i].reach_hour=0; jobs[i].reach_minite=0; jobs[i].privilege=0; jobs[i].excellent=0; jobs[i].start_time=0; jobs[i].wait_time=0; jobs[i].visited=0; } quantity=0;}voidreset()//重置作业数据函数{inti;for(i=0;i<MAXJOB;i++){ jobs[i].start_time=0; jobs[i].wait_time=0; jobs[i].visited=0;}}voidreadData()//读入作业数据函数{ FILE*fp; charfname[20]; inti; cout<<"请输入作业数据文件名:"; strcpy(fname,""); cin>>fname; if((fp=fopen(fname,"r"))==NULL){ cout<<"错误,文件打不开,请检查文件名:)"<<endl; } else{ while(!feof(fp)){ fscanf(fp,"%d%d%d%d",&jobs[quantity].number,&jobs[quantity].reach_time,&jobs[quantity].need_time,&jobs[quantity].privilege); jobs[quantity].reach_hour=jobs[quantity].reach_time/100; jobs[quantity].reach_minite=jobs[quantity].reach_time%100; quantity++; } //输出初始作业数据 cout<<"输出初始作业数据"<<endl; cout<<"---------------------------------------------------------------"<<endl; (2); cout<<setw(10)<<"作业号"<<setw