非抢占式时间片轮转调度法的c语言代码
时间: 2023-10-21 15:04:22 浏览: 54
下面是一个简单的非抢占式时间片轮转调度算法的 C 语言代码:
#include<stdio.h>
#include<stdlib.h>
struct Process {
int pid;
int burst_time;
int arrival_time;
int waiting_time;
int turn_around_time;
int remaining_time;
};
// 计算等待时间和周转时间
void calculate_time(struct Process p[], int n) {
int i, t = 0, total_wt = 0, total_tat = 0;
float avg_wt, avg_tat;
// 计算每个进程的等待时间和周转时间
for (i = 0; i < n; i++) {
p[i].remaining_time = p[i].burst_time;
}
while (1) {
int done = 1;
for (i = 0; i < n; i++) {
if (p[i].remaining_time > 0) {
done = 0;
if (p[i].remaining_time > t) {
t = p[i].arrival_time + t;
} else {
t = t + p[i].remaining_time;
p[i].turn_around_time = t - p[i].arrival_time;
p[i].waiting_time = p[i].turn_around_time - p[i].burst_time;
total_wt = total_wt + p[i].waiting_time;
total_tat = total_tat + p[i].turn_around_time;
p[i].remaining_time = 0;
}
}
}
if (done == 1) break;
}
// 计算平均等待时间和平均周转时间
avg_wt = (float) total_wt / n;
avg_tat = (float) total_tat / n;
// 输出结果
printf("\n%s\t%s\t%s\t%s\t%s\n", "Process", "Burst time", "Arrival time", "Waiting time", "Turnaround time");
for (i = 0; i < n; i++) {
printf("P%d\t%d\t\t%d\t\t%d\t\t%d\n", p[i].pid, p[i].burst_time, p[i].arrival_time, p[i].waiting_time, p[i].turn_around_time);
}
printf("\nAverage waiting time: %f\n", avg_wt);
printf("Average turnaround time: %f\n", avg_tat);
}
int main() {
int n, i;
printf("Enter number of processes:\n");
scanf("%d", &n);
struct Process p[n];
printf("Enter process details:\n");
printf("Pid, Burst time, Arrival time\n");
for (i = 0; i < n; i++) {
scanf("%d %d %d", &p[i].pid, &p[i].burst_time, &p[i].arrival_time);
}
calculate_time(p, n);
return 0;
}