{"id":"https://openalex.org/W4288323273","doi":"https://doi.org/10.1145/3323165.3323203","title":"Parallel Balanced Allocations","display_name":"Parallel Balanced Allocations","publication_year":2019,"publication_date":"2019-06-17","ids":{"openalex":"https://openalex.org/W4288323273","doi":"https://doi.org/10.1145/3323165.3323203"},"language":"en","primary_location":{"id":"doi:10.1145/3323165.3323203","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3323165.3323203","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 31st ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5006005471","display_name":"Christoph Lenzen","orcid":"https://orcid.org/0000-0002-3290-0674"},"institutions":[{"id":"https://openalex.org/I4210109712","display_name":"Max Planck Institute for Informatics","ror":"https://ror.org/01w19ak89","country_code":"DE","type":"facility","lineage":["https://openalex.org/I149899117","https://openalex.org/I4210109712"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Christoph Lenzen","raw_affiliation_strings":["MPI for Informatics, Saarbr\u00fccken, Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MPI for Informatics, Saarbr\u00fccken, Germany","institution_ids":["https://openalex.org/I4210109712"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5022875077","display_name":"Merav Parter","orcid":"https://orcid.org/0000-0002-2357-2445"},"institutions":[{"id":"https://openalex.org/I53964585","display_name":"Weizmann Institute of Science","ror":"https://ror.org/0316ej306","country_code":"IL","type":"education","lineage":["https://openalex.org/I53964585"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Merav Parter","raw_affiliation_strings":["Weizmann Institute, Rehovot, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Weizmann Institute, Rehovot, Israel","institution_ids":["https://openalex.org/I53964585"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5048056525","display_name":"Eylon Yogev","orcid":"https://orcid.org/0000-0001-8599-2472"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Eylon Yogev","raw_affiliation_strings":["Technion, Haifa, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":7,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"313","last_page":"322"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9994000196456909,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7624365091323853},{"id":"https://openalex.org/keywords/ball","display_name":"Ball (mathematics)","score":0.5977585315704346},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5573627948760986},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.4749370217323303},{"id":"https://openalex.org/keywords/bin","display_name":"Bin","score":0.4535249173641205},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.422058641910553},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.4175238013267517},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36288875341415405},{"id":"https://openalex.org/keywords/geometry","display_name":"Geometry","score":0.0935194194316864}],"concepts":[{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7624365091323853},{"id":"https://openalex.org/C122041747","wikidata":"https://www.wikidata.org/wiki/Q838611","display_name":"Ball (mathematics)","level":2,"score":0.5977585315704346},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5573627948760986},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4749370217323303},{"id":"https://openalex.org/C156273044","wikidata":"https://www.wikidata.org/wiki/Q4913766","display_name":"Bin","level":2,"score":0.4535249173641205},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.422058641910553},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4175238013267517},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36288875341415405},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0935194194316864},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3323165.3323203","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3323165.3323203","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 31st ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320320300","display_name":"European Commission","ror":"https://ror.org/00k4n6c32"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1977773481","https://openalex.org/W1996492982","https://openalex.org/W2016945104","https://openalex.org/W2020658897","https://openalex.org/W2061468734","https://openalex.org/W2112749339","https://openalex.org/W2116269179","https://openalex.org/W2148426943","https://openalex.org/W2912437396","https://openalex.org/W3014163002","https://openalex.org/W4295837408","https://openalex.org/W4302338090"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2107701374","https://openalex.org/W1616588898","https://openalex.org/W4249504934","https://openalex.org/W2183416055","https://openalex.org/W2568867011","https://openalex.org/W2811066438","https://openalex.org/W1998475765","https://openalex.org/W2962877694","https://openalex.org/W3100115274"],"abstract_inverted_index":{"We":[0,172,235],"study":[1],"parallel":[2,15,82,164,176],"algorithms":[3,83,228,244],"for":[4,84,127,226,252,321],"the":[5,44,60,73,128,144,154,201,219,246,274,315],"classical":[6],"balls-into-bins":[7],"problem,":[8],"in":[9,14,26,29,109,208,218,285],"which":[10,32],"m":[11],"balls":[12,33,64,204,266,293],"acting":[13],"as":[16],"separate":[17],"agents":[18],"are":[19,267],"placed":[20],"into":[21],"n":[22,114,118],"bins.":[23],"Algorithms":[24],"operate":[25],"synchronous":[27],"rounds,":[28],"each":[30,97,141],"of":[31,54,62,89,95,148,166,184,215,245,269,273,281,289,317],"and":[34,56,104,197,203,230,301],"bins":[35,49,152,198,302],"exchange":[36],"messages":[37,207,306],"once.":[38],"The":[39,92,192,212],"goal":[40],"is":[41,70,170,194,221,241],"to":[42,99,157,223,310,314],"minimize":[43],"maximal":[45,110,155,182,279],"load":[46,111,156,183,280],"over":[47],"all":[48,199],"using":[50],"a":[51,100,168,174,181,261,270,278,286,296],"small":[52],"number":[53,288],"rounds":[55,256,290],"few":[57],"messages.":[58],"While":[59],"case":[61,316],"$m=n$":[63],"has":[65],"been":[66],"extensively":[67],"studied,":[68],"little":[69],"known":[71,222],"about":[72],"heavily":[74],"loaded":[75,146],"case.":[76],"In":[77,125],"this":[78,85],"work,":[79],"we":[80,248,259],"consider":[81],"somewhat":[86],"neglected":[87],"regime":[88],"$m\\gg":[90],"n$.":[91],"naive":[93],"solution":[94],"allocating":[96],"ball":[98,142],"bin":[101,147],"chosen":[102],"uniformly":[103],"independently":[105],"at":[106],"random":[107],"results":[108],"$m/n+\u0398(\\sqrtm/n\\cdot":[112],"\u0142og":[113,119],")$":[115,255],"(for":[116],"$m\\geq":[117],"n$)":[120],"with":[121],"high":[122],"probability":[123],"(w.h.p.).":[124],"contrast,":[126],"sequential":[129],"setting":[130],"Berenbrink":[131],"et":[132],"al":[133],"(SIAM":[134],"J.":[135],"Comput":[136],"2006)":[137],"showed":[138],"that":[139,179,238,276],"letting":[140],"join":[143],"least":[145],"two":[149],"randomly":[150],"selected":[151],"reduces":[153],"$m/n+O(\u0142og\u0142og":[158],"m)$":[159],"w.h.p.":[160,186,257,291,307],"To":[161],"date,":[162],"no":[163],"variant":[165],"such":[167,227],"result":[169],"known.":[171],"present":[173],"simple":[175,262],"threshold":[177],"algorithm":[178,193,264],"obtains":[180],"$m/n+O(1)$":[185],"within":[187],"$O(\u0142og\u0142og":[188],"(m/n)+\u0142og^*":[189],"n)$":[190,217,305],"rounds.":[191],"symmetric":[195],"(balls":[196],"\"look":[200],"same\"),":[202],"send":[205,294],"$O(1)$":[206],"expectation":[209],"per":[210,299],"round.":[211],"additive":[213],"term":[214],"$O(\u0142og^*":[216],"complexity":[220],"be":[224],"tight":[225],"(Lenzen":[229],"Wattenhofer":[231],"Distributed":[232],"Computing":[233],"2016).":[234],"also":[236],"prove":[237],"our":[239],"analysis":[240],"tight,":[242],"i.e.,":[243],"type":[247],"provide":[249],"must":[250],"run":[251],"$\u00d8mega(\\min\\\u0142og\u0142og":[253],"(m/n),n\\":[254],"Finally,":[258],"give":[260],"asymmetric":[263],"(i.e.,":[265],"aware":[268],"common":[271],"labeling":[272],"bins)":[275],"achieves":[277],"$m/n":[282],"+":[283],"O(1)$":[284],"constant":[287],"Again,":[292],"only":[295],"single":[297],"message":[298],"round,":[300],"receive":[303],"$(1+o(1))m/n+O(\u0142og":[304],"This":[308],"goes":[309],"show":[311],"that,":[312],"similar":[313],"$m=n$,":[318],"asymmetry":[319],"allows":[320],"highly":[322],"efficient":[323],"solutions.":[324]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":1}],"updated_date":"2026-07-20T07:56:41.581041","created_date":"2022-07-28T00:00:00"}