The DOI matches its Crossref record; 7 of the 7 references it cites were found in a registry or an index.
On Choosing a Task Assignment Policy for a Distributed Server System
Open accessAbstract
We consider a distributed server system in which each host processes tasks in First-Come-First-Served order and each task's service demand is known immediately upon task arrival. We consider four task assignment policies commonly proposed for such distributed server systems: Round Robin; Random; Size-Based, in which all tasks within a given size range are assigned to a particular host; and Dynamic-Least-Work-Remaining, in which a task is assigned to the host with the least outstanding work. Using analysis and simulation, we explore the influence of task size variability on which task assignment policy is best. Surprisingly, we find that not one of the above task assignment policies is best. In particular, we find that when the task sizes are not highly variable, the Dynamic policy is preferable. However, when task sizes show the degree of variability more characteristic of empirically measured workloads, the size-based policy is the best choice. We use the resulting observations to argue in favor of a specific size-based policy, SITA-E, that shows very good performance for realistic task size distributions.
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
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
Self-similarity in World Wide Web traffic: evidence and possible causes
Crovella, M. E., & Bestavros, A. (1997) · IEEE/ACM Transactions on Networking · doi:10.1109/90.650143 · Cited by 2,731
Self-citationStochastic Modeling and the Theory of Queues
Wolff, R. W. (1989) · Cited by 1,593
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
Self-citationHeavy-tailed probability distributions in the World Wide Web
Crovella, M. E., Taqqu, M. S., & Azer Bestavros, C. (1998) · Cited by 326
Self-citationLoad-balancing heuristics and process behavior
Leland, W., & Ott, T. J. (1986) · Proceedings of the 1986 ACM SIGMETRICS joint international conference on Computer performance modelling, measurement and evaluation - SIGMETRICS '86/PERFORMANCE '86 · doi:10.1145/317499.317539 · Cited by 216
Fractal Patterns In DASD I/O Traffic.
Peterson, D. L., & Adams, D. B. (1996) · Int. CMG Conference · Cited by 17
Cited by
The state of the art in locally distributed Web-server systems
Cardellini, V., Casalicchio, E., Colajanni, M., & Yu, P. S. (2002) · ACM Computing Surveys · doi:10.1145/508352.508355 · Cited by 455
Analysis of SRPT scheduling: investigating unfairness
Bansal, N., & Harchol-Balter, M. (2001) · Proceedings of the 2001 ACM SIGMETRICS international conference on Measurement and modeling of computer systems · doi:10.1145/378420.378792 · Cited by 312
Self-citation
Metadata
- Authors
- Harchol-Balter, M., Crovella, M. E., & Murta, C. D.
- Venue
- Journal of Parallel and Distributed Computing
- Publisher
- Elsevier BV
- Published
- 1999-11
- Volume
- 59
- Issue
- 2
- Pages
- 204-228
- ISSN
- 0743-7315 (ISSN-L)
- OpenAlex
- W1978251712
- Cited by
- 316
- References
- 7
- FWCI
- 16.30
- Type
- journal article
- Language
- en
- Open access
- green
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.