The DOI matches its Crossref record; 8 of the 8 references it cites were found in a registry or an index.
Strategies for dynamic load balancing on highly parallel computers
Abstract
Dynamic load balancing strategies for minimizing the execution time of single applications running in parallel on multicomputer systems are discussed. Dynamic load balancing (DLB) is essential for the efficient use of highly parallel systems when solving non-uniform problems with unpredictable load estimates. With the evolution of more highly parallel systems, centralized DLB approaches which make use of a high degree of knowledge become less feasible due to the load balancing communication overhead. Five DLB strategies are presented which illustrate the tradeoff between 1) knowledge - the accuracy of each balancing decision, and 2) overhead - the amount of added processing and communication incurred by the balancing process. All five strategies have been implemented on an Inter iPSC/2 hypercube.>
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
Parallel and Distributed Computation: Numerical Methods
Bertsekas, D. P., & Tsitsiklis, J. N. (1989) · DSpace@MIT (Massachusetts Institute of Technology) · Cited by 5,293
Dynamic load balancing for distributed memory multiprocessors
Cybenko, G. (1989) · Journal of Parallel and Distributed Computing · doi:10.1016/0743-7315(89)90021-x · Cited by 997
A taxonomy of scheduling in general-purpose distributed computing systems
Casavant, T. L., & Kuhl, J. G. (1988) · IEEE Transactions on Software Engineering · doi:10.1109/32.4634 · Cited by 976
A Partitioning Strategy for Nonuniform Problems on Multiprocessors
Berger, & Bokhari (1987) · IEEE Transactions on Computers · doi:10.1109/tc.1987.1676942 · Cited by 579
Load Sharing in Distributed Systems
Wang, Y.-T., & Morris (1985) · IEEE Transactions on Computers · doi:10.1109/tc.1985.1676564 · Cited by 458
Distributed scheduling of tasks with deadlines and resource requirements
Ramamritham, K., Stankovic, J. A., & Zhao, W. (1989) · IEEE Transactions on Computers · doi:10.1109/12.30866 · Cited by 316
Parallel depth first search. Part II. Analysis
Kumar, V., & Rao, V. N. (1987) · International Journal of Parallel Programming · doi:10.1007/bf01389001 · Cited by 174
Parallel depth first search. Part I. Implementation
Rao, V. N., & Kumar, V. (1987) · International Journal of Parallel Programming · doi:10.1007/bf01389000 · Cited by 172
Cited by
Self-adaptive software: Landscape and research challenges
Salehie, M., & Tahvildari, L. (2009) · ACM Transactions on Autonomous and Adaptive Systems · doi:10.1145/1516533.1516538 · Cited by 1,266
Metadata
- Authors
- Willebeek-LeMair, M. H., & Reeves, A. P.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 1993
- Volume
- 4
- Issue
- 9
- Pages
- 979-993
- ISSN
- 1045-9219 (ISSN-L)
- OpenAlex
- W2108493163
- Cited by
- 528
- References
- 8
- FWCI
- 20.20
- 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: Strategies for dynamic load balancing on highly parallel computers. https://app.cochat.ai/papers/10.1109/71.243526
- The paper
- Willebeek-LeMair, M. H., & Reeves, A. P. (1993). Strategies for dynamic load balancing on highly parallel computers. IEEE Transactions on Parallel and Distributed Systems. https://doi.org/10.1109/71.243526
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.