|
Shay Ginsbourg
|
 |
« Reply #1 on: December 18, 2009, 01:00:32 AM » |
|
Little's law - From Wikipedia, the free encyclopedia -
In queueing theory, Little's result, theorem, lemma, or law says: The long-term average number of customers in a stable system L is equal to the long-term average arrival rate, λ, multiplied by the long-term average time a customer spends in the system, W, or:
L = λW
Although it looks intuitively reasonable, it's a quite remarkable result, as it implies that this behavior is entirely independent of any of the detailed probability distributions involved, and hence requires no assumptions about the schedule according to which customers arrive or are serviced.
Little's law can be used in software performance testing to ensure that the observed performance results are not due to bottlenecks imposed by the testing apparatus.
So, the transactions are not relevant here and the value of "transaction per sec" is not the throughput.
|