Stowage/cpython
2
0
Fork 0
mirror of https://github.com/python/cpython.git synced 2026-02-13 19:04:37 +00:00
Code Issues Projects Releases Packages Wiki Activity

Improve multiserver queue recipe (GH-29012) (GH-29013)

Browse source
This commit is contained in:
Miss Islington (bot) 2021-10-17 16:43:10 -07:00 • committed by GitHub
parent 65c1db794e
commit 7082abf53d
No known key found for this signature in database
GPG key ID: 4AEE18F83AFDEB23
1 changed files with 6 additions and 5 deletions
Download patch file Download diff file Expand all files Collapse all files

11
Doc/library/random.rst
View file

@ -512,7 +512,7 @@ between the effects of a drug versus a placebo::
Simulation of arrival times and service deliveries for a multiserver queue::
from heapq import heappush, heappop
from heapq import heapify, heapreplace
from random import expovariate, gauss
from statistics import mean, quantiles
@ -524,14 +524,15 @@ Simulation of arrival times and service deliveries for a multiserver queue::
waits = []
arrival_time = 0.0
servers = [0.0] * num_servers # time when each server becomes available
for i in range(100_000):
heapify(servers)
for i in range(1_000_000):
arrival_time += expovariate(1.0 / average_arrival_interval)
next_server_available = heappop(servers)
next_server_available = servers[0]
wait = max(0.0, next_server_available - arrival_time)
waits.append(wait)
service_duration = gauss(average_service_time, stdev_service_time)
service_duration = max(0.0, gauss(average_service_time, stdev_service_time))
service_completed = arrival_time + wait + service_duration
heappush(servers, service_completed)
heapreplace(servers, service_completed)
print(f'Mean wait: {mean(waits):.1f} Max wait: {max(waits):.1f}')
print('Quartiles:', [round(q, 1) for q in quantiles(waits)])