Skip to main content

Little’s Law

  • Reference work entry
Encyclopedia of Parallel Computing

Synonyms

Little’s lemma; Little’s principle; Little’s result; Little’s theorem

Definition

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.$$

Discussion

At first glance, Little’s Law looks like common sense. If items arrive faster than the system can process them, the system will overflow. Perhaps the earliest mention of the relation is by A. Cobham in 1954, and he states it as a fact without proof [2]. However, the law is insightful in two ways. First, it does not depend on the probability distributions of any of the variables. Second, since arrival rates are generally less than maximum processing rates, it says what the capacity of the system must be to handle the queue in a system design.

Figure 1 shows a visualization of a queue in steady state that explains Little’s Law:

Little’s...

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,600.00
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,799.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Bibliography

  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. Cobham A (1954) Priority assignment in waiting line problems Oper Res 2(1):70–76

    Article  Google Scholar 

  3. Jewell WS (1967) A simple proof of L = λW. Oper Res 15(6): 1109–1116

    Article  MATH  MathSciNet  Google Scholar 

  4. Little JDC (1961) A proof of the queueing formula L = λW. Oper Res 9:383–387

    Article  MATH  MathSciNet  Google Scholar 

  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. 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, 2004

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer Science+Business Media, LLC

About this entry

Cite this entry

Gustafson, J.L. (2011). Little’s Law. In: Padua, D. (eds) Encyclopedia of Parallel Computing. Springer, Boston, MA. https://doi.org/10.1007/978-0-387-09766-4_79

Download citation

Publish with us

Policies and ethics