###先来先服务作业调度算法
import sys
#生成一个job
class Job:
def __init__(self,task_id,arrive_time,run_time,level):
self.arrive_time = arrive_time
self.run_time = run_time
self.level = level
self.task_id = task_id
class Schedule:
#任务队列
procession = []
#已存在任务队列id表
procession_ids = []
#
# 运行细节情况:
# 到达时间,运行完成时间,周转时间,带权周转时间
runTaskDetail = []
def __init__(self):
pass
def add_job(self,Job):
if Job.task_id in self.procession_ids:
print("任务ID:"+Job.task_id+"已存在,跳过")
self.procession_ids.append(Job.task_id)
self.procession.append(Job)
def run_job(self):
#使用冒泡麦序算法将运行进度算一下
sumTaskNum = len(self.procession_ids)
for i in range(sumTaskNum - 1):
for j in range(sumTaskNum - i - 1):
if self.procession[j].arrive_time > self.procession[j+1].arrive_time:
self.procession[j],self.procession[j+1] = self.procession[j+1],self.procession[j]
#总运行时间
sumRunSeconds = 0
#开始工作任务
while self.procession:
nowJob = self.procession[0]
if nowJob.arrive_time > sumRunSeconds:
sumRunSeconds = nowJob.arrive_time
sumRunSeconds += nowJob.run_time
revolve_time = sumRunSeconds-nowJob.arrive_time
self.runTaskDetail.append({
'task_id':nowJob.task_id,
'arrive_time':nowJob.arrive_time,
'run_time':nowJob.run_time,
'revolve_time':revolve_time,
'right_revolve_time':revolve_time // nowJob.run_time
})
self.procession.remove(nowJob)
self.procession_ids.remove(nowJob.task_id)
def printProcessor(detail):
print("到达时间|运行时间|周转时间|带权周转时间")
count = len(detail)
for i in range(count):
print(str(detail[i]['arrive_time'])+"|"+str(detail[i]['run_time'])+"|"+str(detail[i]['revolve_time'])+"|"+str(detail[i]['right_revolve_time']))
if __name__ == "__main__":
schedule = Schedule()
schedule.add_job(Job(1, 0, 4, 6))
schedule.add_job(Job(2, 2, 10, 7))
schedule.add_job(Job(3, 3, 1, 12))
schedule.add_job(Job(4, 5, 5, 1))
schedule.add_job(Job(5, 4, 12, 4))
schedule.run_job()
printProcessor(schedule.runTaskDetail)
python实现FCFS算法
最新推荐文章于 2024-04-30 11:11:45 发布