操作系统先来先服务python.docx

操作系统大作业用python语言编写程序，计算每个进程分别在先来先服务，短进程优先，长进程优先下的平均周转时间，带权周转时间。其中增加了高响应比优先和优先级调度算法。123456789101112131415161718192021222324252627282930#coding=utf-8 import __main__import stringdef fcfs(come_time,run_b_t,run_e_t,run_t,order): #先来先服务 time_temp=come_time[0] for i in range(n): run_b_t[i]=time_temp run_e_t[i]=run_b_t[i]+run_t[i] time_temp=run_e_t[i] n_schedul=i order[n_schedul]=i+1 return come_time,run_b_t,run_e_t,run_t,orderdef ps(come_time,run_b_t,run_e_t,run_t,order,_prio,run_f): #优先级调度 i=0 max_priority=_prio[i] j=1 while jn and come_time[i]==come_time[j]: if _prio[j]_prio[i]: max_priorit