CoChat
Sign Up
Cited by 5Advanced Queuing Theory AnalysisManagement and Optimization TechniquesOperations Management Techniques

The DOI matches its Crossref record.

Little’s Law

Dongarra, Jack, Luszczek, Piotr, Feautrier, Paul, Zee, Field G., Chan, Ernie, Geijn, Robert A., Bjornson, Robert, Dongarra, Jack, Luszczek, Piotr, Philippe, Bernard, Sameh, Ahmed, Philippe, Bernard, Sameh, Ahmed, Dongarra, Jack, Luszczek, Piotr, Steele, Guy L., Gustafson, John L., Dongarra, Jack, Luszczek, Piotr, Becker, Aaron, Zheng, Gengbin, Kalé, Laxmikant V., Pingali, Keshav, Carro, Manuel, Hermenegildo, Manuel, Banerjee, Utpal, Wismüller, Roland·2011·Encyclopedia of Parallel Computing
DOI 10.1007/978-0-387-09766-4_79
Open this paper in CoChat — free account

Overview

Integrity signals

Registry

Crossref · 10.1007/978-0-387-09766-4_79

Cites

Statistics

Recomputing p-values needs the paper’s full text.

Verification

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Using Little's Law and the approximate amount of time required for each component of a Stage 1 assessment, a throughput of one FURM assessment per month requires conducting 2 assessments simultaneously at any given time.

    “Using Little's Law (a theorem used to determine the average number of items in a stationary queueing system 31 ), and the approximate amount of time required for each component of a Stage 1 assessment (Figure 3), we estimate that this throughput requires conducting 2 assessments simultaneously at any given time.”

    From Standing on FURM Ground: A Framework for Evaluating Fair, Useful, and Reliable AI Models in Health Care Systems (2024) · cites this paper as [31]

Citations

Cited by

Sorted by citations

Metadata

Authors
Dongarra, J., Luszczek, P., Feautrier, P., Zee, F. G., Chan, E., Geijn, R. A., Bjornson, R., Dongarra, J., Luszczek, P., Philippe, B., Sameh, A., Philippe, B., Sameh, A., Dongarra, J., Luszczek, P., Steele, G. L., Gustafson, J. L., Dongarra, J., Luszczek, P., Becker, A., Zheng, G., Kalé, L. V., Pingali, K., Carro, M., Hermenegildo, M., Banerjee, U., & Wismüller, R.
Affiliations
Intel (United States) (US)
Corresponding author
Gustafson, John L.
ORCID
Venue
Encyclopedia of Parallel Computing
Publisher
Springer US
Published
2011
Pages
1038-1041
DOI
10.1007/978-0-387-09766-4_79
OpenAlex
W4248469607
Cited by
5
References
0
Citations by year
2026: 1 · 2025: 1 · 2024: 2 · 2022: 1
Type
reference entry
Language
en
Open access
closed
Locations
Springer eBooks (publishedVersion)
Topics
  • Social Sciences › Decision Sciences › Management Science and Operations Research › Advanced Queuing Theory Analysis
  • Social Sciences › Business, Management and Accounting › Strategy and Management › Management and Optimization Techniques
  • Social Sciences › Decision Sciences › Management Science and Operations Research › Operations Management Techniques
Keywords
Little's law, queueing theory, steady state, average inventory, production systems

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review