{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,21]],"date-time":"2026-03-21T19:23:20Z","timestamp":1774121000134,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":23,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,8,29]],"date-time":"2022-08-29T00:00:00Z","timestamp":1661731200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"NSF","award":["2135310"],"award-info":[{"award-number":["2135310"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,8,29]]},"DOI":"10.1145\/3545008.3545049","type":"proceedings-article","created":{"date-parts":[[2023,1,15]],"date-time":"2023-01-15T01:04:08Z","timestamp":1673744648000},"page":"1-11","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Online Scheduling of Moldable Task Graphs under Common Speedup Models"],"prefix":"10.1145","author":[{"given":"Anne","family":"Benoit","sequence":"first","affiliation":[{"name":"LIP, ENS Lyon, France"}]},{"given":"Lucas","family":"Perotin","sequence":"additional","affiliation":[{"name":"LIP, ENS Lyon, France"}]},{"given":"Yves","family":"Robert","sequence":"additional","affiliation":[{"name":"LIP, ENS Lyon, France and University of Tennessee Knoxville, France"}]},{"given":"Hongyang","family":"Sun","sequence":"additional","affiliation":[{"name":"University of Kansas, United States of America"}]}],"member":"320","published-online":{"date-parts":[[2023,1,13]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"crossref","unstructured":"Kunal Agrawal Charles\u00a0E. Leiserson and Jim Sukha. 2010. Executing task graphs using work-stealing. In IPDPS. 1\u201312.","DOI":"10.1109\/IPDPS.2010.5470403"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"crossref","unstructured":"Gene\u00a0M. Amdahl. 1967. Validity of the Single Processor Approach to Achieving Large Scale Computing Capabilities. In AFIPS\u201967. 483\u2013485.","DOI":"10.1145\/1465482.1465560"},{"key":"e_1_3_2_1_3_1","volume-title":"Lucas Perotin, Padma Raghavan, Yves Robert, and Hongyang Sun.","author":"Benoit Anne","year":"2020","unstructured":"Anne Benoit, Valentin Le F\u00e8vre, Lucas Perotin, Padma Raghavan, Yves Robert, and Hongyang Sun. 2020. Resilient scheduling of moldable jobs on failure-prone platforms. In IEEE Cluster."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2021.3104747"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2019.2942909"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2012.258"},{"key":"e_1_3_2_1_7_1","volume-title":"Dutton and Weizhen Mao","author":"A.","year":"2007","unstructured":"Richard\u00a0A. Dutton and Weizhen Mao. 2007. Online Scheduling of Malleable Parallel Jobs. In PDCS (Cambridge, Massachusetts). 136\u2013141."},{"key":"e_1_3_2_1_8_1","volume-title":"Feitelson and Larry Rudolph","author":"G.","year":"1996","unstructured":"Dror\u00a0G. Feitelson and Larry Rudolph. 1996. Toward convergence in job schedulers for parallel supercomputers. In Job Scheduling Strategies for Parallel Processing. Springer, 1\u201326."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009794729459"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ejor.2006.06.064"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Klaus Jansen. 2012. A (3\/2 + \u03f5) Approximation Algorithm for Scheduling Moldable and Non-moldable Parallel Tasks. In SPAA. 224\u2013235.","DOI":"10.1145\/2312005.2312048"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"crossref","unstructured":"K. Jansen and F. Land. 2018. Scheduling Monotone Moldable Jobs in Linear Time. In IPDPS. 172\u2013181.","DOI":"10.1109\/IPDPS.2018.00027"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"crossref","unstructured":"Klaus Jansen and Hu Zhang. 2005. Scheduling Malleable Tasks with Precedence Constraints. In SPAA. 86\u201395.","DOI":"10.1145\/1073970.1073983"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1159892.1159899"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-006-8497-6"},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1016\/0167-8191(95)00061-5"},{"key":"e_1_3_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-014-0406-9"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"crossref","unstructured":"Renaud Lep\u00e8re Denis Trystram and Gerhard\u00a0J. Woeginger. 2001. Approximation Algorithms for Scheduling Malleable Tasks Under Precedence Constraints. In ESA. 146\u2013157.","DOI":"10.1007\/3-540-44676-1_12"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"crossref","unstructured":"John Turek Joel\u00a0L. Wolf and Philip\u00a0S. Yu. 1992. Approximate Algorithms Scheduling Parallelizable Tasks. In SPAA (San Diego California USA).","DOI":"10.1145\/140901.141909"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1137\/0221021"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1498765.1498785"},{"key":"e_1_3_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10951-018-0556-2"}],"event":{"name":"ICPP '22: 51st International Conference on Parallel Processing","location":"Bordeaux France","acronym":"ICPP '22"},"container-title":["Proceedings of the 51st International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3545008.3545049","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3545008.3545049","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3545008.3545049","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:02:44Z","timestamp":1750186964000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3545008.3545049"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,8,29]]},"references-count":23,"alternative-id":["10.1145\/3545008.3545049","10.1145\/3545008"],"URL":"https:\/\/doi.org\/10.1145\/3545008.3545049","relation":{},"subject":[],"published":{"date-parts":[[2022,8,29]]},"assertion":[{"value":"2023-01-13","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}