A Queue data-structure, continuously filled up with tasks of the same type (~run times) ➜ resolves linear for lim t → ∞
Challenge: Proof a linear dependency between wait [ms] , run [ms] and queue.size [on add]
1000 tasks with rand. [10 - 30] ms runtimes and
rand. `enqueue()` offset [0 - 20,000ms ≙ 20s]
mean: wait [ms]: 887.30 ms
|
mean: run [ms]: 20.72 ms
|
mean: queue.size [on add]: 41.6
