Encyclopedia of Parallel Computing

2011 Edition
| Editors: David Padua

Little’s Law

  • John L. Gustafson
Reference work entry
DOI: https://doi.org/10.1007/978-0-387-09766-4_79



Little’s Law says that in the long-term, steady state of a production system, the average number of items L in the system is the product of the average arrival rate λ and the average time W that an item spends in the system, that is,
$$L = \lambda W.$$
This is a preview of subscription content, log in to check access.


  1. 1.
    Bailey DH (1997) Little’s law and high performance computing. RNR Technical Report, NAS applications and tools group, NASA Ames Research Center. At http://crd.lbl.gov/~dhbailey/dhbpapers/little.pdf
  2. 2.
    Cobham A (1954) Priority assignment in waiting line problems Oper Res 2(1):70–76CrossRefGoogle Scholar
  3. 3.
    Jewell WS (1967) A simple proof of L = λW. Oper Res 15(6): 1109–1116zbMATHMathSciNetCrossRefGoogle Scholar
  4. 4.
    Little JDC (1961) A proof of the queueing formula L = λW. Oper Res 9:383–387zbMATHMathSciNetCrossRefGoogle Scholar
  5. 5.
    Little JDC, Graves SC (2008) Little’s law. In: Chhajed D, Lowe TJ (eds) Building intuition: insights from basic operations management models and principles. MIT Press, Cambridge. Available at http://web.mit.edu/sgraves/www/papers/Little's Law-Published.pdf
  6. 6.
    Morse PM (1958) Queues, inventories and maintenance: the analysis of operational systems. Original edition by Wiley, New York. ISBN 0-86-3914-. Reprinted by Dover Phoenix Editions, 2004Google Scholar

Copyright information

© Springer Science+Business Media, LLC 2011

Authors and Affiliations

  • John L. Gustafson
    • 1
  1. 1.Intel Labs, Intel CorporationSanta ClaraUSA