{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,10]],"date-time":"2026-01-10T02:09:25Z","timestamp":1768010965122,"version":"3.49.0"},"publisher-location":"New York, NY, USA","reference-count":22,"publisher":"ACM","license":[{"start":{"date-parts":[[2025,11,15]],"date-time":"2025-11-15T00:00:00Z","timestamp":1763164800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["2451267"],"award-info":[{"award-number":["2451267"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006754","name":"Army Research Laboratory","doi-asserted-by":"publisher","award":["W911NF-17-2-0196"],"award-info":[{"award-number":["W911NF-17-2-0196"]}],"id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,11,16]]},"DOI":"10.1145\/3731599.3767581","type":"proceedings-article","created":{"date-parts":[[2025,11,7]],"date-time":"2025-11-07T16:13:44Z","timestamp":1762532024000},"page":"2169-2180","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Adapting Classic Scheduling Heuristics for Online Execution under Uncertainty"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0009-0007-9712-3662","authenticated-orcid":false,"given":"Jason","family":"Chamorro","sequence":"first","affiliation":[{"name":"Loyola Marymount University, Los Angeles, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0004-2705-3556","authenticated-orcid":false,"given":"Gabriel","family":"Twigg-Ho","sequence":"additional","affiliation":[{"name":"Swinburne University of Technology, Melbourne, Australia"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1227-2962","authenticated-orcid":false,"given":"Jared","family":"Coleman","sequence":"additional","affiliation":[{"name":"Loyola Marymount University, Los Angeles, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0982-1919","authenticated-orcid":false,"given":"Tain\u00e3","family":"Coleman","sequence":"additional","affiliation":[{"name":"San Diego Supercomputer Center (SDSC), San Diego, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-9994-9931","authenticated-orcid":false,"given":"Bhaskar","family":"Krishnamachari","sequence":"additional","affiliation":[{"name":"University of Southern California (USC), Los Angeles, USA"}]},{"ORCID":"https:\/\/orcid.org\/0009-0005-5791-5337","authenticated-orcid":false,"given":"Mohammadali","family":"Khodabandehlou","sequence":"additional","affiliation":[{"name":"University of Southern California (USC), Los Angeles, USA"}]}],"member":"320","published-online":{"date-parts":[[2025,11,15]]},"reference":[{"key":"e_1_3_3_1_2_2","doi-asserted-by":"publisher","DOI":"10.1109\/e-Science62913.2024.10678686"},{"key":"e_1_3_3_1_3_2","doi-asserted-by":"crossref","unstructured":"Artem\u00a0M Chirkin Adam\u00a0SZ Belloum Sergey\u00a0V Kovalchuk Marc\u00a0X Makkes Mikhail\u00a0A Melnik Alexander\u00a0A Visheratin and Denis\u00a0A Nasonov. 2017. Execution time estimation for workflow scheduling. Future generation computer systems 75 (2017) 376\u2013387.","DOI":"10.1016\/j.future.2017.01.011"},{"key":"e_1_3_3_1_4_2","volume-title":"Proceedings of the 29th Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP)","author":"Coleman Jared","year":"2025","unstructured":"Jared Coleman, Ravi\u00a0Vivek Agrawal, Ebrahim Hirani, and Bhaskar Krishnamachari. 2025. Parameterized Task Graph Scheduling Algorithm for Comparing Algorithmic Components. In Proceedings of the 29th Workshop on Job Scheduling Strategies for Parallel Processing (JSSPP). arxiv:https:\/\/arXiv.org\/abs\/2403.07112\u00a0[cs.DC] https:\/\/arxiv.org\/abs\/2403.07112 To appear."},{"key":"e_1_3_3_1_5_2","doi-asserted-by":"publisher","DOI":"10.1109\/eScience51609.2021.00026"},{"key":"e_1_3_3_1_6_2","doi-asserted-by":"crossref","unstructured":"Tain\u00e3 Coleman Henri Casanova Lo\u00efc Pottier Manav Kaushik Ewa Deelman and Rafael\u00a0Ferreira da Silva. 2022. Wfcommons: A framework for enabling scientific workflow research and development. Future generation computer systems 128 (2022) 16\u201327.","DOI":"10.1016\/j.future.2021.09.043"},{"key":"e_1_3_3_1_7_2","doi-asserted-by":"crossref","unstructured":"Mehdi Hosseinzadeh Marwan\u00a0Yassin Ghafour Hawkar\u00a0Kamaran Hama Bay Vo and Afsane Khoshnevis. 2020. Multi-objective task and workflow scheduling approaches in cloud computing: a comprehensive review. Journal of Grid Computing 18 3 (2020) 327\u2013356.","DOI":"10.1007\/s10723-020-09533-z"},{"key":"e_1_3_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1109\/CCGRID.2018.00048"},{"key":"e_1_3_3_1_9_2","doi-asserted-by":"publisher","unstructured":"Yu-Kwong Kwok and I. Ahmad. 1996. Dynamic critical-path scheduling: an effective technique for allocating task graphs to multiprocessors. IEEE Transactions on Parallel and Distributed Systems 7 5 (1996) 506\u2013521. 10.1109\/71.503776","DOI":"10.1109\/71.503776"},{"key":"e_1_3_3_1_10_2","doi-asserted-by":"crossref","unstructured":"Kevin Lee Norman\u00a0W Paton Rizos Sakellariou Ewa Deelman Alvaro\u00a0AA Fernandes and Gaurang Mehta. 2009. Adaptive workflow processing and execution in pegasus. Concurrency and Computation: Practice and Experience 21 16 (2009) 1965\u20131981.","DOI":"10.1002\/cpe.1446"},{"key":"e_1_3_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1109\/AINA.2010.31"},{"key":"e_1_3_3_1_12_2","doi-asserted-by":"publisher","unstructured":"Limei Peng Ahmad\u00a0R. Dhaini and Pin-Han Ho. 2018. Toward integrated Cloud\u2013Fog networks for efficient IoT provisioning: Key challenges and solutions. Future Generation Computer Systems 88 (2018) 606\u2013613. 10.1016\/j.future.2018.05.015","DOI":"10.1016\/j.future.2018.05.015"},{"key":"e_1_3_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/3078597.3078604"},{"key":"e_1_3_3_1_14_2","doi-asserted-by":"publisher","unstructured":"Xiaoyong Tang Kenli Li Guiping Liao Kui Fang and Fan Wu. 2011. A stochastic scheduling algorithm for precedence constrained tasks on Grid. Future Generation Computer Systems 27 8 (2011) 1083\u20131091. 10.1016\/j.future.2011.04.007","DOI":"10.1016\/j.future.2011.04.007"},{"key":"e_1_3_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/RTTAS.1995.516213"},{"key":"e_1_3_3_1_16_2","doi-asserted-by":"publisher","unstructured":"H. Topcuoglu S. Hariri and Min-You Wu. 2002. Performance-effective and low-complexity task scheduling for heterogeneous computing. IEEE Transactions on Parallel and Distributed Systems 13 3 (2002) 260\u2013274. 10.1109\/71.993206","DOI":"10.1109\/71.993206"},{"key":"e_1_3_3_1_17_2","doi-asserted-by":"crossref","unstructured":"Benjamin Tovar Rafael\u00a0Ferreira Da\u00a0Silva Gideon Juve Ewa Deelman William Allcock Douglas Thain and Miron Livny. 2017. A job sizing strategy for high-throughput scientific workflows. IEEE Transactions on Parallel and Distributed Systems 29 2 (2017) 240\u2013253.","DOI":"10.1109\/TPDS.2017.2762310"},{"key":"e_1_3_3_1_18_2","doi-asserted-by":"crossref","unstructured":"Wei Wang Guosun Zeng Daizhong Tang and Jing Yao. 2012. Cloud-DLS: Dynamic trusted scheduling for Cloud computing. Expert systems with applications 39 3 (2012) 2321\u20132329.","DOI":"10.1016\/j.eswa.2011.08.048"},{"key":"e_1_3_3_1_19_2","doi-asserted-by":"publisher","DOI":"10.1109\/HPCS48598.2019.9188055"},{"key":"e_1_3_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/1048935.1050182"},{"key":"e_1_3_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1007\/10968987_3"},{"key":"e_1_3_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2007.370305"},{"key":"e_1_3_3_1_23_2","doi-asserted-by":"publisher","unstructured":"Junlong Zhou Mingyue Zhang Jin Sun Tian Wang Xiumin Zhou and Shiyan Hu. 2022. DRHEFT: Deadline-Constrained Reliability-Aware HEFT Algorithm for Real-Time Heterogeneous MPSoC Systems. IEEE Transactions on Reliability 71 1 (2022) 178\u2013189. 10.1109\/TR.2020.2981419","DOI":"10.1109\/TR.2020.2981419"}],"event":{"name":"SC Workshops '25: Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis","location":"St Louis MO USA","acronym":"SC Workshops '25","sponsor":["SIGHPC ACM Special Interest Group on High Performance Computing, Special Interest Group on High Performance Computing"]},"container-title":["Proceedings of the SC '25 Workshops of the International Conference for High Performance Computing, Networking, Storage and Analysis"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3731599.3767581","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3731599.3767581","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,1,9]],"date-time":"2026-01-09T19:28:10Z","timestamp":1767986890000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3731599.3767581"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,11,15]]},"references-count":22,"alternative-id":["10.1145\/3731599.3767581","10.1145\/3731599"],"URL":"https:\/\/doi.org\/10.1145\/3731599.3767581","relation":{},"subject":[],"published":{"date-parts":[[2025,11,15]]},"assertion":[{"value":"2025-11-15","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}