The DOI matches its Crossref record; 3 of the 3 references it cites were found in a registry or an index.
Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System
Abstract
Queueing models for a simple heterogeneous multiple processor system are presented, analyzed, and compared. Each model is distinguished by a job routing strategy which is designed to reduce the average job turnaround time by balancing the total load among the processors. In each case an arriving job is routed by a job dispatcher to one of m parallel processors. The job routing strategies are divided into two classes: deterministic and nondeterministic. The nondeterministic policies are described by state independent branching probabilities. For the deterministic policies, the next processor is chosen to minimize or maximize the expected value of a performance related criterion function.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
A Proof for the Queuing Formula: L = λ W
Little, J. D. C. (1961) · Operations Research · doi:10.1287/opre.9.3.383 · Cited by 2,777
Open, Closed, and Mixed Networks of Queues with Different Classes of Customers
Baskett, F., Chandy, K. M., Muntz, R. R., & Palacios, F. G. (1975) · Journal of the ACM · doi:10.1145/321879.321887 · Cited by 2,409
Jackson, J. R. (2004) · Management Science · doi:10.1287/mnsc.1040.0268 · Cited by 733
Cited by
Tanenbaum, A. S., & Van Renesse, R. (1985) · ACM Computing Surveys · doi:10.1145/6041.6074 · Cited by 990
Milojičić, D. S., Douglis, F., Paindaveine, Y., Wheeler, R., & Zhou, S. (2000) · ACM Computing Surveys · doi:10.1145/367701.367728 · Cited by 470
The evolution of distributed computing systems: from fundamental to new frontiers
Lindsay, D., Gill, S. S., Smirnova, D., & Garraghan, P. (2021) · Computing · doi:10.1007/s00607-020-00900-y · Cited by 45
Metadata
- Authors
- Chow, Y.-C., & Kohler
- Venue
- IEEE Transactions on Computers
- Published
- 1979-05
- Volume
- C-28
- Issue
- 5
- Pages
- 354-361
- ISSN
- 0018-9340 (ISSN-L)
- 1557-9956
- 2326-3814
- OpenAlex
- W2008646959
- Cited by
- 253
- References
- 3
- FWCI
- 7.84
- Type
- journal article
- Language
- en
- Open access
- closed
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
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System. https://app.cochat.ai/papers/10.1109/tc.1979.1675365
- The paper
- Chow, Y.-C., & Kohler. (1979). Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System. IEEE Transactions on Computers. https://doi.org/10.1109/tc.1979.1675365
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.