高响应比优先调度算法代码

高响应比优先调度算法（Highest Response Ratio Next，简称HRRN）是一种用于进程调度的算法，它根据进程的响应比来确定下一个要执行的进程。响应比是根据等待时间和服务时间的比值计算得出的，响应比越高，优先级越高。

以下是一个简单的高响应比优先调度算法的代码示例：

class Process:
    def __init__(self, pid, arrival_time, service_time):
        self.pid = pid
        self.arrival_time = arrival_time
        self.service_time = service_time
        self.waiting_time = 0
        self.response_ratio = 0

    def calculate_response_ratio(self, current_time):
        self.waiting_time = current_time - self.arrival_time
        self.response_ratio = (self.waiting_time + self.service_time) / self.service_time

def hrrn_scheduling(processes):
    current_time = 0
    completed_processes = []
    while processes:
        ready_processes = [p for p in processes if p.arrival_time <= current_time]
        if not ready_processes:
            current_time += 1
            continue
        next_process = max(ready_processes, key=lambda p: p.response_ratio)
        current_time += next_process.service_time
        next_process.calculate_response_ratio(current_time)
        completed_processes.append(next_process)
        processes.remove(next_process)
    return completed_processes

# 示例用法
if __name__ == "__main__":
    processes = [
        Process(1, 0, 10),
        Process(2, 2, 5),
        Process(3, 4, 8),
        Process(4, 6, 2)
    ]
    completed_processes = hrrn_scheduling(processes)
    for process in completed_processes:
        print(f"Process {process.pid}: Waiting Time = {process.waiting_time}, Response Ratio = {process.response_ratio}")