先来先服务算法思想:
进程按到达顺序执行,先来的进程只要开始执行就会执行到结束,这在过程中到达的进程需要等待。
代码如下:
#include<iostream>
#include<queue>
#include<algorithm>
#include<string>
#include<vector>
using namespace std;
struct shuxing{
char name; // 进程名字
double arriveTime; // 进程到达时间
double serviceTime; // 进程服务时间
friend bool operator>(shuxing n1,shuxing n2){ // 自定义比较函数
return n1.arriveTime > n2.arriveTime;
}
};
priority_queue<shuxing, vector<shuxing>, greater<shuxing> > jincheng;
// priority_queue greater: from small to large
vector<char> seq; // 存进程调度的顺序
vector<double> ks; // 存开始时间
vector<double> wc; //存完成时间
vector<double> zz; // 存周转时间
vector<double> dqzz; // 存带权周转时间
double avezz, avedqzz; // 平均周转时间和平均带权周转时间
int n; // 进程的数量
int main() {
cout << "请输入进程的数量:" << "\n";
cin >> n;
char x;
double y, z;
for(int i = 0; i < n; i ++) {
cout << "请输入第" << i + 1 << "个进程的名字,到达时间,服务时间 <例如:A,2,1>:" << "\n";
cin >> x >> y >> z;
shuxing temp;
temp.name = x;
temp.arriveTime = y;
temp.serviceTime = z;
jincheng.push(temp);
}
double start = -1;
double finish = -1;
while(!jincheng.empty()) { // 优先队列模拟
shuxing temp = jincheng.top();
jincheng.pop();
seq.push_back(temp.name); // 存调度的进程
start = max(finish, temp.arriveTime);
ks.push_back(start); // 存开始时间
finish = start + temp.serviceTime;
wc.push_back(finish); //存完成时间
zz.push_back(finish - temp.arriveTime); // 存周转时间
avezz += (finish - temp.arriveTime); // 平均周转时间
dqzz.push_back((finish - temp.arriveTime) / temp.serviceTime); // 存带权周转时间
avedqzz += ((finish - temp.arriveTime) / temp.serviceTime); //平均带权周转时间
}
cout << "\n执行顺序:\t";
for(int i = 0; i < n; i ++)
cout << seq[i] << "\t";
cout << "\n";
cout << "\n开始时间:\t";
for(int i = 0; i < n; i ++)
cout << ks[i] << "\t";
cout << "\n";
cout << "\n完成时间:\t";
for(int i = 0; i < n; i ++)
cout << wc[i] << "\t";
cout << "\n";
cout << "\n周转时间:\t";
for(int i = 0; i < n; i ++)
cout << zz[i] << "\t";
cout << "\n";
cout << "\n带权周转时间:\t";
for(int i = 0; i < n; i ++)
printf("%.2lf\t", dqzz[i]);
cout << "\n";
cout << "\n平均周转时间:";
printf("\t\t%.2lf\n", avezz / n);
cout << "\n平均带权周转时间:";
printf("\t%.2lf", avedqzz / n);
return 0;
}