操作系统时间片轮回算法+优先级调度算法python实现

# priority algorithm.优先级调度算法 + 时间片轮回算法python实现
from collections import deque
import time
import random

class PCB:

    def __init__(self, priority, hold_time, come_time,  status = 0):
        """
        :param status: PCB 进程控制块状态:0为等待态, 1为执行态
        :param priority: 优先级别:0, 1, 2, 3, 4, ...
        :param hold_time: 处理机占用时间
        :param come_time: 进入进程队列时间
        """
        self.status = status
        self.priority = priority
        self.hold_time = hold_time
        self.come_time = come_time
        self.progress_name = random.randint(1000, 9999)

    def __str__(self):
        return str(self.progress_name) + "\t" + str(self.priority) + "\t\t\t" + \
               str(self.come_time) + "\t\t\t" + str(self.hold_time) + "\t\t\t\t" + \
               str('就绪态' if self.status == 0 else '执行态')

class PriorityAlgorithm:

    def __init__(self):
        self.progresses = []
        self.__progresses_in()
        self.max_index = -1

    def __progresses_in(self):
        self.progresses.append(PCB(1, 10, 0))
        self.progresses.append(PCB(3, 3, 0.2))
        self.progresses.append(PCB(2, 2, 0.4))
        self.progresses.append(PCB(5, 5, 0.5))
        self.progresses.append(PCB(4, 1, 0.8))
        self.progresses.append(PCB(7, 9, 1.2))
        self.progresses.append(PCB(6, 6, 1.5))

    def print_all_progresses(self):
        print("当前队列中就绪的进程有:")
        print(str('name') + "\t" + str('priority') + "\t" + \
               str('come_time') + "\t" + str('execute_time') + "\t" + \
               str('status'))
        for i in range(len(self.progresses)):
            print(self.progresses[i])

    def execute_progress(self):
        while len(self.progresses) > 0:
            for i in range(len(self.progresses)):
                self.max_index = self.get_max_priority_index()
                self.progresses[self.max_index].hold_time -= 1
                if self.progresses[self.max_index].hold_time <= 0:
                    self.progresses.remove(self.progresses[self.max_index])
                self.print_all_progresses()
                time.sleep(1)
            self.__change_priority()
            print("===============================一次时间片轮回后结果:================================")
            self.print_all_progresses()
            time.sleep(1)

    def get_max_priority_index(self):
        max_index = 0
        for i in range(len(self.progresses)):
            if self.progresses[i].priority > self.progresses[max_index].priority:
                max_index = i
        self.progresses[max_index].priority = self.progresses[max_index].priority - 10
        return max_index

    def __change_priority(self):
        for i in range(len(self.progresses)):
            self.progresses[i].priority += 10

if __name__ == "__main__":
    priority = PriorityAlgorithm()
    print("初始化队列进程:===================================")
    priority.print_all_progresses()
    print("===================end============================")
    priority.execute_progress()





 

  • 2
    点赞
  • 24
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
好的,以下是时间片轮转调度算法优先级调度算法(抢占式)的Python实现时间片轮转调度算法: ```python from collections import deque class Process: def __init__(self, pid, burst_time): self.pid = pid self.burst_time = burst_time self.remaining_time = burst_time def execute(self, time_slice): if self.remaining_time <= time_slice: time_slice = self.remaining_time self.remaining_time -= time_slice return time_slice def is_completed(self): return self.remaining_time == 0 class RoundRobinScheduler: def __init__(self, time_slice): self.time_slice = time_slice self.processes = deque() def add_process(self, process): self.processes.append(process) def run(self): while len(self.processes) > 0: process = self.processes.popleft() time_slice = process.execute(self.time_slice) if process.is_completed(): print("Process", process.pid, "completed") else: self.processes.append(process) ``` 优先级调度算法(抢占式): ```python from queue import PriorityQueue class Process: def __init__(self, pid, burst_time, priority): self.pid = pid self.burst_time = burst_time self.remaining_time = burst_time self.priority = priority def execute(self, time_slice): if self.remaining_time <= time_slice: time_slice = self.remaining_time self.remaining_time -= time_slice return time_slice def is_completed(self): return self.remaining_time == 0 def __lt__(self, other): return self.priority < other.priority class PriorityPreemptiveScheduler: def __init__(self): self.processes = PriorityQueue() def add_process(self, process): self.processes.put(process) def run(self): time = 0 while not self.processes.empty(): process = self.processes.get() time_slice = process.execute(1) time += time_slice if process.is_completed(): print("Process", process.pid, "completed at time", time) else: self.processes.put(process) ``` 以上是时间片轮转调度算法优先级调度算法(抢占式)的Python实现,希望能够帮到你。
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值