{"id":"https://openalex.org/W2150238960","doi":"https://doi.org/10.1145/1148109.1148159","title":"Fair online load balancing","display_name":"Fair online load balancing","publication_year":2006,"publication_date":"2006-07-30","ids":{"openalex":"https://openalex.org/W2150238960","doi":"https://doi.org/10.1145/1148109.1148159","mag":"2150238960"},"language":"en","primary_location":{"id":"doi:10.1145/1148109.1148159","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1148109.1148159","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the eighteenth annual 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/A5002590915","display_name":"Niv Buchbinder","orcid":"https://orcid.org/0000-0002-7014-8954"},"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":"Niv Buchbinder","raw_affiliation_strings":["Technion, Haifa, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technion, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025400832","display_name":"Joseph Naor","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Joseph (Seffi) Naor","raw_affiliation_strings":["Microsoft Research, Redmond, WA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA","institution_ids":["https://openalex.org/I1290206253"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":23,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"291","last_page":"298"},"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.9957000017166138,"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.995199978351593,"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/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.7307002544403076},{"id":"https://openalex.org/keywords/prefix","display_name":"Prefix","score":0.590166449546814},{"id":"https://openalex.org/keywords/corollary","display_name":"Corollary","score":0.5613529086112976},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.5554140210151672},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.5247402787208557},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4766070246696472},{"id":"https://openalex.org/keywords/measure","display_name":"Measure (data warehouse)","score":0.45357951521873474},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4502229392528534},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4417334496974945},{"id":"https://openalex.org/keywords/point","display_name":"Point (geometry)","score":0.4402833580970764},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3047110438346863}],"concepts":[{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.7307002544403076},{"id":"https://openalex.org/C141603448","wikidata":"https://www.wikidata.org/wiki/Q134830","display_name":"Prefix","level":2,"score":0.590166449546814},{"id":"https://openalex.org/C2780012671","wikidata":"https://www.wikidata.org/wiki/Q1343870","display_name":"Corollary","level":2,"score":0.5613529086112976},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.5554140210151672},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5247402787208557},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4766070246696472},{"id":"https://openalex.org/C2780009758","wikidata":"https://www.wikidata.org/wiki/Q6804172","display_name":"Measure (data warehouse)","level":2,"score":0.45357951521873474},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4502229392528534},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4417334496974945},{"id":"https://openalex.org/C28719098","wikidata":"https://www.wikidata.org/wiki/Q44946","display_name":"Point (geometry)","level":2,"score":0.4402833580970764},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3047110438346863},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1148109.1148159","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1148109.1148159","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the eighteenth annual ACM symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.550000011920929}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1538878715","https://openalex.org/W1630733292","https://openalex.org/W1922792796","https://openalex.org/W1976665334","https://openalex.org/W1980375431","https://openalex.org/W1984290406","https://openalex.org/W2006309149","https://openalex.org/W2021474514","https://openalex.org/W2024806294","https://openalex.org/W2050345497","https://openalex.org/W2064467943","https://openalex.org/W2070226247","https://openalex.org/W2081269878","https://openalex.org/W2087746279","https://openalex.org/W2101054149","https://openalex.org/W2123878303","https://openalex.org/W2156867662","https://openalex.org/W2181088386","https://openalex.org/W2613173048","https://openalex.org/W3144969279","https://openalex.org/W4238474291"],"related_works":["https://openalex.org/W4387497383","https://openalex.org/W3183948672","https://openalex.org/W3173606202","https://openalex.org/W3110381201","https://openalex.org/W2948807893","https://openalex.org/W2935909890","https://openalex.org/W2778153218","https://openalex.org/W2758277628","https://openalex.org/W1531601525","https://openalex.org/W603099989"],"abstract_inverted_index":{"We":[0,23,176],"revisit":[1],"from":[2,223],"a":[3,26,29,79,162,221],"fairness":[4],"point":[5],"of":[6,10,32,49,65,75,100,108,125,152,188,216,249],"view":[7,31],"the":[8,15,20,46,63,71,89,98,106,113,123,140,145,150,166,186,211,231,246,254,265],"problem":[9,146],"online":[11],"load":[12,212],"balancing":[13],"in":[14,161,174,195,203,235],"restricted":[16,169],"assignment":[17,170,237,259],"model":[18,171],"and":[19,28,56,68,84,131,190,208],"1-\u221e":[21,266],"model.":[22,267],"consider":[24],"both":[25],"job-centric":[27],"machine-centric":[30],"fairness,":[33],"as":[34,59,61],"proposed":[35,52],"by":[36,53,82,159],"Goel":[37],"et":[38],"al.":[39],"[11].":[40],"These":[41],"notions":[42],"are":[43],"equivalent":[44],"to":[45,62,149],"approximate":[47,66],"notion":[48,64,74],"prefix":[50,215],"competitiveness":[51],"Kleinberg,":[54],"Rabani":[55],"Tardos":[57],"[14],":[58],"well":[60,72],"majorization,":[67],"they":[69],"generalize":[70],"studied":[73,172],"max-min":[76],"fairness.We":[77],"resolve":[78],"question":[80],"posed":[81],"Goel,Meyerson":[83],"Plotkin":[85],"[11]":[86,109,250],"proving":[87],"that":[88,112,230,238,253,260],"greedy":[90,114,232,255],"strategy":[91,115],"is":[92,116,122,135,157,182,192,239,261],"globally":[93,117,240,262],"O(logm)-fair,":[94],"where":[95,120],"m":[96],"denotes":[97],"number":[99,124],"machines.":[101,219],"This":[102],"result":[103,244,248],"improves":[104],"upon":[105],"analysis":[107],"who":[110,251],"showed":[111],"O(log":[118],"n)-fair,":[119],"n":[121,128],"jobs.":[126],"Typically,":[127],">":[129],"m,":[130],"therefore":[132],"our":[133],"improvement":[134],"significant.":[136],"Our":[137],"proof":[138],"matches":[139],"known":[141],"lower":[142],"bound":[143,156,180,199,227],"for":[144,264],"with":[147],"respect":[148],"measure":[151],"global":[153],"fairness.The":[154],"improved":[155],"obtained":[158],"analyzing,":[160],"more":[163,167,206,225],"accurate":[164],"way,":[165],"general":[168,207,226],"previously":[173],"[6].":[175],"provide":[177],"an":[178,236,258],"alternative":[179],"which":[181],"not":[183],"worse":[184],"than":[185],"bounds":[187,210],"[6],":[189],"it":[191,209],"strictly":[193],"better":[194],"many":[196],"cases.":[197],"The":[198,242],"we":[200,228],"prove":[201],"is,":[202],"fact,":[204],"much":[205],"on":[213],"any":[214],"most":[217],"loaded":[218],"As":[220],"corollary":[222],"this":[224],"get":[229],"algorithm":[233,256],"results":[234],"O(logm)-balanced.":[241],"last":[243],"generalizes":[245],"previous":[247],"proved":[252],"yields":[257],"O(logm)-balanced":[263]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":4},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}