{"id":"https://openalex.org/W4412480886","doi":"https://doi.org/10.1145/3694906.3743329","title":"A New Algorithm for Online Scheduling of Rigid Task Graphs with Near-Optimal Competitive Ratio","display_name":"A New Algorithm for Online Scheduling of Rigid Task Graphs with Near-Optimal Competitive Ratio","publication_year":2025,"publication_date":"2025-07-16","ids":{"openalex":"https://openalex.org/W4412480886","doi":"https://doi.org/10.1145/3694906.3743329"},"language":"en","primary_location":{"id":"doi:10.1145/3694906.3743329","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743329","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743329","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743329","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008190319","display_name":"Lucas Perotin","orcid":"https://orcid.org/0000-0002-9739-7440"},"institutions":[{"id":"https://openalex.org/I200719446","display_name":"Vanderbilt University","ror":"https://ror.org/02vm5rt34","country_code":"US","type":"education","lineage":["https://openalex.org/I200719446"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lucas Perotin","raw_affiliation_strings":["Vanderbilt University, Nashville, TN, United States"],"raw_orcid":"https://orcid.org/0000-0002-9739-7440","affiliations":[{"raw_affiliation_string":"Vanderbilt University, Nashville, TN, United States","institution_ids":["https://openalex.org/I200719446"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5076659753","display_name":"Hongyang Sun","orcid":"https://orcid.org/0000-0002-4379-4467"},"institutions":[{"id":"https://openalex.org/I146416000","display_name":"University of Kansas","ror":"https://ror.org/001tmjg57","country_code":"US","type":"education","lineage":["https://openalex.org/I146416000"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hongyang Sun","raw_affiliation_strings":["University of Kansas, Lawrence, KS, United States"],"raw_orcid":"https://orcid.org/0000-0002-4379-4467","affiliations":[{"raw_affiliation_string":"University of Kansas, Lawrence, KS, United States","institution_ids":["https://openalex.org/I146416000"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5102868534","display_name":"Padma Raghavan","orcid":"https://orcid.org/0009-0002-6785-2112"},"institutions":[{"id":"https://openalex.org/I200719446","display_name":"Vanderbilt University","ror":"https://ror.org/02vm5rt34","country_code":"US","type":"education","lineage":["https://openalex.org/I200719446"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Padma Raghavan","raw_affiliation_strings":["Vanderbilt University, Nashville, TN, United States"],"raw_orcid":"https://orcid.org/0009-0002-6785-2112","affiliations":[{"raw_affiliation_string":"Vanderbilt University, Nashville, TN, United States","institution_ids":["https://openalex.org/I200719446"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5008190319"],"corresponding_institution_ids":["https://openalex.org/I200719446"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.184106,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"210","last_page":"224"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9994999766349792,"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.9994999766349792,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9980000257492065,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7893848419189453},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6734079122543335},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5463852882385254},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.511438250541687},{"id":"https://openalex.org/keywords/processor-scheduling","display_name":"Processor scheduling","score":0.5090619921684265},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5074626803398132},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.37943968176841736},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.36138415336608887},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.15887469053268433},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.11824071407318115},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.10911574959754944},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.07876598834991455}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7893848419189453},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6734079122543335},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5463852882385254},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.511438250541687},{"id":"https://openalex.org/C2984822820","wikidata":"https://www.wikidata.org/wiki/Q1123036","display_name":"Processor scheduling","level":3,"score":0.5090619921684265},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5074626803398132},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.37943968176841736},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36138415336608887},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.15887469053268433},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.11824071407318115},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.10911574959754944},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.07876598834991455},{"id":"https://openalex.org/C206345919","wikidata":"https://www.wikidata.org/wiki/Q20380951","display_name":"Resource (disambiguation)","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/C201995342","wikidata":"https://www.wikidata.org/wiki/Q682496","display_name":"Systems engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3694906.3743329","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743329","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743329","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3694906.3743329","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3694906.3743329","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3694906.3743329","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 37th ACM Symposium on Parallelism in Algorithms and Architectures","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4412480886.pdf","grobid_xml":"https://content.openalex.org/works/W4412480886.grobid-xml"},"referenced_works_count":26,"referenced_works":["https://openalex.org/W1605529813","https://openalex.org/W1606760325","https://openalex.org/W1967030015","https://openalex.org/W1968793818","https://openalex.org/W1997959089","https://openalex.org/W2001066639","https://openalex.org/W2011039300","https://openalex.org/W2019261717","https://openalex.org/W2019318803","https://openalex.org/W2032392871","https://openalex.org/W2038303146","https://openalex.org/W2045215405","https://openalex.org/W2055717964","https://openalex.org/W2081840458","https://openalex.org/W2081987145","https://openalex.org/W2086677494","https://openalex.org/W2090166506","https://openalex.org/W2104680817","https://openalex.org/W2127960094","https://openalex.org/W2142860409","https://openalex.org/W2154305205","https://openalex.org/W2790772211","https://openalex.org/W4249650703","https://openalex.org/W4296583912","https://openalex.org/W4367365978","https://openalex.org/W6748656999"],"related_works":["https://openalex.org/W4213299358","https://openalex.org/W2564742953","https://openalex.org/W2793095688","https://openalex.org/W1623410360","https://openalex.org/W3115340459","https://openalex.org/W2950803469","https://openalex.org/W2583614279","https://openalex.org/W2004975914","https://openalex.org/W2109659895","https://openalex.org/W1970915793"],"abstract_inverted_index":{"This":[0],"paper":[1],"addresses":[2],"the":[3,41,46,63,73,82,116,119,133,138,147],"challenges":[4],"of":[5,56,65,91,106,118,135],"online":[6,31,160],"scheduling":[7],"within":[8],"high-performance":[9],"computing":[10],"(HPC)":[11],"systems,":[12],"focusing":[13],"on":[14,72],"rigid":[15],"parallel":[16],"tasks":[17,38,71,136],"with":[18,60],"precedence":[19],"constraints":[20],"organized":[21],"as":[22],"a":[23,53,103,128,164],"directed":[24],"acyclic":[25],"graph":[26],"(DAG).":[27],"We":[28,48,97],"introduce":[29],"an":[30,88],"algorithm,":[32,85],"called":[33],"CATBATCH,":[34],"which":[35,86],"efficiently":[36],"schedules":[37],"to":[39],"minimize":[40],"overall":[42],"completion":[43],"time,":[44],"or":[45,137,170],"makespan.":[47],"show":[49,99],"that":[50,100,158],"CATBATCH":[51,68,101,126],"achieves":[52,102,127],"competitive":[54,104,130,165],"ratio":[55,90,105,131,166],"log(n)":[57],"+":[58,93,95,109],"3,":[59],"n":[61],"being":[62],"number":[64,134],"tasks.":[66],"Although":[67],"only":[69],"discovers":[70],"fly":[74],"when":[75,132],"they":[76],"are":[77,115,141],"ready,":[78],"it":[79],"almost":[80],"matches":[81],"best":[83],"offline":[84],"has":[87],"approximation":[89],"log(n":[92],"1)":[94],"2.":[96],"further":[98],"log":[107],"(M/m)":[108],"6,":[110],"where":[111],"M":[112],"and":[113,121],"m":[114],"lengths":[117,140],"longest":[120],"shortest":[122],"tasks,":[123],"respectively.":[124],"Consequently,":[125],"constant":[129],"task":[139],"bounded.":[142],"Finally,":[143],"our":[144],"analysis":[145],"indicates":[146],"algorithm's":[148],"near-optimal":[149],"performance":[150],"in":[151,173],"worst-case":[152],"scenarios":[153],"for":[154],"both":[155],"metrics,":[156],"showing":[157],"no":[159],"algorithm":[161],"can":[162],"have":[163],"lower":[167],"than":[168],"\u0398(log(n))":[169],"\u0398(log":[171],"(M/m))":[172],"this":[174],"context.":[175]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}