The DOI matches its Crossref record; 18 of the 18 references it cites were found in a registry or an index.
The power of two choices in randomized load balancing
Abstract
We consider the following natural model: customers arrive as a Poisson stream of rate /spl lambda/n, /spl lambda/<1, at a collection of n servers. Each customer chooses some constant d servers independently and uniformly at random from the n servers and waits for service at the one with the fewest customers. Customers are served according to the first-in first-out (FIFO) protocol and the service time for a customer is exponentially distributed with mean 1. We call this problem the supermarket model. We wish to know how the system behaves and in particular we are interested in the effect that the parameter d has on the expected time a customer spends in the system in equilibrium. Our approach uses a limiting, deterministic model representing the behavior as n/spl rarr//spl infin/ to approximate the behavior of finite systems. The analysis of the deterministic model is interesting in its own right. Along with a theoretical justification of this approach, we provide simulations that demonstrate that the method accurately predicts system behavior, even for relatively small systems. Our analysis provides surprising implications. Having d=2 choices leads to exponential improvements in the expected time a customer spends in the system over d=1, whereas having d=3 choices is only a constant factor better than d=2. We discuss the possible implications for system design.
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
Ordinary Differential Equations
(2017) · Python for Scientists · doi:10.1017/9781108120241.010 · Cited by 7,240
Markov Processes: Characterization and Convergence.
Abakuks, A., Ethier, S. N., & Kurtz, T. G. (1987) · Biometrics · doi:10.2307/2531839 · Cited by 4,233
Wiley Series in Probability and Statistics
(2008) · Wiley series in probability and statistics · doi:10.1002/series1345 · Cited by 4,217
Markov Processes: Characterization and Convergence
Ethier, S. N., & Kurtz, T. G. (1986) · Wiley Series in Probability and Statistics · doi:10.1002/9780470316658 · Cited by 3,634
Manifolds, Tensor Analysis, and Applications
Abraham, R., Marsden, J. E., & Ratiu, T. (1988) · Applied Mathematical Sciences · doi:10.1007/978-1-4612-1029-0 · Cited by 1,757
Manifolds, Tensor Analysis, and Applications
Abraham, R., Marsden, J. E., Ratiu, T., & DeWitt-Morette, C. (1984) · Physics Today · doi:10.1063/1.2916250 · Cited by 1,209
Solutions of ordinary differential equations as limits of pure jump markov processes
Kurtz, T. G. (1970) · Journal of Applied Probability · doi:10.1017/s0021900200026929 · Cited by 947
Adaptive load sharing in homogeneous distributed systems
Eager, D. L., Lazowska, E. D., & Zahorjan, J. (1986) · IEEE Transactions on Software Engineering · doi:10.1109/tse.1986.6312961 · Cited by 926
Approximation of Population Processes
Kurtz, T. G. (1981) · Society for Industrial and Applied Mathematics eBooks · doi:10.1137/1.9781611970333 · Cited by 605
Limit theorems for sequences of jump Markov processes approximating ordinary differential processes
Kurtz, T. G. (1971) · Journal of Applied Probability · doi:10.1017/s002190020003535x · Cited by 594
Strong approximation theorems for density dependent Markov chains
Kurtz, T. G. (1978) · Stochastic Processes and their Applications · doi:10.1016/0304-4149(78)90020-0 · Cited by 552
Sudden Emergence of a Giantk-Core in a Random Graph
Pittel, B., Spencer, J., & Wormald, N. (1996) · Journal of Combinatorial Theory, Series B · doi:10.1006/jctb.1996.0036 · Cited by 437
The Power of Two Random Choices: A Survey of Techniques and Results
Mitzenmacher, M., Richa, A. W., & Sitaraman, R. (2001) · Combinatorial Optimization · doi:10.1007/978-1-4615-0013-1_9 · Cited by 431
Self-citationDifferential Equations for Random Processes and Random Graphs
Wormald, N. (1995) · The Annals of Applied Probability · doi:10.1214/aoap/1177004612 · Cited by 401
Balanced allocations (extended abstract)
Azar, Y., Broder, A., Karlin, A. R., et al. (1994) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/195058.195412 · Cited by 139
Adaptive load sharing in heterogeneous distributed systems
Mirchandaney, R., Towsley, D., & Stankovic, J. A. (1990) · Journal of Parallel and Distributed Computing · doi:10.1016/0743-7315(90)90118-9 · Cited by 115
Parallel randomized load balancing
Adler, M., Chakrabarti, S., Mitzenmacher, M., & Rasmussen, L. E. (1995) · ACM Symposium on Theory of Computing (STOC) · doi:10.1145/225058.225131 · Cited by 101
Self-citationLoad balancing and density dependent jump Markov processes
Mitzenmacher, M. (2002) · Annual Symposium on Foundations of Computer Science · doi:10.1109/sfcs.1996.548480 · Cited by 94
Self-citation
Cited by
Dean, J., & Barroso, L. A. (2013) · Communications of the ACM · doi:10.1145/2408776.2408794 · Cited by 1,852
Rethinking virtual network embedding: substrate support for path splitting and migration
Yu, M., Yi, Y., Rexford, J., & Chiang, M. (2008) · ACM SIGCOMM Computer Communication Review · doi:10.1145/1355734.1355737 · Cited by 1,244
Efficient erasure correcting codes
Luby, M. G., Mitzenmacher, M., Shokrollahi, M. A., & Spielman, D. A. (2001) · IEEE Transactions on Information Theory · doi:10.1109/18.910575 · Cited by 1,180
Self-citationSparrow: distributed, low latency scheduling
Ousterhout, K., Wendell, P., Zaharia, M., & Stoica, I. (2013) · Proceedings of the Twenty-Fourth ACM Symposium on Operating Systems Principles · doi:10.1145/2517349.2522716 · Cited by 586
NetCache: Balancing Key-Value Stores with Fast In-Network Caching
Jin, X., Li, X., Zhang, H., Soulé, R., Lee, J., Foster, N., Kim, C., & Stoica, I. (2017) · Proceedings of the 26th Symposium on Operating Systems Principles · doi:10.1145/3132747.3132764 · Cited by 556
Metadata
- Authors
- Mitzenmacher, M.
- Venue
- IEEE Transactions on Parallel and Distributed Systems
- Published
- 2001
- Volume
- 12
- Issue
- 10
- Pages
- 1094-1104
- ISSN
- 1045-9219 (ISSN-L)
- OpenAlex
- W2117702591
- Cited by
- 1,399
- References
- 18
- FWCI
- 38.95
- 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.