Article

Free access

Balanced allocations: the heavily loaded case

Authors:

Petra Berenbrink,

Artur Czumaj,

Angelika Steger,

Berthold VöckingAuthors Info & Claims

STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing

Pages 745 - 754

https://doi.org/10.1145/335305.335411

Published: 01 May 2000 Publication History

PDF eReader

References

[1]

Y. Azar, A. Z. Broder, and A. R. Karlin. On-line load balancing. Theoretical Computer Science, 130:73-84, 1994.]]

Digital Library

Google Scholar

[2]

Y. Azar, A. Z. Broder, A. R. Karlin, and E. Upfal. Balanced allocations. SIAM J. Comput., 29(1): 180--200, September 1999. A preliminary version appeared in Proceedings of the 26th Annual ACM Symposium on Theory of Computing, pages 593-602, Montreal, Quebec, Canada, May 23- 25, 1994. ACM Press, New York, NY.]]

Digital Library

Google Scholar

[3]

D. Aldous. Random walks of finite groups and rapidly mixing Markov chains. In J. Az6ma and M. Yor, editors, Sdminaire de Probabilitds XVII, 1981/82, volume 986 of Lecture Notes in Mathematics, pages 243-297. Springer- Vefiag, Berlin, 1983.]]

Google Scholar

[4]

R. Bubley and M. Dyer. Path coupling: A technique for proving rapid mixing in Markov chains. In Proceedings of the 38th IEEE Symposium on Foundations of Computer Science, pages 223-231, Miami Beach, FL, October 19-22, 1997. IEEE Computer Society Press, Los Alamitos, CA.]]

Digital Library

Google Scholar

[5]

A. Czumaj. Non-Markovian couplings and generating permutations via random transpositions. Manuscript, February 2000.]]

Google Scholar

[6]

D. Dubhashi and D. Ranjan. Balls and bins: A study in negative dependence. Random Structures & Algorithms, 13(2):99-124 1998.]]

Digital Library

Google Scholar

[7]

M. Mitzenmacher. Load balancing and density dependent jump Markov processes. In Proceedings of the 37th IEEE Symposium on Foundations of Computer Science, pages 213-222, Burlington, Vermont, October 14-16, 1996. IEEE Computer Society Press, Los Alamitos, CA.]]

Digital Library

Google Scholar

[8]

M. D. Mitzenmacher. The Power of Two Choices in Randomized Load Balancing. PhD thesis, Computer Science Department, University of California at Berkeley, September 1996.]]

Digital Library

Google Scholar

[9]

M. Raab and A. Steger. "Balls into bins" m a simple and fight analysis. In M. Luby, J. Rolim, and M. Serna, editors, Proceedings of the 2nd International Workshop on Randomization and Approximation Techniques in Computer Science, volume 1518 of Lecture Notes in Computer Science, pages 159-170, Barcelona, Spain, October 8-10, 1998. Springer-Verlag, Berlin.]]

Digital Library

Google Scholar

[10]

N. D. Vvedenskaya, R. L. Dobrushin, and F. I. Karpelevich. Queueing system with selection of the shortest of two queues: An assymptotic approach. Problems oflnformation Transmission, 32(1): 15-27, january-March 1996.]]

Google Scholar

[11]

B. V6cking. How asymetry helps load balancing. In Proceedings of the 40th IEEE Symposium on Foundations of Computer Science, pages 131-141, New York City, NY, October 17-19, 1999. IEEE Computer Society Press, Los Alamitos, CA.]]

Digital Library

Google Scholar

[12]

N. D. Vvedenskaya and Y. M. Suhov. Dobrushin's meanfield approximation for queue with dynamicTechnical Report N~ 3328, INRIA, France, December 1997.]]

Google Scholar

Cited By

View all

Agrawal KKuszmaul WWang ZZhao JAgrawal KPetrank E(2024)Distributed Load Balancing in the Face of Reappearance DependenciesProceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3626183.3659968(321-330)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3626183.3659968
Farach-Colton MKrapivin AKuszmaul W(2024)Optimal Bounds for Open Addressing Without Reordering2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS61266.2024.00045(594-605)Online publication date: 27-Oct-2024
https://doi.org/10.1109/FOCS61266.2024.00045
Tao TXiao ZWang JShang JWu Z(2024)THRCache: DRAM-NVM Multi-level Cache with Thresholded Heterogeneous Random ChoicesAlgorithms and Architectures for Parallel Processing10.1007/978-981-97-0859-8_26(436-455)Online publication date: 27-Feb-2024
https://doi.org/10.1007/978-981-97-0859-8_26
Show More Cited By

Index Terms

Balanced allocations: the heavily loaded case
1. Mathematics of computing
  1. Discrete mathematics
  2. Mathematical software
2. Theory of computation
  1. Design and analysis of algorithms
    1. Approximation algorithms analysis
      1. Routing and network design problems

Recommendations

Balanced Allocations: The Heavily Loaded Case

We investigate balls-into-bins processes allocating $m$ balls into $n$ bins based on the multiple-choice paradigm. In the classical single-choice variant each ball is placed into a bin selected uniformly at random. In a multiple-choice process each ...
Balanced Allocations

Suppose that we sequentially place $n$ balls into n boxes by putting each ball into a randomly chosen box. It is well known that when we are done, the fullest box has with high probability (1 + o(1))ln n/ln ln n balls in it. Suppose instead that for ...
Dynamic analysis of different resource allocations: Implications for resource orchestration management of strategic alliances
Highlights
- Use Evolutionary Game to clarify the applicability of various resource allocations.
Abstract
A lack of understanding regarding the roles and applicability of different resource allocations has become the underlying reason for the failure of resource efforts. Therefore, it is of important practical significance to examine the ...

Comments

Information & Contributors

Information

Published In

STOC '00: Proceedings of the thirty-second annual ACM symposium on Theory of computing

May 2000

756 pages

ISBN:1581131844

DOI:10.1145/335305

Chairmen:
Frances Yao,
Eugene Luks

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 May 2000

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Conference

STOC00

Sponsor:

SIGACT

STOC00: The 32nd Annual ACM Symposium on Theory of Computing

May 21 - 23, 2000

Oregon, Portland, USA

Acceptance Rates

STOC '00 Paper Acceptance Rate 85 of 182 submissions, 47%;

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Upcoming Conference

STOC '25

Sponsor:
sigact

57th Annual ACM Symposium on Theory of Computing (STOC 2025)

June 23 - 27, 2025

Prague , Czech Republic

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

61
Total Citations
View Citations
994
Total Downloads

Downloads (Last 12 months)160
Downloads (Last 6 weeks)25

Reflects downloads up to 06 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Agrawal KKuszmaul WWang ZZhao JAgrawal KPetrank E(2024)Distributed Load Balancing in the Face of Reappearance DependenciesProceedings of the 36th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3626183.3659968(321-330)Online publication date: 17-Jun-2024
https://dl.acm.org/doi/10.1145/3626183.3659968
Farach-Colton MKrapivin AKuszmaul W(2024)Optimal Bounds for Open Addressing Without Reordering2024 IEEE 65th Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS61266.2024.00045(594-605)Online publication date: 27-Oct-2024
https://doi.org/10.1109/FOCS61266.2024.00045
Tao TXiao ZWang JShang JWu Z(2024)THRCache: DRAM-NVM Multi-level Cache with Thresholded Heterogeneous Random ChoicesAlgorithms and Architectures for Parallel Processing10.1007/978-981-97-0859-8_26(436-455)Online publication date: 27-Feb-2024
https://doi.org/10.1007/978-981-97-0859-8_26
der Boor MBorst SVan Leeuwaarden JMukherjee D(2022)Scalable Load Balancing in Networked Systems: A Survey of Recent AdvancesSIAM Review10.1137/20M132374664:3(554-622)Online publication date: 4-Aug-2022
https://doi.org/10.1137/20M1323746
Bansal NKuszmaul W(2022)Balanced Allocations: The Heavily Loaded Case with Deletions2022 IEEE 63rd Annual Symposium on Foundations of Computer Science (FOCS)10.1109/FOCS54457.2022.00081(801-812)Online publication date: Oct-2022
https://doi.org/10.1109/FOCS54457.2022.00081
Abadi ADong CMurdoch STerzis S(2022)Multi-party Updatable Delegated Private Set IntersectionFinancial Cryptography and Data Security10.1007/978-3-031-18283-9_6(100-119)Online publication date: 22-Oct-2022
https://doi.org/10.1007/978-3-031-18283-9_6
Dauterman EFang VDemertzis ICrooks NPopa R(2021)SnoopyProceedings of the ACM SIGOPS 28th Symposium on Operating Systems Principles10.1145/3477132.3483562(655-671)Online publication date: 26-Oct-2021
https://dl.acm.org/doi/10.1145/3477132.3483562
Aktas MFar ASoljanin EWhiting P(2021)Evaluating Load Balancing Performance in Distributed Storage With RedundancyIEEE Transactions on Information Theory10.1109/TIT.2021.305438567:6(3623-3644)Online publication date: Jun-2021
https://doi.org/10.1109/TIT.2021.3054385
Georgakopoulos AHaslegrave JSauerwald TSylvester J(2021)The power of two choices for random walksCombinatorics, Probability and Computing10.1017/S0963548321000183(1-28)Online publication date: 28-May-2021
https://doi.org/10.1017/S0963548321000183
Alistarh DNadiradze GSabour A(2021)Dynamic Averaging Load Balancing on CyclesAlgorithmica10.1007/s00453-021-00905-984:4(1007-1029)Online publication date: 24-Dec-2021
https://doi.org/10.1007/s00453-021-00905-9
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations