High Performance Computing 1
Little’s Law of Queuing Theory
•
Proof:
•
Set f(t) = cumulative number of arrived
customers, and g(t) = cumulative number of
departed customers.
•
Assume f(0) = g(0) = 0, and f(T) = g(T) = N.
•
Consider the region between f(t) and g(t).