{"id":"https://openalex.org/W7168262499","doi":"https://doi.org/10.48550/arxiv.2607.10075","title":"Distributed Load Balancing on Unrelated Machines","display_name":"Distributed Load Balancing on Unrelated Machines","publication_year":2026,"publication_date":"2026-07-11","ids":{"openalex":"https://openalex.org/W7168262499","doi":"https://doi.org/10.48550/arxiv.2607.10075"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.10075","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.10075","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2607.10075","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5140692488","display_name":"Aaron Bernstein","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bernstein, Aaron","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5140643872","display_name":"Anupam Gupta","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gupta, Anupam","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5140718357","display_name":"Zhaozi Wang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Zhaozi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6947000026702881,"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"}},"topics":[{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.6947000026702881,"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"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.1386999934911728,"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/T12176","display_name":"Optimization and Packing Problems","score":0.06549999862909317,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/load-balancing","display_name":"Load balancing (electrical power)","score":0.582099974155426},{"id":"https://openalex.org/keywords/distributed-algorithm","display_name":"Distributed algorithm","score":0.5235000252723694},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.31839999556541443},{"id":"https://openalex.org/keywords/execution-time","display_name":"Execution time","score":0.2685000002384186},{"id":"https://openalex.org/keywords/efficient-algorithm","display_name":"Efficient algorithm","score":0.2678999900817871}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7998999953269958},{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.582099974155426},{"id":"https://openalex.org/C130120984","wikidata":"https://www.wikidata.org/wiki/Q2835898","display_name":"Distributed algorithm","level":2,"score":0.5235000252723694},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4708000123500824},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3846000134944916},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3402000069618225},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.31839999556541443},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.2685000002384186},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2678999900817871},{"id":"https://openalex.org/C189950617","wikidata":"https://www.wikidata.org/wiki/Q937228","display_name":"Property (philosophy)","level":2,"score":0.2635999917984009}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.10075","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.10075","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.10075","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.10075","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.5899698734283447,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,14,32,225],"study":[1],"the":[2,8,16,43,48,55,59,65,68,113,192,203,213,239,242],"well-known":[3],"load":[4,49,107,168],"balancing":[5],"problem":[6,145],"in":[7,75,141,163,191,195,202,212],"distributed":[9,167,214],"CONGEST":[10,66,99,193,215,231],"model":[11,194,216],"of":[12,50,58,106,172,179,241],"computation.":[13],"consider":[15],"unrelated":[17],"machines":[18],"setting,":[19],"where":[20,47,109,236],"each":[21,110,117],"job":[22,111],"$j$":[23],"specifies":[24],"a":[25,51,80,103,132,137,176,182,228],"size":[26,57,115],"$s_{ij}$":[27],"for":[28,125,166,233],"every":[29],"machine":[30,45,52],"$i$.":[31],"want":[33],"to":[34,62,185],"find":[35],"an":[36,71,123],"assignment":[37],"$\u03c6:":[38],"J":[39],"\\to":[40],"M$":[41],"minimizing":[42],"maximum":[44],"load,":[46],"$i$":[53],"is":[54,70,122,175,238],"total":[56],"jobs":[60],"assigned":[61],"it.":[63],"In":[64],"model,":[67,207],"state-of-the-art":[69],"algorithm":[72,124,130,184,232],"that":[73],"runs":[74],"polylog":[76,142,196],"rounds":[77],"and":[78,88],"returns":[79],"$(1+\\varepsilon)$-approximate":[81,133],"fractional":[82,134],"solution":[83,135,140],"from":[84,160],"Ahmadian,":[85],"Liu,":[86],"Peng,":[87],"Zadimoghaddam":[89],"(2021).":[90],"However,":[91],"this":[92],"algorithm,":[93],"as":[94,96],"well":[95],"all":[97],"previous":[98,164,209],"algorithms":[100,165,199,211],"only":[101,217],"solve":[102],"special":[104],"case":[105],"balancing,":[108],"has":[112],"same":[114],"on":[116],"machine.":[118],"Our":[119],"main":[120],"contribution":[121],"general":[126],"sizes":[127],"$s_{ij}$.":[128],"The":[129,144],"computes":[131],"or":[136,221],"$(2+\\varepsilon)$-approximate":[138],"integral":[139],"rounds.":[143,197],"structure":[146],"changes":[147],"significantly":[148],"once":[149],"we":[150],"allow":[151],"arbitrary":[152,186],"edge-sizes,":[153],"so":[154],"our":[155,173],"techniques":[156],"are":[157],"very":[158],"different":[159],"those":[161],"used":[162],"balancing.":[169],"One":[170],"ingredient":[171],"result":[174],"black-box":[177],"tool":[178],"independent":[180],"interest:":[181],"$(1+\\varepsilon)$-approximation":[183],"mixed":[187,234],"packing-covering":[188],"linear":[189],"programs":[190],"such":[198],"were":[200],"known":[201],"more":[204],"powerful":[205],"parallel":[206],"but":[208],"polylog-round":[210],"solved":[218],"pure":[219,222],"packing":[220],"covering":[223],"problems.":[224],"improve":[226],"upon":[227],"recent":[229],"$O(D\\,\\mathrm{polylog})$-round":[230],"packing-covering,":[235],"$D$":[237],"diameter":[240],"communication":[243],"graph.":[244]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-07-15T00:00:00"}