共享服务器的队列模拟

在这种情况下，共享服务器包含若干个服务点，其中每个服务点都可以服务不同的请求。本质上，该问题可以看作是多个队列模拟的组合，其中每个队列独立地进行服务。

以下是一个示例代码，其中有两个队列和一个共享服务器。每个队列都包含三个服务点，而共享服务器具有两个服务点。当队列达到一定长度时，将触发进一步的服务。

import random

class Queue:
    def __init__(self, name, num_servers):
        self.name = name
        self.num_servers = num_servers
        self.people_in_queue = []
        self.servers = [0 for i in range(num_servers)]
        self.total_waiting_time = 0
        self.total_num_served = 0
    
    def add_person(self):
        self.people_in_queue.append(random.randint(1,5))
    
    def server_available(self):
        return 0 in self.servers
    
    def serve_next_person(self, current_time):
        next_person = self.people_in_queue.pop(0)
        time_served = random.randint(1,3)
        server_idx = self.servers.index(0)
        self.servers[server_idx] = time_served
        completion_time = current_time + time_served
        return (next_person, server_idx, completion_time)
    
    def update_servers(self, current_time):
        for i in range(self.num_servers):
            if self.servers[i] > 0:
                self.servers[i] -= 1
                if self.servers[i] == 0:
                    self.total_waiting_time += current_time - self.waiting_times[i]
                    self.total_num_served += 1
    
    def people_waiting(self):
        return len(self.people_in_queue)
    
    def avg_waiting_time(self):
        return self.total_waiting_time / self.total_num_served

class SharedServer:
    def __init__(self, num_servers):
        self.num_servers = num_servers
        self.servers = [0 for i in range(num_servers)]
    
    def server_available(self):
        return 0 in self.servers
    
    def serve_next_person(self, current_time):
        time_served = random.randint(2,4)
        server_idx = self.servers.index(0)
        self.servers[server_idx] = time_served
        completion_time = current_time + time_served
        return (server_idx, completion_time)
    
    def update_servers(self, current_time):
        for i in range(self.num_servers):
            if self.servers[i] > 0:
                self.servers[i] -= 1

q1