作业调度算法的实现

个人练习

输入&＃xff1a;作业序列&＃xff0c;即一系列要执行的作业&＃xff0c;每个作业包括三个数据项&＃xff1a;
作业号、作业进入系统的时间&＃xff08;用一整数表示&＃xff0c;如 10&＃xff1a;10&＃xff0c;表示成 1010&＃xff09;、
估计执行时间&＃xff08;单位分&＃xff09;
3
参数用空格隔开&＃xff0c;下面是示例&＃xff1a;
1 800 50
2 815 30
3 830 25
4 835 20
5 845 15
6 900 10
7 920 5
按不同的调度算法输出作业序列&＃xff0c;进入内存的时间&＃xff1b;每行输出一个作业信息

#include
using namespace std;struct JOB {char name[10];//进程名int arrivetime;//到达时间int runtime;//运行时间int starttime;//开始时间int endtime;//完成时间int zztime;//周转时间double dqzztime;//带权周转时间int time;int R;//响应比算法优先级
};JOB z[100];//定义一个结构体数组/*时间转换*/
int time_hm(int n) {int a;int b;int time_min;a &＃61; (int)n * 1.0 / 100;b &＃61; n % 100;time_min &＃61; a * 60 &＃43; b;return time_min;
}int time_mh(int n) {int a;int b;int time;a &＃61; (int)n * 1.0 / 60;b &＃61; n % 60;time &＃61; a * 100 &＃43; b;return time;
}/*输入函数*/
void input(JOB* p, int n) {int i;cout << "请输入作业编号&＃xff0c;到达时间&＃xff0c;运行时间" << endl;for (i &＃61; 0; i <&＃61; n - 1; i&＃43;&＃43;) {cout << "输入作业" << i &＃43; 1 << "的信息&＃xff1a;" << endl;cin >> z[i].name >> z[i].time >> z[i].runtime;z[i].arrivetime &＃61; time_hm(z[i].time);}
}/*输出函数*/
void print(JOB* p, int arrivetime, int runtime, int starttime, int endtime, int zztime, double dqzztime, int n) {int k;cout << "执行顺序&＃xff1a;";cout << z[0].name;for (k &＃61; 1; k < n; k&＃43;&＃43;) {cout << "->" << z[k].name;}cout << endl;cout << "作业信息如下" << endl;cout << "到达时间 " << "开始时间 " << "结束时间 " << "运行时间 " << "周转时间 " << "带权周转时间 " << endl;for (k &＃61; 0; k <&＃61; n - 1; k&＃43;&＃43;) {cout << time_mh(z[k].arrivetime) << " " << time_mh(z[k].starttime) << " " << time_mh(z[k].endtime) << " " << z[k].runtime << " " << z[k].zztime << " " << z[k].dqzztime << endl;}
}/*按到达时间排序*/
void sort(JOB* p, int n) {for (int i &＃61; 0; i <&＃61; n - 1; i&＃43;&＃43;) {for (int j &＃61; 0; j <&＃61; i; j&＃43;&＃43;) {if (z[i].arrivetime < z[j].arrivetime) {JOB temp;temp &＃61; z[i];z[i] &＃61; z[j];z[j] &＃61; temp;}}}
}/*运行*/
void deal(JOB* p, int arrivetime, int runtime, int starttime, int endtime, int zztime, double dqzztime, int n) {int k;for (k &＃61; 0; k <&＃61; n - 1; k&＃43;&＃43;) {if (k &＃61;&＃61; 0) {//第一个到达的作业z[k].starttime &＃61; z[k].arrivetime;z[k].endtime &＃61; z[k].arrivetime &＃43; z[k].runtime;}else {if (z[k - 1].endtime >&＃61; z[k].arrivetime) {z[k].starttime &＃61; z[k - 1].endtime;}else {z[k].starttime &＃61; z[k].arrivetime;}z[k].endtime &＃61; z[k].starttime &＃43; z[k].runtime;}}for (k &＃61; 0; k <&＃61; n - 1; k&＃43;&＃43;) {z[k].zztime &＃61; z[k].endtime - z[k].arrivetime;//周转z[k].dqzztime &＃61; z[k].zztime * 1.0 / z[k].runtime;//带权周转}
}/*先进先出算法FIFO*/
void FIFO(JOB* p, int n) {cout << endl;cout << "----------先进先出算法----------" << endl;int arrivetime &＃61; 0, runtime &＃61; 0, starttime &＃61; 0, endtime &＃61; 0, zztime &＃61; 0, dqzztime &＃61; 0;//初始化sort(p, n);//按到达顺序排好deal(p, arrivetime, runtime, starttime, endtime, zztime, dqzztime, n);print(p, arrivetime, runtime, starttime, endtime, zztime, dqzztime, n);}/*短作业优先调度算法*/
void SJF(JOB* p, int n) {cout << endl;cout << "----------短作业优先调度算法----------" << endl;int arrivetime &＃61; 0, runtime &＃61; 0, starttime &＃61; 0, endtime &＃61; 0, zztime &＃61; 0, dqzztime &＃61; 0;//初始化sort(p, n);for (int m &＃61; 0; m < n - 1; m&＃43;&＃43;) {if (m &＃61;&＃61; 0) z[m].endtime &＃61; z[m].arrivetime &＃43; z[m].runtime;//第一个到达的作业else {if (z[m - 1].endtime >&＃61; z[m].arrivetime) {//后一个到达时上一个未结束z[m].starttime &＃61; z[m - 1].endtime;}else {//后一个到达时上一个已经结束z[m].starttime &＃61; z[m].arrivetime;}z[m].endtime &＃61; z[m].starttime &＃43; z[m].runtime;//结束时间&＃61;开始时间&＃43;运行时间}int i &＃61; 0;for (int g &＃61; m &＃43; 1; g <&＃61; n - 1; g&＃43;&＃43;) {//目前作业结束&＃xff0c;等待中的作业if (z[g].arrivetime <&＃61; z[m].endtime)i&＃43;&＃43;;}//按服务时间排序float min &＃61; z[m &＃43; 1].runtime;int next &＃61; m &＃43; 1;for (int k &＃61; m &＃43; 1; k < m &＃43; i; k&＃43;&＃43;) {if (z[k &＃43; 1].runtime < min) {min &＃61; z[k &＃43; 1].runtime;next &＃61; k &＃43; 1;}}JOB temp;temp &＃61; z[m &＃43; 1];z[m &＃43; 1] &＃61; z[next];z[next] &＃61; temp;}deal(p, arrivetime, runtime, starttime, endtime, zztime, dqzztime, n);print(p, arrivetime, runtime, starttime, endtime, zztime, dqzztime, n);
}/*最高响应比优先算法HRN*/
void HRN(JOB* p, int n) {cout << endl;cout << "----------最高响应比优先算法----------" << endl;int arrivetime &＃61; 0, runtime &＃61; 0, starttime &＃61; 0, endtime &＃61; 0, zztime &＃61; 0, dqzztime &＃61; 0;//初始化sort(p, n);for (int m &＃61; 0; m < n - 1; m&＃43;&＃43;) {if (m &＃61;&＃61; 0) z[m].endtime &＃61; z[m].arrivetime &＃43; z[m].runtime;else {if (z[m - 1].endtime >&＃61; z[m].arrivetime) {z[m].starttime &＃61; z[m - 1].endtime;}else {z[m].starttime &＃61; z[m].arrivetime;}z[m].endtime &＃61; z[m].starttime &＃43; z[m].runtime;}int i &＃61; 0;for (int g &＃61; m &＃43; 1; g <&＃61; n - 1; g&＃43;&＃43;) {if (z[g].arrivetime <&＃61; z[m].endtime)i&＃43;&＃43;;}for (int l &＃61; 0; l <&＃61; n; l&＃43;&＃43;) {//响应比为1&＃43;(作业等待时间/作业处理时间)z[l].R &＃61; 1 &＃43; (z[l].starttime - z[l].arrivetime) * 1.0 / z[l].runtime;}//按响应比排序float max &＃61; z[m &＃43; 1].R;int next &＃61; m &＃43; 1;for (int k &＃61; m &＃43; 1; k < m &＃43; i; k&＃43;&＃43;) {if (z[k &＃43; 1].R > max) {max &＃61; z[k &＃43; 1].R;next &＃61; k &＃43; 1;}}JOB temp;temp &＃61; z[m &＃43; 1];z[m &＃43; 1] &＃61; z[next];z[next] &＃61; temp;}deal(p, arrivetime, runtime, starttime, endtime, zztime, dqzztime, n);print(p, arrivetime, runtime, starttime, endtime, zztime, dqzztime, n);
}int main() {int n;cout << "请输入作业个数&＃xff1a;" << endl;JOB* b &＃61; z;cin >> n;input(z, n);FIFO(b, n);SJF(b, n);HRN(b, n);
}


测试结果