The DOI matches its Crossref record.
Load-balancing heuristics and process behavior
Abstract
Dynamic load balancing in a system of loosely-coupled homogeneous processors may employ both judicious initial placement of processes and migration of existing processes to processors with fewer resident processes. In order to predict the possible benefits of these dynamic assignment techniques, we analyzed the behavior (CPU, disk, and memory use) of 9.5 million Unix* processes during normal use. The observed process behavior was then used to drive simulation studies of particular dynamic assignment heuristics.Let F(·) be the probability distribution of the amount of CPU time used by an arbitrary process. In the environment studied we found: (1-F(x)) n rx-c, 1.05
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
Cited by
Wide area traffic: the failure of Poisson modeling
Paxson, V., & Floyd, S. (1995) · IEEE/ACM Transactions on Networking · doi:10.1109/90.392383 · Cited by 3,708
Difficulties in simulating the Internet
Floyd, S., & Paxson, V. (2001) · IEEE/ACM Transactions on Networking · doi:10.1109/90.944338 · Cited by 721
Milojičić, D. S., Douglis, F., Paindaveine, Y., Wheeler, R., & Zhou, S. (2000) · ACM Computing Surveys · doi:10.1145/367701.367728 · Cited by 470
Exploiting process lifetime distributions for dynamic load balancing
Harchol-Balter, M., & Downey, A. B. (1997) · ACM Transactions on Computer Systems · doi:10.1145/263326.263344 · Cited by 442
On Choosing a Task Assignment Policy for a Distributed Server System
Harchol-Balter, M., Crovella, M. E., & Murta, C. D. (1999) · Journal of Parallel and Distributed Computing · doi:10.1006/jpdc.1999.1577 · Cited by 316
Metadata
- Authors
- Leland, W., & Ott, T. J.
- Venue
- Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation - SIGMETRICS '86/PERFORMANCE '86
- Publisher
- ACM Press
- Published
- 1986
- Pages
- 54-69
- OpenAlex
- W2087388231
- Cited by
- 216
- References
- 0
- FWCI
- 4.82
- Type
- conference paper
- 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: Load-balancing heuristics and process behavior. https://app.cochat.ai/papers/10.1145/317499.317539
- The paper
- Leland, W., & Ott, T. J. (1986). Load-balancing heuristics and process behavior. Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation - SIGMETRICS '86/PERFORMANCE '86. https://doi.org/10.1145/317499.317539
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.