文档介绍：word
word
1 / 43
word
《操作系统》实验报告
题目：作业调度算法
班级：网络工程
：朱***
学号：E31314037
word
word
2 / 43
word
float rel_time = 0;
struct work temp;
int i;
struct work w[5];
srand(time(0));
word
word
8 / 43
word
for(i=0;i<5;i++)
{
w[i].id = rand()%10;
w[i].arrive_time = rand()%10;
w[i].work_time = rand()%10+1;
}
for(j=0;j<5;j++)
{
printf("第%d个作业的编号是：%d\t",j+1,w[j].id);
printf("第%d个作业到达时间：%d\t",j+1,w[j].arrive_time);
printf("第%d个作业服务时间：%d\t",j+1,w[j].work_time);
printf("\n");
}
word
word
9 / 43
word
for(j=1;j<5;j++)
for(k=0;k<5-j;k++)
{
if(w[k].arrive_time > w[k+1].arrive_time)
{
temp = w[k];
w[k] = w[k+1];
w[k+1] = temp;
}
}
printf("\n");
w_finish_time[0] = w[0].arrive_time + w[0].work_time;
for(j=0;j<5;j++)
{
if(w_finish_time[j] < w[j+1].arrive_time)
word
word
10 / 43
word
{
w_finish_time[j+1] = w[j+1].arrive_time + w[j+1].work_time;
}
else
w_finish_time[j+1] = w_finish_time[j] + w[j+1].work_time;
}
for(j=0;j<5;j++)
w_rel_time[j] = w_finish_time[j] - w[j].arrive_time;
for(j=0;j<5;j++)
{
rel_time += w_rel_time[j];
}
word
word
11 / 43
word
for(j=0;j<5;j++)
{
printf("第%d个系统执行的作业到达时间：%d ",j+1,w[j].arrive_time);
printf("编号是：%d ",w[j].id);
printf("服务时间是：%d ",w[j].work_time);
printf("完成时间是：%d ",w_finish_time[j]);
printf("周转时间是：%d ",w_rel_time[j]);
printf("\n");
}
printf("平均周转时间：%f\n",rel_time/5);
}
void SJF()
word
word
12 / 43
word
{
int w_rel_time[10];
int w_finish_time[10];
float rel_time = 0;
srand(time(0));
int i;
int j = 0;
PNODE pHead = (PNODE)malloc(sizeof(NODE));
if (NULL == pHead)
{
printf("分配失败, 程序终止!\n");
exit(-1);
}
PNODE pTail = pHead;
pTail->pNext = NULL; //定义该链表有头结点，且第一个节点初始化为空
word
word
13 / 43
word
for(i=0;i<10;i++)
{
PNODE pNew = (PNODE)malloc(sizeof(NODE));
if (NULL == pNew)
{
printf("分配失败, 程序终止!\n");
exit(-1);
}
pNew-> = rand()%100;
pNew-> = rand()%10;
pNew->