{"id":"https://openalex.org/W4296583912","doi":"https://doi.org/10.1145/3545008.3545049","title":"Online Scheduling of Moldable Task Graphs under Common Speedup Models","display_name":"Online Scheduling of Moldable Task Graphs under Common Speedup Models","publication_year":2022,"publication_date":"2022-08-29","ids":{"openalex":"https://openalex.org/W4296583912","doi":"https://doi.org/10.1145/3545008.3545049"},"language":"en","primary_location":{"id":"doi:10.1145/3545008.3545049","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3545008.3545049","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st International Conference on Parallel Processing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://inria.hal.science/hal-03778405","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5037778045","display_name":"Anne Beno\u00eet","orcid":"https://orcid.org/0000-0003-2910-3540"},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I4210144566","display_name":"Laboratoire de l'Informatique du Parall\u00e9lisme","ror":"https://ror.org/04msnz457","country_code":"FR","type":"facility","lineage":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I4210144566"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Anne Benoit","raw_affiliation_strings":["LIP, ENS Lyon, France"],"affiliations":[{"raw_affiliation_string":"LIP, ENS Lyon, France","institution_ids":["https://openalex.org/I4210144566","https://openalex.org/I113428412"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5008190319","display_name":"Lucas Perotin","orcid":"https://orcid.org/0000-0002-9739-7440"},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I4210144566","display_name":"Laboratoire de l'Informatique du Parall\u00e9lisme","ror":"https://ror.org/04msnz457","country_code":"FR","type":"facility","lineage":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I4210144566"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Lucas Perotin","raw_affiliation_strings":["LIP, ENS Lyon, France"],"affiliations":[{"raw_affiliation_string":"LIP, ENS Lyon, France","institution_ids":["https://openalex.org/I4210144566","https://openalex.org/I113428412"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001838181","display_name":"Yves Robert","orcid":"https://orcid.org/0000-0003-2361-055X"},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I75027704","display_name":"University of Tennessee at Knoxville","ror":"https://ror.org/020f3ap87","country_code":"US","type":"education","lineage":["https://openalex.org/I75027704"]}],"countries":["FR","US"],"is_corresponding":false,"raw_author_name":"Yves Robert","raw_affiliation_strings":["LIP, ENS Lyon, France and University of Tennessee Knoxville, France","ICL - Innovative Computing Laboratory [Knoxville] (Suite 203 Claxton\r\n1122 Volunteer Blvd\r\nKnoxville, TN 37996 - United States)"],"affiliations":[{"raw_affiliation_string":"LIP, ENS Lyon, France and University of Tennessee Knoxville, France","institution_ids":["https://openalex.org/I75027704","https://openalex.org/I113428412"]},{"raw_affiliation_string":"ICL - Innovative Computing Laboratory [Knoxville] (Suite 203 Claxton\r\n1122 Volunteer Blvd\r\nKnoxville, TN 37996 - United States)","institution_ids":["https://openalex.org/I75027704"]}]},{"author_position":"last","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, United States of America","University of Kansas [Kansas City] (Kansas City, KS, USA - United States)"],"affiliations":[{"raw_affiliation_string":"University of Kansas, United States of America","institution_ids":["https://openalex.org/I146416000"]},{"raw_affiliation_string":"University of Kansas [Kansas City] (Kansas City, KS, USA - United States)","institution_ids":["https://openalex.org/I146416000"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5037778045"],"corresponding_institution_ids":["https://openalex.org/I113428412","https://openalex.org/I4210144566"],"apc_list":null,"apc_paid":null,"fwci":0.5683,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.6835814,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"11"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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/T10715","display_name":"Distributed and Parallel Computing Systems","score":0.9994000196456909,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9972000122070312,"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/speedup","display_name":"Speedup","score":0.899763822555542},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.808152437210083},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7497259974479675},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6603520512580872},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.5767200589179993},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5607861280441284},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5466005802154541},{"id":"https://openalex.org/keywords/multiprocessing","display_name":"Multiprocessing","score":0.5061351656913757},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.479207843542099},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.42497238516807556},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3818489909172058},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2880270779132843},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.2685868442058563},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.16583597660064697},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.08275368809700012},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.06919479370117188}],"concepts":[{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.899763822555542},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.808152437210083},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7497259974479675},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6603520512580872},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.5767200589179993},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5607861280441284},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5466005802154541},{"id":"https://openalex.org/C4822641","wikidata":"https://www.wikidata.org/wiki/Q846651","display_name":"Multiprocessing","level":2,"score":0.5061351656913757},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.479207843542099},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.42497238516807556},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3818489909172058},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2880270779132843},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.2685868442058563},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.16583597660064697},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.08275368809700012},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.06919479370117188},{"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":2,"locations":[{"id":"doi:10.1145/3545008.3545049","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3545008.3545049","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 51st International Conference on Parallel Processing","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-03778405v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-03778405","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ICPP 2022 - 51st International Conference on Parallel Processing, Aug 2022, Bordeaux, France. pp.1-11, ⟨10.1145/3545008.3545049⟩","raw_type":"Conference papers"}],"best_oa_location":{"id":"pmh:oai:HAL:hal-03778405v1","is_oa":true,"landing_page_url":"https://inria.hal.science/hal-03778405","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ICPP 2022 - 51st International Conference on Parallel Processing, Aug 2022, Bordeaux, France. pp.1-11, ⟨10.1145/3545008.3545049⟩","raw_type":"Conference papers"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1491838213","https://openalex.org/W1605529813","https://openalex.org/W1916275345","https://openalex.org/W1967030015","https://openalex.org/W1968116929","https://openalex.org/W2002555321","https://openalex.org/W2028801713","https://openalex.org/W2041645394","https://openalex.org/W2045215405","https://openalex.org/W2054626117","https://openalex.org/W2071698746","https://openalex.org/W2081840458","https://openalex.org/W2086190489","https://openalex.org/W2086677494","https://openalex.org/W2090166506","https://openalex.org/W2150871235","https://openalex.org/W2787020575","https://openalex.org/W2963661393","https://openalex.org/W2973989741","https://openalex.org/W3125275612"],"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/W4390203503","https://openalex.org/W2797898895","https://openalex.org/W2131569046","https://openalex.org/W2045215405"],"abstract_inverted_index":{"The":[0],"problem":[1,71],"of":[2,12,51,99,122,141,147],"scheduling":[3,50],"moldable":[4,52],"tasks":[5,27,35,142],"on":[6,46,96,118,138],"multiprocessor":[7],"systems":[8],"with":[9],"the":[10,14,97,107,114,119,128,139,144,148],"objective":[11],"minimizing":[13],"overall":[15],"completion":[16],"time":[17],"(or":[18],"makespan)":[19],"has":[20],"been":[21],"widely":[22],"studied,":[23],"in":[24,143],"particular":[25],"when":[26,34],"have":[28,44],"dependencies":[29],"(i.e.,":[30,39,48,79],"task":[31,53],"graphs),":[32],"or":[33],"are":[36],"released":[37],"on-the-fly":[38],"online).":[40],"However,":[41],"few":[42],"studies":[43],"focused":[45],"both":[47],"online":[49,62,125],"graphs).":[54],"In":[55],"this":[56,70],"paper,":[57],"we":[58,112],"design":[59],"a":[60,84,93],"new":[61],"algorithm":[63,126],"and":[64,83],"derive":[65],"constant":[66,108,135],"competitive":[67,109,120],"ratios":[68],"for":[69,90,127],"under":[72],"several":[73],"common":[74],"yet":[75],"realistic":[76],"speedup":[77,130],"models":[78],"roofline,":[80],"communication,":[81],"Amdahl,":[82],"general":[85],"combination).":[86],"We":[87],"also":[88],"prove,":[89],"each":[91],"model,":[92,131],"lower":[94,116],"bound":[95,117],"competitiveness":[98],"our":[100],"algorithm,":[101],"which":[102,132],"is":[103,133],"very":[104],"close":[105],"to":[106],"ratio.":[110],"Finally,":[111],"provide":[113],"first":[115],"ratio":[121],"any":[123],"deterministic":[124],"arbitrary":[129],"not":[134],"but":[136],"depends":[137],"number":[140],"longest":[145],"path":[146],"graph.":[149]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1}],"updated_date":"2026-03-22T08:09:32.410652","created_date":"2025-10-10T00:00:00"}