{"id":"https://openalex.org/W2074104565","doi":"https://doi.org/10.1145/1378533.1378577","title":"Fast distributed scheduling via primal-dual","display_name":"Fast distributed scheduling via primal-dual","publication_year":2008,"publication_date":"2008-06-14","ids":{"openalex":"https://openalex.org/W2074104565","doi":"https://doi.org/10.1145/1378533.1378577","mag":"2074104565"},"language":"en","primary_location":{"id":"doi:10.1145/1378533.1378577","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1378533.1378577","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"},"type":"article","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/A5063633119","display_name":"Alessandro Panconesi","orcid":"https://orcid.org/0000-0002-2169-3067"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"Alessandro Panconesi","raw_affiliation_strings":["La Sapienza University, Rome, Italy"],"affiliations":[{"raw_affiliation_string":"La Sapienza University, Rome, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5057257639","display_name":"Mauro Sozio","orcid":"https://orcid.org/0000-0002-2031-3974"},"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"]},{"id":"https://openalex.org/I149899117","display_name":"Max Planck Society","ror":"https://ror.org/01hhn8329","country_code":"DE","type":"funder","lineage":["https://openalex.org/I149899117"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Mauro Sozio","raw_affiliation_strings":["Max Planck Institute for Informatics, Saarbruecken, Germany","Max-Planck Institute for Informatics, Saarbruecken, Germany#TAB#"],"affiliations":[{"raw_affiliation_string":"Max Planck Institute for Informatics, Saarbruecken, Germany","institution_ids":["https://openalex.org/I4210109712"]},{"raw_affiliation_string":"Max-Planck Institute for Informatics, Saarbruecken, Germany#TAB#","institution_ids":["https://openalex.org/I149899117"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5063633119"],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":null,"apc_paid":null,"fwci":2.0026,"has_fulltext":false,"cited_by_count":11,"citation_normalized_percentile":{"value":0.86741707,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"229","last_page":"235"},"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.9998999834060669,"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.9998999834060669,"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.9995999932289124,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9965999722480774,"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/computer-science","display_name":"Computer science","score":0.72764652967453},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.6748790144920349},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.6600003242492676},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5495188236236572},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5298252701759338},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4784710109233856},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.47734931111335754},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4640933871269226},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.27610746026039124},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.26972687244415283},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2541530728340149},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20203006267547607},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.11317762732505798}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.72764652967453},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.6748790144920349},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.6600003242492676},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5495188236236572},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5298252701759338},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4784710109233856},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.47734931111335754},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4640933871269226},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.27610746026039124},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.26972687244415283},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2541530728340149},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20203006267547607},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.11317762732505798},{"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/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1378533.1378577","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1378533.1378577","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the twentieth annual symposium on Parallelism in algorithms and architectures","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","score":0.4399999976158142,"id":"https://metadata.un.org/sdg/8"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":11,"referenced_works":["https://openalex.org/W1998137177","https://openalex.org/W1998544343","https://openalex.org/W1998643836","https://openalex.org/W2003902046","https://openalex.org/W2029483371","https://openalex.org/W2056050680","https://openalex.org/W2056399203","https://openalex.org/W2063241141","https://openalex.org/W2100061495","https://openalex.org/W2114986147","https://openalex.org/W2127622665"],"related_works":["https://openalex.org/W2371352078","https://openalex.org/W2953461625","https://openalex.org/W2077383796","https://openalex.org/W2080136900","https://openalex.org/W2999799752","https://openalex.org/W2372768926","https://openalex.org/W2970302286","https://openalex.org/W2810352541","https://openalex.org/W3204654320","https://openalex.org/W2142195909"],"abstract_inverted_index":{"In":[0,49],"this":[1,133],"paper":[2],"we":[3,33,52],"give":[4],"an":[5],"efficient":[6],"distributed":[7],"algorithm":[8,143],"computing":[9,58],"approximate":[10],"solutions":[11],"to":[12,93,118],"a":[13,25,54,71,82,97,101,113,150,154],"very":[14,138],"general,":[15],"and":[16,63,91],"classical,":[17],"scheduling":[18],"problem.":[19],"The":[20,115],"approximation":[21],"guarantee":[22],"is":[23,41,117,129,135,144,147],"within":[24,100],"constant":[26],"factor":[27],"of":[28,38,46,84,122,141],"the":[29,36,44,47,50,66,120,123],"optimum.":[30],"By":[31],"\"efficient\",":[32],"mean":[34],"that":[35,69,125,132,145],"number":[37],"communication":[39],"rounds":[40],"poly-logarithmic":[42],"in":[43,75,149],"size":[45],"input.":[48],"problem,":[51],"have":[53],"bipartite":[55],"graph":[56],"with":[57,87],"agents":[59],"on":[60,65,96],"one":[61,76,110],"side":[62],"resources":[64],"other.":[67],"Agents":[68],"share":[70],"resource":[72,99],"can":[73,105],"communicate":[74],"time":[77],"step.":[78],"Each":[79],"agent":[80],"has":[81],"list":[83],"jobs,":[85],"each":[86],"its":[88],"own":[89],"length":[90],"profit,":[92],"be":[94],"executed":[95],"neighbouring":[98],"given":[102],"time-window.":[103],"Resources":[104],"execute":[106],"non":[107],"preemptively":[108],"only":[109],"job":[111],"at":[112],"time.":[114],"goal":[116],"maximize":[119],"profit":[121],"jobs":[124],"are":[126],"scheduled.":[127],"It":[128],"well":[130],"known":[131],"problem":[134],"NP-hard.":[136],"A":[137],"interesting":[139],"feature":[140],"our":[142],"it":[146],"derived":[148],"systematic":[151],"manner":[152],"from":[153],"primal-dual":[155],"algorithm.":[156]},"counts_by_year":[{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}