The DOI matches its Crossref record; 4 of the 4 references it cites were found in a registry or an index.
Task Allocation in Distributed Data Processing
Abstract
Load balancing increases throughput but creates interprocessor overhead. This research suggests that a programming approach is the task allocation strategy most likely to balance these conflicting factors.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
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
Harary, F. (1969) · doi:10.21236/ad0705364 · Cited by 4,861
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,622
Multiprocessor Scheduling with the Aid of Network Flow Algorithms
Stone, H. S. (1977) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1977.233840 · Cited by 680
Models for Dynamic Load Balancing in a Heterogeneous Multiple Processor System
Chow, Y.-C., & Kohler (1979) · IEEE Transactions on Computers · doi:10.1109/tc.1979.1675365 · Cited by 253
Cited by
Tanenbaum, A. S., & Van Renesse, R. (1985) · ACM Computing Surveys · doi:10.1145/6041.6074 · Cited by 990
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
Comparative Models of the File Assignment Problem
Dowdy, L. W., & Foster, D. V. (1982) · ACM Computing Surveys · doi:10.1145/356876.356883 · Cited by 472
A Task Allocation Model for Distributed Computing Systems
Ma, P.-Y. R., Lee, & Tsuchiya (1982) · IEEE Transactions on Computers · doi:10.1109/tc.1982.1675884 · Cited by 328
Analytic Queueing Network Models for Parallel Processing of Task Systems
Thomasian, & Bay (1986) · IEEE Transactions on Computers · doi:10.1109/tc.1986.1676712 · Cited by 104
Metadata
- Authors
- Chu, Holloway, Lan, M.-T., & Efe
- Venue
- Computer
- Published
- 1980-11
- Volume
- 13
- Issue
- 11
- Pages
- 57-69
- ISSN
- 0018-9162 (ISSN-L)
- OpenAlex
- W2022142019
- Cited by
- 357
- References
- 4
- FWCI
- 16.10
- 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
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.