非抢占式短进程优先计算平均周转时间

嘻嘻哈哈的小神童@

已于 2023-11-19 18:17:35 修改

阅读量199

点赞数

文章标签：算法 visual studio code c语言 c++

于 2023-11-19 18:09:34 首次发布

本文链接：https://blog.csdn.net/m0_61919506/article/details/134492573

版权

#include <stdio.h> 
#include <stdlib.h>

typedef struct {
    int id;       //id执行顺序 
    float ready;  //ready到达时间 
    float run;    //run运行时间 
    float finish; //finish完成时间 
    float around; //around周转时间 
} Process;

int compare(const void *a, const void *b) {
    const Process *p1 = (const Process *)a;
    const Process *p2 = (const Process *)b;
    return p1->run - p2->run;
}

int main() {
    int i, j, n;
    float sum = 0;//总周转时间 

    printf("输入进程的个数: ");
    scanf("%d", &n);
    //动态分配内存以存储进程
    Process *processes = (Process *)malloc(n * sizeof(Process));

    for (i = 0; i < n; i++) {
        printf("请输入第%d个进程的到达时间和执行时间：\n", i + 1);
        printf("到达时间: ");
        scanf("%f", &processes[i].ready);
        printf("执行时间: ");
        scanf("%f", &processes[i].run);
        processes[i].id = i + 1;
    }

    // 执行第一个到达的进程
    processes[0].finish = processes[0].ready + processes[0].run;
    processes[0].around = processes[0].finish - processes[0].ready;
    sum += processes[0].around;

    // 用qsort函数按照执行时间进行排序
    qsort(processes + 1, n - 1, sizeof(Process), compare);

    // 继续执行剩余进程
    for (i = 1; i < n; i++) {
        if (processes[i].ready > processes[i - 1].finish) {
            processes[i].finish = processes[i].ready + processes[i].run;
        } else {
            processes[i].finish = processes[i - 1].finish +
			 processes[i].run;
        }
        processes[i].around = processes[i].finish - processes[i].ready;
        sum += processes[i].around;
    }

    printf("进程\t到达时间\t执行时间\t完成时间\t周转时间\n");
    for (i = 0; i < n; i++) {
        printf("%d\t%.2f\t\t%.2f\t\t%.2f\t\t%.2f\n", processes[i].id, 
		processes[i].ready, processes[i].run, processes[i].finish, 
		processes[i].around);
    }

    printf("平均周转时间为: %.2f\n", sum / n);

    free(processes);

    return 0;
}