C语言编写并调试一个模拟的进程调度程序,采用"最高动态优先数优先"(进程获得一次CPU后就将其优先数减少1)调度算法对五个进程进行调度,要求求出平均周转时间和平均带权周转时间(进程结构体中只有进程处理时间和进程优先级)
时间: 2024-05-10 12:20:45 浏览: 14
以下是一个简单的C语言代码示例,实现了最高动态优先数优先调度算法:
```
#include <stdio.h>
#define MAX_PROCESSES 5
typedef struct {
int pid; // 进程ID
int priority; // 进程优先级
int burst_time; // 进程处理时间
int remaining_time; // 进程剩余处理时间
int waiting_time; // 进程等待时间
int turnaround_time; // 进程周转时间
float weight_turnaround_time; // 进程带权周转时间
} Process;
void print_result(Process processes[]) {
int i;
float avg_turnaround_time = 0, avg_weight_turnaround_time = 0;
printf("\n\nPID\tPriority\tBurst Time\tWaiting Time\tTurnaround Time\tWeighted Turnaround Time\n");
for (i = 0; i < MAX_PROCESSES; i++) {
printf("%d\t%d\t\t%d\t\t%d\t\t%d\t\t%.2f\n", processes[i].pid, processes[i].priority,
processes[i].burst_time, processes[i].waiting_time, processes[i].turnaround_time,
processes[i].weight_turnaround_time);
avg_turnaround_time += processes[i].turnaround_time;
avg_weight_turnaround_time += processes[i].weight_turnaround_time;
}
avg_turnaround_time /= MAX_PROCESSES;
avg_weight_turnaround_time /= MAX_PROCESSES;
printf("\nAverage Turnaround Time: %.2f\n", avg_turnaround_time);
printf("Average Weighted Turnaround Time: %.2f\n", avg_weight_turnaround_time);
}
void sort_by_priority(Process processes[]) {
int i, j;
Process temp;
for (i = 0; i < MAX_PROCESSES - 1; i++) {
for (j = 0; j < MAX_PROCESSES - i - 1; j++) {
if (processes[j].priority < processes[j + 1].priority) {
temp = processes[j];
processes[j] = processes[j + 1];
processes[j + 1] = temp;
}
}
}
}
void simulate(Process processes[]) {
int i, time = 0, total_burst_time = 0;
for (i = 0; i < MAX_PROCESSES; i++) {
processes[i].remaining_time = processes[i].burst_time;
total_burst_time += processes[i].burst_time;
}
while (time < total_burst_time) {
sort_by_priority(processes);
for (i = 0; i < MAX_PROCESSES; i++) {
if (processes[i].remaining_time > 0) {
processes[i].remaining_time--;
processes[i].priority--;
if (processes[i].remaining_time == 0) {
processes[i].turnaround_time = time + 1;
processes[i].waiting_time = processes[i].turnaround_time - processes[i].burst_time;
processes[i].weight_turnaround_time = (float) processes[i].turnaround_time / processes[i].burst_time;
}
break;
}
}
time++;
}
}
int main() {
Process processes[MAX_PROCESSES] = {
{1, 5, 6},
{2, 4, 4},
{3, 3, 3},
{4, 2, 2},
{5, 1, 1}
};
simulate(processes);
print_result(processes);
return 0;
}
```
该程序定义了一个Process结构体,包含进程ID、优先级、处理时间、剩余处理时间、等待时间、周转时间和带权周转时间等属性。simulate函数模拟了最高动态优先数优先调度算法,sort_by_priority函数用于按照优先级从高到低排序,print_result函数输出结果并计算平均周转时间和平均带权周转时间。
在main函数中定义了5个进程,并调用simulate函数进行模拟,最后调用print_result函数输出结果。