进程调度算法实验报告

=p1->next;Р p1->next=p2->next;Р p2->next=p1;Р }Р }Р //时刻变化Р if(head->front->runtime<q)Р t=t+head->front->runtime;Р elseР t=t+q;Р }Р /*************第一种情况结束**************/Р /******************第二种情况:当期运行的时间大于最后一个进程到达的时间做以下操作*********************/Р while(t>=lt)Р {Р p1=head->front;Р printf("%2d %s",t,p1->Name);Р p1->runtime=p1->runtime-q;Р //1.运行时间小于0,删除队首Р if(p1->runtime<=0)Р {Р p1->state='C';Р printf(" %c\n",p1->state);Р p1->FinishTime=t;Р p1->WeightTime=p1->FinishTime-p1->arrivetime;Р p1->WeightWholeTime=p1->WeightTime/p1->wholetime;Р SumWT+=p1->WeightTime;Р SumWWT+=p1->WeightWholeTime;Р printf("时刻%2d进程%s运行结束,进程%s周转时间=%5.2f,带权周转时间=%5.2f\n",t,p1->Name,p1->Name,p1->WeightTime,p1->WeightWholeTime);Р //printf("时刻%2d进程%s运行结束",t,p1->pname);Р head->front=p1->next;Р free(p1);Р Р }Р //2.运行时间大于0,直接插在队尾