{"id":"https://openalex.org/W2556399323","doi":"https://doi.org/10.1109/allerton.2014.7028591","title":"Scheduling tasks with precedence constraints on multiple servers","display_name":"Scheduling tasks with precedence constraints on multiple servers","publication_year":2014,"publication_date":"2014-09-01","ids":{"openalex":"https://openalex.org/W2556399323","doi":"https://doi.org/10.1109/allerton.2014.7028591","mag":"2556399323"},"language":"en","primary_location":{"id":"doi:10.1109/allerton.2014.7028591","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2014.7028591","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","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/A5040270189","display_name":"Ramtin Pedarsani","orcid":"https://orcid.org/0000-0002-1126-0292"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ramtin Pedarsani","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of California, Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of California, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5041937901","display_name":"Jean Walrand","orcid":"https://orcid.org/0000-0002-1460-6826"},"institutions":[{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Jean Walrand","raw_affiliation_strings":["Department of Electrical Engineering and Computer Science, University of California, Berkeley, CA, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering and Computer Science, University of California, Berkeley, CA, USA","institution_ids":["https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101087537","display_name":"Yuan Zhong","orcid":null},"institutions":[{"id":"https://openalex.org/I78577930","display_name":"Columbia University","ror":"https://ror.org/00hj8s172","country_code":"US","type":"education","lineage":["https://openalex.org/I78577930"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yuan Zhong","raw_affiliation_strings":["Department of Industrial Engineering and Operations Research, Columbia University, New York, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Industrial Engineering and Operations Research, Columbia University, New York, NY, USA","institution_ids":["https://openalex.org/I78577930"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.4396,"has_fulltext":false,"cited_by_count":38,"citation_normalized_percentile":{"value":0.85807028,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":100},"biblio":{"volume":"6","issue":null,"first_page":"1196","last_page":"1203"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","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"}},"topics":[{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9983000159263611,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9980999827384949,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8493462204933167},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.7467430830001831},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.587359607219696},{"id":"https://openalex.org/keywords/dynamic-priority-scheduling","display_name":"Dynamic priority scheduling","score":0.5810948610305786},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.5617187023162842},{"id":"https://openalex.org/keywords/server","display_name":"Server","score":0.5525380373001099},{"id":"https://openalex.org/keywords/fair-share-scheduling","display_name":"Fair-share scheduling","score":0.5080516338348389},{"id":"https://openalex.org/keywords/two-level-scheduling","display_name":"Two-level scheduling","score":0.5007338523864746},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.49809741973876953},{"id":"https://openalex.org/keywords/job-scheduler","display_name":"Job scheduler","score":0.46199727058410645},{"id":"https://openalex.org/keywords/rate-monotonic-scheduling","display_name":"Rate-monotonic scheduling","score":0.4601192772388458},{"id":"https://openalex.org/keywords/round-robin-scheduling","display_name":"Round-robin scheduling","score":0.4256809949874878},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.2963143289089203},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2356480062007904},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.22893264889717102},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.07319483160972595}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8493462204933167},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.7467430830001831},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.587359607219696},{"id":"https://openalex.org/C107568181","wikidata":"https://www.wikidata.org/wiki/Q5319000","display_name":"Dynamic priority scheduling","level":3,"score":0.5810948610305786},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.5617187023162842},{"id":"https://openalex.org/C93996380","wikidata":"https://www.wikidata.org/wiki/Q44127","display_name":"Server","level":2,"score":0.5525380373001099},{"id":"https://openalex.org/C31689143","wikidata":"https://www.wikidata.org/wiki/Q733809","display_name":"Fair-share scheduling","level":3,"score":0.5080516338348389},{"id":"https://openalex.org/C119948110","wikidata":"https://www.wikidata.org/wiki/Q7858726","display_name":"Two-level scheduling","level":4,"score":0.5007338523864746},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.49809741973876953},{"id":"https://openalex.org/C111873713","wikidata":"https://www.wikidata.org/wiki/Q1641413","display_name":"Job scheduler","level":3,"score":0.46199727058410645},{"id":"https://openalex.org/C127456818","wikidata":"https://www.wikidata.org/wiki/Q238879","display_name":"Rate-monotonic scheduling","level":4,"score":0.4601192772388458},{"id":"https://openalex.org/C175893541","wikidata":"https://www.wikidata.org/wiki/Q1196582","display_name":"Round-robin scheduling","level":4,"score":0.4256809949874878},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.2963143289089203},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2356480062007904},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.22893264889717102},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.07319483160972595},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"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.1109/allerton.2014.7028591","is_oa":false,"landing_page_url":"https://doi.org/10.1109/allerton.2014.7028591","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 52nd Annual Allerton Conference on Communication, Control, and Computing (Allerton)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.4099999964237213,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":36,"referenced_works":["https://openalex.org/W583072594","https://openalex.org/W1551842821","https://openalex.org/W1589440227","https://openalex.org/W1964975282","https://openalex.org/W1966982450","https://openalex.org/W1971095127","https://openalex.org/W1973403707","https://openalex.org/W1985028827","https://openalex.org/W1991290989","https://openalex.org/W1995643834","https://openalex.org/W1998066559","https://openalex.org/W2006733177","https://openalex.org/W2018415413","https://openalex.org/W2036453481","https://openalex.org/W2040466547","https://openalex.org/W2059060883","https://openalex.org/W2073121338","https://openalex.org/W2077978368","https://openalex.org/W2082791325","https://openalex.org/W2084399803","https://openalex.org/W2100830825","https://openalex.org/W2103098926","https://openalex.org/W2104307727","https://openalex.org/W2131975293","https://openalex.org/W2168903052","https://openalex.org/W2173213060","https://openalex.org/W2249946371","https://openalex.org/W2326887918","https://openalex.org/W2329656816","https://openalex.org/W3099615934","https://openalex.org/W4233124504","https://openalex.org/W4241993359","https://openalex.org/W4247796740","https://openalex.org/W6633093045","https://openalex.org/W6679815717","https://openalex.org/W6692876501"],"related_works":["https://openalex.org/W2184166483","https://openalex.org/W2225350526","https://openalex.org/W4386580182","https://openalex.org/W4386128920","https://openalex.org/W4390711934","https://openalex.org/W4390711951","https://openalex.org/W4390711911","https://openalex.org/W4390711927","https://openalex.org/W4390711908","https://openalex.org/W1967116053"],"abstract_inverted_index":{"We":[0,69,167,203],"consider":[1,70,192],"the":[2,92,108,111,115,119,125,134,147,170,183,187],"problem":[3,149],"of":[4,21,83,110,136,186],"scheduling":[5,35,40,52,61,148,165],"jobs":[6],"which":[7,75,102,129,197],"are":[8,155,201],"modeled":[9],"by":[10,47],"directed":[11],"acyclic":[12],"graphs":[13],"(DAG).":[14],"In":[15,86],"such":[16,49],"graphs,":[17],"nodes":[18],"represent":[19,26],"tasks":[20,198],"a":[22,71,193,209,214],"job":[23,51],"and":[24,56,65,114,199],"edges":[25],"precedence":[27,116],"constraints":[28,117],"in":[29,41,53,62,74,94,118,133,196],"processing":[30,43,112],"these":[31,175],"tasks.":[32],"The":[33],"DAG":[34,100],"problem,":[36],"also":[37],"known":[38],"as":[39,50],"fork-join":[42],"networks,":[44,190],"is":[45,124,130,178],"motivated":[46],"examples":[48],"data":[54],"centers":[55],"cloud":[57],"computing,":[58],"patient":[59],"flow":[60],"health":[63],"systems":[64],"many":[66],"other":[67],"applications.":[68],"flexible":[72],"system,":[73],"servers":[76,200],"may":[77],"process":[78],"different,":[79],"possibly":[80],"overlapping,":[81],"sets":[82],"task":[84],"types.":[85],"this":[87,152],"paper,":[88],"we":[89,140,191],"first":[90],"discuss":[91],"difficulties":[93],"designing":[95],"provably":[96,163],"efficient":[97,164],"policies":[98],"for":[99,174],"scheduling,":[101],"arise":[103],"due":[104],"to":[105,145,161,181],"interactions":[106],"between":[107],"flexibility":[109],"environment":[113],"system.":[120],"A":[121],"major":[122],"difficulty":[123],"classical":[126],"synchronization":[127],"issue,":[128],"further":[131],"complicated":[132],"presence":[135],"system":[137],"flexibility.":[138],"Then,":[139],"propose":[141],"two":[142,188],"queueing":[143,176,189],"networks":[144,177],"model":[146,195],"that":[150,158,169],"overcome":[151],"difficulty.":[153],"These":[154],"virtual":[156],"queues":[157],"enable":[159],"us":[160],"design":[162],"policies.":[166],"show":[168],"well-known":[171],"Max-Weight":[172],"policy":[173],"throughput-optimal.":[179],"Finally,":[180],"compare":[182],"delay":[184,206],"performance":[185],"simplified":[194],"identical.":[202],"characterize":[204],"their":[205],"performances":[207],"under":[208],"simple":[210],"first-come-first-serve":[211],"policy,":[212],"via":[213],"novel":[215],"coupling":[216],"argument.":[217]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":24},{"year":2019,"cited_by_count":5},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}