skip to main content
10.1145/1250790.1250829acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
Article

Balanced allocations: the weighted case

Published: 11 June 2007 Publication History

Abstract

We investigate balls-and-bins processes where m weighted balls areplaced into n bins using the "power of two choices" paradigm,whereby a ball is inserted into the less loaded of two randomly chosen bins. The case where each of the m balls has unit weight had been studied extensively. In a seminal paper Azar et.al. showed that when m=n the most loaded bin has Θ(log log n) balls with high probability. Surprisingly, thegap in load between the heaviest bin and the average bin does not increase with m and was shown by Berenbrink etal tobe Θ(log log n) with high probability for arbitrarily large m. We generalize this result to the weighted case where balls have weights drawn from an arbitrary weight distribution. We show that aslong as the weight distribution has finite second moment andsatisfies a mild technical condition, the gap between the weight of the heaviest bin and the weight of the average bin is independent ofthe number balls thrown. This is especially striking whenconsidering heavy tailed distributions such as Power-Law andLog-Normal distributions. In these cases, as more balls are thrown,heavier and heavier weights are encountered. Nevertheless with high probability, the imbalance in the load distribution does notincrease. Furthermore, if the fourth moment of the weight distribution is finite, the expected value of the gap is shown to beindependent of the number of balls.

References

[1]
{1} Micah Adler, Soumen Chakrabarti, Michael Mitzenmacher, and Lars Rasmussen. Parallel randomized load balancing. Random Structures and Algorithms, 13(2):159-188, 1998.
[2]
{2} Yossi Azar, Andrei Z. Broder, Anna R. Karlin, and Eli Upfal. Balanced allocations. SIAM Journal Computing, 29(1):180-200, 1999.
[3]
{3} Petra Berenbrink, Friedhelm Meyer auf der Heide, and Klaus Schröder. Allocating weighted jobs in parallel. Theory of Computing Systems, 32(3):281-300, 1999.
[4]
{4} Petra Berenbrink, Artur Czumaj, Angelika Steger, and Berthold Vöcking. Balanced allocations: the heavily loaded case. SIAM Journal Computing, 35(6):1350-1385, 2006.
[5]
{5} Petra Berenbrink, Tom Friedetzky, Zengjian Hu, and Russel Martin. On weighted balls-into-bins games. In Proc. of Symp. on Theoretical Aspects of Computer Science (STACS), pages 231-243, 2005.
[6]
{6} Russ Bubley and Martin E. Dyer. Path coupling: A technique for proving rapid mixing in markov chains. In Proceedings of the 38th Annual Symposium on Foundations of Computer Science (FOCS), pages 223-231, 1997.
[7]
{7} John Byers, Jeffrey Considine, and Michael Mitzenmacher. Simple load balancing for distributed hash tables. In Proc. of Intl. Workshop on Peer-to-Peer System (IPTPS), pages 80-87, 2003.
[8]
{8} John W. Byers, Jeffrey Considine, and Michael Mitzenmacher. Geometric generalizations of the power of two choices. In Proc. of Symp. on Parallelism in Algorithms and Architectures (SPAA), pages 54-63, 2004.
[9]
{9} Colin Mcdiarmid. Probabilistic Methods for Algorithmic Discrete Mathematics, chapter Concentration, pages 195-248. Springer, 1998.
[10]
{10} Michael Mitzenmacher. A brief history of generative models for power law and lognormal distributions. Internet Mathematics, 1(2):225-251.
[11]
{11} Michael Mitzenmacher. Load balancing and density dependent jump markov processes. In Proc. of Symp. on Foundations of Computer Science (FOCS), pages 213-222, 1996.
[12]
{12} Michael Mitzenmacher, Andrèa Richa, and Ramesh Sitaraman. Handbook of Randomized Computing, chapter The power of two random choices: A survey of the techniques and results. Kluwer, 2000.
[13]
{13} Berhold Vöcking. How asymmetry helps load balancing. Journal of ACM, 50(4):568-589, 2003.
[14]
{14} Udi Wieder. Balanced allocations with heterogenous bins. In Proc. of Symp. on Parallelism in Algorithms and Architectures (SPAA), 2007.

Cited By

View all

Index Terms

  1. Balanced allocations: the weighted case

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    STOC '07: Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
    June 2007
    734 pages
    ISBN:9781595936318
    DOI:10.1145/1250790
    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]

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 11 June 2007

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. balls and bins
    2. the multiple choice paradigm

    Qualifiers

    • Article

    Conference

    STOC07
    Sponsor:
    STOC07: Symposium on Theory of Computing
    June 11 - 13, 2007
    California, San Diego, USA

    Acceptance Rates

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

    Upcoming Conference

    STOC '25
    57th Annual ACM Symposium on Theory of Computing (STOC 2025)
    June 23 - 27, 2025
    Prague , Czech Republic

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)14
    • Downloads (Last 6 weeks)2
    Reflects downloads up to 13 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2024)Long-term balanced allocation via thinningThe Annals of Applied Probability10.1214/23-AAP197834:1AOnline publication date: 1-Feb-2024
    • (2024)An Improved Drift Theorem for Balanced AllocationsACM Transactions on Algorithms10.1145/367390020:4(1-39)Online publication date: 1-Jul-2024
    • (2023)Weighted Oblivious RAM, with Applications to Searchable Symmetric EncryptionAdvances in Cryptology – EUROCRYPT 202310.1007/978-3-031-30545-0_15(426-455)Online publication date: 23-Apr-2023
    • (2022)Balanced Allocations in BatchesProceedings of the 34th ACM Symposium on Parallelism in Algorithms and Architectures10.1145/3490148.3538593(389-399)Online publication date: 11-Jul-2022
    • (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
    • (2022)Dynamic Local Searchable Symmetric EncryptionAdvances in Cryptology – CRYPTO 202210.1007/978-3-031-15985-5_4(91-120)Online publication date: 11-Oct-2022
    • (2018)Randomized algorithms for online vector load balancingProceedings of the Twenty-Ninth Annual ACM-SIAM Symposium on Discrete Algorithms10.5555/3174304.3175333(980-991)Online publication date: 7-Jan-2018
    • (2018)Distributionally Linearizable Data StructuresProceedings of the 30th on Symposium on Parallelism in Algorithms and Architectures10.1145/3210377.3210411(133-142)Online publication date: 11-Jul-2018
    • (2018)PIR with Compressed Queries and Amortized Query Processing2018 IEEE Symposium on Security and Privacy (SP)10.1109/SP.2018.00062(962-979)Online publication date: May-2018
    • (2018)Threshold load balancing with weighted tasksJournal of Parallel and Distributed Computing10.1016/j.jpdc.2017.10.012113(218-226)Online publication date: Mar-2018
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media