{"id":"https://openalex.org/W2266945376","doi":"https://doi.org/10.1142/s0129626415500012","title":"Work-Competitive Scheduling on Task Dependency Graphs","display_name":"Work-Competitive Scheduling on Task Dependency Graphs","publication_year":2015,"publication_date":"2015-06-01","ids":{"openalex":"https://openalex.org/W2266945376","doi":"https://doi.org/10.1142/s0129626415500012","mag":"2266945376"},"language":"en","primary_location":{"id":"doi:10.1142/s0129626415500012","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626415500012","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-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/A5014441039","display_name":"Chadi Kari","orcid":null},"institutions":[{"id":"https://openalex.org/I119942576","display_name":"University of the Pacific","ror":"https://ror.org/05ma4gw77","country_code":"US","type":"education","lineage":["https://openalex.org/I119942576"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Chadi Kari","raw_affiliation_strings":["School of Engineering and Computer Science, University of the Pacific, 3601 Pacific Avenue, Stockton, CA 95211, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Engineering and Computer Science, University of the Pacific, 3601 Pacific Avenue, Stockton, CA 95211, USA","institution_ids":["https://openalex.org/I119942576"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088846595","display_name":"Alexander Russell","orcid":"https://orcid.org/0000-0002-8228-6238"},"institutions":[{"id":"https://openalex.org/I140172145","display_name":"University of Connecticut","ror":"https://ror.org/02der9h97","country_code":"US","type":"education","lineage":["https://openalex.org/I140172145"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Alexander Russell","raw_affiliation_strings":["Department of Computer Science & Engineering, University of Connecticut, 371 Fairfield Road, Storrs, Connecticut 06269, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science & Engineering, University of Connecticut, 371 Fairfield Road, Storrs, Connecticut 06269, USA","institution_ids":["https://openalex.org/I140172145"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5086039015","display_name":"Narasimha Shashidhar","orcid":"https://orcid.org/0000-0002-4877-158X"},"institutions":[{"id":"https://openalex.org/I191429286","display_name":"Sam Houston State University","ror":"https://ror.org/00yh3cz06","country_code":"US","type":"education","lineage":["https://openalex.org/I191429286"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Narasimha Shashidhar","raw_affiliation_strings":["Computer Science Department, Sam Houston State University, 1900 Avenue I, Huntsville, TX 77341, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Computer Science Department, Sam Houston State University, 1900 Avenue I, Huntsville, TX 77341, USA","institution_ids":["https://openalex.org/I191429286"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.1497317,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"25","issue":"02","first_page":"1550001","last_page":"1550001"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":1.0,"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":1.0,"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.9941999912261963,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9934999942779541,"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.7867226600646973},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.705100953578949},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.6561301946640015},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6286349296569824},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.45924949645996094},{"id":"https://openalex.org/keywords/dependency-graph","display_name":"Dependency graph","score":0.4351707100868225},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.4261893630027771},{"id":"https://openalex.org/keywords/dependency","display_name":"Dependency (UML)","score":0.41278257966041565},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.36899861693382263},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3288404643535614},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.19235897064208984},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.16300815343856812},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.1451481282711029},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.12526336312294006}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7867226600646973},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.705100953578949},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6561301946640015},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6286349296569824},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.45924949645996094},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.4351707100868225},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.4261893630027771},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.41278257966041565},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.36899861693382263},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3288404643535614},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.19235897064208984},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.16300815343856812},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.1451481282711029},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.12526336312294006},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","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/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1142/s0129626415500012","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s0129626415500012","pdf_url":null,"source":{"id":"https://openalex.org/S18360026","display_name":"Parallel Processing Letters","issn_l":"0129-6264","issn":["0129-6264","1793-642X"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Parallel Processing Letters","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1985312855","https://openalex.org/W1995704309","https://openalex.org/W2016263530","https://openalex.org/W2022179515","https://openalex.org/W2041645394","https://openalex.org/W2054033098","https://openalex.org/W2065160440","https://openalex.org/W2122320850"],"related_works":["https://openalex.org/W2093568763","https://openalex.org/W2327631927","https://openalex.org/W1593182640","https://openalex.org/W69297589","https://openalex.org/W1985166372","https://openalex.org/W2003096546","https://openalex.org/W4289354592","https://openalex.org/W2430210575","https://openalex.org/W4221145571","https://openalex.org/W2165069859"],"abstract_inverted_index":{"A":[0],"fundamental":[1],"problem":[2,41,92,149],"in":[3,45,206],"distributed":[4,47],"computing":[5],"is":[6,30,161,190],"the":[7,27,51,60,69,72,94,120,148,156,166,175,178,184,195,198,202,211,216],"task":[8,131,217],"of":[9,15,63,79,90,147,158,165,174,177,187,197,213,215],"cooperatively":[10],"executing":[11],"a":[12,54,64,87,102,127,141],"given":[13],"set":[14],"[Formula:":[16,21,107,114,128],"see":[17,22,108,115,129],"text]":[18,23,109,116],"tasks":[19,73,95,118],"by":[20,126],"asynchronous":[24],"processors":[25,110,137],"where":[26,71,93,119,155],"communication":[28,143,179,199],"medium":[29,200],"dynamic":[31,142],"and":[32,58,134,192,208],"subject":[33,139],"to":[34,74,112,140],"failures.":[35],"Also":[36],"known":[37,117],"as":[38],"do-all,":[39],"this":[40,83,91],"been":[42],"studied":[43],"extensively":[44],"various":[46],"settings.":[48],"In":[49,82],"[2],":[50],"authors":[52],"consider":[53],"partitionable":[55],"network":[56],"scenario":[57],"analyze":[59],"competitive":[61,153,185],"performance":[62,157],"randomized":[65,104],"scheduling":[66],"algorithm":[67,105,160,169,189],"for":[68,106],"case":[70],"be":[75],"completed":[76],"are":[77,124,138],"independent":[78],"each":[80],"other.":[81],"paper,":[84],"we":[85,151],"study":[86],"natural":[88],"extension":[89],"have":[96],"dependencies":[97,121],"among":[98],"them.":[99],"We":[100,181],"present":[101],"simple":[103],"cooperating":[111],"perform":[113],"between":[122],"them":[123],"defined":[125,205],"text]-partite":[130],"dependency":[132,218],"graph":[133],"additionally":[135],"these":[136],"medium.":[144,180],"By":[145],"virtue":[146],"setting,":[150],"pursue":[152],"analysis":[154],"our":[159,188],"measured":[162],"against":[163],"that":[164,183],"omniscient":[167],"offline":[168],"which":[170],"has":[171],"complete":[172],"knowledge":[173],"dynamics":[176,196],"show":[182],"ratio":[186],"tight":[191],"depends":[193],"on":[194,210],"viz.":[201],"computational":[203],"width":[204],"[2]":[207],"also":[209],"number":[212],"partitions":[214],"graph.":[219]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}