{"id":"https://openalex.org/W2901559723","doi":"https://doi.org/10.1145/3282435","title":"Improved Analysis of Deterministic Load-Balancing Schemes","display_name":"Improved Analysis of Deterministic Load-Balancing Schemes","publication_year":2018,"publication_date":"2018-11-16","ids":{"openalex":"https://openalex.org/W2901559723","doi":"https://doi.org/10.1145/3282435","mag":"2901559723"},"language":"en","primary_location":{"id":"doi:10.1145/3282435","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3282435","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://kclpure.kcl.ac.uk/ws/files/143101952/Improved_Analysis_of_Deterministic_Load_Balancing_Schemes_MALLMANN_TRENN_Publishedonline1November2018_GREEN_AAM.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5072910141","display_name":"Petra Berenbrink","orcid":"https://orcid.org/0000-0002-6930-3259"},"institutions":[{"id":"https://openalex.org/I159176309","display_name":"Universit\u00e4t Hamburg","ror":"https://ror.org/00g30e956","country_code":"DE","type":"education","lineage":["https://openalex.org/I159176309"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Petra Berenbrink","raw_affiliation_strings":["Hamburg University, Hamburg"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Hamburg University, Hamburg","institution_ids":["https://openalex.org/I159176309"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5112786437","display_name":"Ralf Klasing","orcid":null},"institutions":[{"id":"https://openalex.org/I1294671590","display_name":"Centre National de la Recherche Scientifique","ror":"https://ror.org/02feahw73","country_code":"FR","type":"government","lineage":["https://openalex.org/I1294671590"]},{"id":"https://openalex.org/I15057530","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032","country_code":"FR","type":"education","lineage":["https://openalex.org/I15057530"]},{"id":"https://openalex.org/I4210142254","display_name":"Laboratoire Bordelais de Recherche en Informatique","ror":"https://ror.org/03adqg323","country_code":"FR","type":"facility","lineage":["https://openalex.org/I1294671590","https://openalex.org/I1294671590","https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210159245","https://openalex.org/I4210160189"]},{"id":"https://openalex.org/I4210160189","display_name":"Institut Polytechnique de Bordeaux","ror":"https://ror.org/054qv7y42","country_code":"FR","type":"education","lineage":["https://openalex.org/I4210160189"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Ralf Klasing","raw_affiliation_strings":["CNRS\u2014LaBRI\u2014Universit\u00e9 de Bordeaux, Talence cedex, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"CNRS\u2014LaBRI\u2014Universit\u00e9 de Bordeaux, Talence cedex, France","institution_ids":["https://openalex.org/I15057530","https://openalex.org/I4210142254","https://openalex.org/I4210160189","https://openalex.org/I1294671590"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5075900164","display_name":"Adrian Kosowski","orcid":null},"institutions":[{"id":"https://openalex.org/I169173203","display_name":"D\u00e9l\u00e9gation Paris 7","ror":"https://ror.org/00bw5n526","country_code":"FR","type":"government","lineage":["https://openalex.org/I154526488","https://openalex.org/I169173203"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Adrian Kosowski","raw_affiliation_strings":["Inria\u2014IRIF\u2014Paris Diderot University, Paris Cedex, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Inria\u2014IRIF\u2014Paris Diderot University, Paris Cedex, France","institution_ids":["https://openalex.org/I169173203","https://openalex.org/I204730241"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5045186573","display_name":"Frederik Mallmann-Trenn","orcid":"https://orcid.org/0000-0003-0363-8547"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]},{"id":"https://openalex.org/I63966007","display_name":"Massachusetts Institute of Technology","ror":"https://ror.org/042nb2s44","country_code":"US","type":"education","lineage":["https://openalex.org/I63966007"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Frederik Mallmann-Trenn","raw_affiliation_strings":["MIT, Cambridge, MA","MIT - Massachusetts Institute of Technology (77 Massachusetts Ave, Cambridge, MA 02139 - United States)"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA","institution_ids":["https://openalex.org/I4210110987"]},{"raw_affiliation_string":"MIT - Massachusetts Institute of Technology (77 Massachusetts Ave, Cambridge, MA 02139 - United States)","institution_ids":["https://openalex.org/I63966007"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5020580102","display_name":"Przemys\u0142aw Uzna\u0144ski","orcid":"https://orcid.org/0000-0002-8652-0490"},"institutions":[{"id":"https://openalex.org/I35440088","display_name":"ETH Zurich","ror":"https://ror.org/05a28rw58","country_code":"CH","type":"education","lineage":["https://openalex.org/I2799323385","https://openalex.org/I35440088"]}],"countries":["CH"],"is_corresponding":false,"raw_author_name":"Przemys\u0142aw Uzna\u0144ski","raw_affiliation_strings":["ETH Z\u00fcrich, Z\u00fcrich, Switzerland"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"ETH Z\u00fcrich, Z\u00fcrich, Switzerland","institution_ids":["https://openalex.org/I35440088"]}]}],"institutions":[],"countries_distinct_count":4,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5072910141"],"corresponding_institution_ids":["https://openalex.org/I159176309"],"apc_list":null,"apc_paid":null,"fwci":0.4832,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.69257607,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"15","issue":"1","first_page":"1","last_page":"22"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11181","display_name":"Advanced Data Storage Technologies","score":0.9936000108718872,"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/T12404","display_name":"Mathematical Approximation and Integration","score":0.9922999739646912,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"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.7657718062400818},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5835410356521606},{"id":"https://openalex.org/keywords/spectral-gap","display_name":"Spectral gap","score":0.4675254821777344},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.46613404154777527},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.46163439750671387},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39652472734451294},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3915272653102875},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3885895013809204}],"concepts":[{"id":"https://openalex.org/C138959212","wikidata":"https://www.wikidata.org/wiki/Q1806783","display_name":"Load balancing (electrical power)","level":3,"score":0.7657718062400818},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5835410356521606},{"id":"https://openalex.org/C2778114796","wikidata":"https://www.wikidata.org/wiki/Q7575194","display_name":"Spectral gap","level":2,"score":0.4675254821777344},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.46613404154777527},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.46163439750671387},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39652472734451294},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3915272653102875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3885895013809204},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C187691185","wikidata":"https://www.wikidata.org/wiki/Q2020720","display_name":"Grid","level":2,"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/3282435","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3282435","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:kclpure.kcl.ac.uk:openaire/bab0cc39-5061-4cd7-a69c-689ca48cbe8d","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/bab0cc39-5061-4cd7-a69c-689ca48cbe8d","pdf_url":"https://kclpure.kcl.ac.uk/ws/files/143101952/Improved_Analysis_of_Deterministic_Load_Balancing_Schemes_MALLMANN_TRENN_Publishedonline1November2018_GREEN_AAM.pdf","source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Berenbrink, P, Klasing, R, Kosowski, A, Mallmann-Trenn, F & Uzna\u0144ski, P 2019, 'Improved analysis of deterministic load-balancing schemes', Acm Transactions On Algorithms, vol. 15, no. 1, 10. https://doi.org/10.1145/3282435","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:arXiv.org:1404.4344","is_oa":true,"landing_page_url":"http://arxiv.org/abs/1404.4344","pdf_url":"https://arxiv.org/pdf/1404.4344","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"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":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"text"},{"id":"pmh:oai:HAL:hal-00979691v4","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-00979691","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Algorithms, 2019, 15 (1), pp.Art.10. ⟨10.1145/3282435⟩","raw_type":"Journal articles"}],"best_oa_location":{"id":"pmh:oai:kclpure.kcl.ac.uk:openaire/bab0cc39-5061-4cd7-a69c-689ca48cbe8d","is_oa":true,"landing_page_url":"https://kclpure.kcl.ac.uk/portal/en/publications/bab0cc39-5061-4cd7-a69c-689ca48cbe8d","pdf_url":"https://kclpure.kcl.ac.uk/ws/files/143101952/Improved_Analysis_of_Deterministic_Load_Balancing_Schemes_MALLMANN_TRENN_Publishedonline1November2018_GREEN_AAM.pdf","source":{"id":"https://openalex.org/S4306400216","display_name":"Research Portal (King's College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I183935753","host_organization_name":"King's College London","host_organization_lineage":["https://openalex.org/I183935753"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"Berenbrink, P, Klasing, R, Kosowski, A, Mallmann-Trenn, F & Uzna\u0144ski, P 2019, 'Improved analysis of deterministic load-balancing schemes', Acm Transactions On Algorithms, vol. 15, no. 1, 10. https://doi.org/10.1145/3282435","raw_type":"info:eu-repo/semantics/publishedVersion"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G471185946","display_name":null,"funder_award_id":"ANR-16-CE40-0023","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320323712","display_name":"Universit\u00e9 de Bordeaux","ror":"https://ror.org/057qpr032"}],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2901559723.pdf","grobid_xml":"https://content.openalex.org/works/W2901559723.grobid-xml"},"referenced_works_count":21,"referenced_works":["https://openalex.org/W1600293573","https://openalex.org/W1603204637","https://openalex.org/W1643282477","https://openalex.org/W1897950368","https://openalex.org/W1909387666","https://openalex.org/W1985956989","https://openalex.org/W2002921350","https://openalex.org/W2006397962","https://openalex.org/W2014474286","https://openalex.org/W2023434464","https://openalex.org/W2044936155","https://openalex.org/W2075553387","https://openalex.org/W2112749339","https://openalex.org/W2113295388","https://openalex.org/W2117204986","https://openalex.org/W2129623734","https://openalex.org/W2137795931","https://openalex.org/W2171220158","https://openalex.org/W2314313325","https://openalex.org/W2595974727","https://openalex.org/W2763355822"],"related_works":["https://openalex.org/W3103885756","https://openalex.org/W2022507394","https://openalex.org/W2563943286","https://openalex.org/W4385190278","https://openalex.org/W2966826037","https://openalex.org/W3101494832","https://openalex.org/W2184245033","https://openalex.org/W2944222538","https://openalex.org/W4226230365","https://openalex.org/W2511580312"],"abstract_inverted_index":{"We":[0,131,187,203],"consider":[1],"the":[2,11,43,50,53,58,61,83,94,108,122,177,181,185,233,244],"problem":[3],"of":[4,8,16,34,39,55,86,96,105,111,147,156,180,184,194,224,243],"deterministic":[5,77],"load":[6,149,250],"balancing":[7,251],"tokens":[9,36,56,112],"in":[10,42,102,150,168,191],"discrete":[12,249],"model.":[13],"A":[14],"set":[15],"n":[17,164,166],"processors":[18],"is":[19,47,121,176],"connected":[20],"into":[21],"a":[22,119,144,154,207,222],"d":[23,159,227],"-regular":[24],"undirected":[25],"network.":[26,44],"In":[27,68],"every":[28,141],"timestep,":[29],"each":[30,38,151],"processor":[31,63],"exchanges":[32],"some":[33,73,218,242],"its":[35,40,148],"with":[37],"neighbors":[41],"The":[45],"goal":[46],"to":[48,80,125,241],"minimize":[49],"discrepancy":[51,155,223],"between":[52],"number":[54,110],"on":[57,76],"most-loaded":[59],"and":[60,139,246],"least-loaded":[62],"as":[64,66,230,232],"quickly":[65,231],"possible.":[67],"this":[69],"work,":[70],"we":[71,92],"identify":[72],"natural":[74,248],"conditions":[75],"load-balancing":[78,99],"algorithms":[79,100,134],"improve":[81],"upon":[82],"long-standing":[84],"results":[85],"Rabani":[87],"et":[88],"al.":[89],"(1998).":[90],"Specifically,":[91],"introduce":[93],"notion":[95],"cumulatively":[97,137,214],"fair":[98,138,215],"where":[101,140,174],"any":[103,213],"interval":[104],"consecutive":[106],"timesteps,":[107],"total":[109],"sent":[113],"out":[114],"over":[115],"an":[116],"edge":[117],"by":[118,206],"node":[120,142],"same":[123],"(up":[124],"constants)":[126],"for":[127],"all":[128],"adjacent":[129],"edges.":[130],"prove":[132],"that":[133,135,212],"are":[136],"retains":[143],"sufficient":[145],"part":[146],"step,":[152],"achieve":[153],"O":[157,170,225],"(":[158,171,226],"min":[160],"{":[161],"\u221a":[162],"log":[163],"/\u03bc,\u221a":[165],"})":[167],"time":[169],"T":[172],"),":[173],"\u03bc":[175],"spectral":[178],"gap":[179],"transition":[182],"matrix":[183],"graph.":[186],"also":[188],"show":[189],"that,":[190],"general,":[192],"neither":[193],"these":[195],"assumptions":[196,220],"may":[197],"be":[198],"omitted":[199],"without":[200],"increasing":[201],"discrepancy.":[202],"then":[204],"show,":[205],"combinatorial":[208],"potential":[209],"reduction":[210],"argument,":[211],"scheme":[216],"satisfying":[217],"additional":[219],"achieves":[221],")":[228],"almost":[229],"continuous":[234],"diffusion":[235],"process.":[236],"This":[237],"positive":[238],"result":[239],"applies":[240],"simplest":[245],"most":[247],"schemes.":[252]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}