{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T08:39:52Z","timestamp":1766219992893,"version":"3.48.0"},"publisher-location":"New York, NY, USA","reference-count":30,"publisher":"ACM","funder":[{"DOI":"10.13039\/100000015","name":"DOE U.S. Department of Energy","doi-asserted-by":"publisher","award":["DE-AC02-06CH11357"],"award-info":[{"award-number":["DE-AC02-06CH11357"]}],"id":[{"id":"10.13039\/100000015","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2025,9,8]]},"DOI":"10.1145\/3754598.3754639","type":"proceedings-article","created":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T08:34:32Z","timestamp":1766219672000},"page":"178-187","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Deadline-Aware Scheduling of Mixed-Criticality Tasks"],"prefix":"10.1145","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-3306-0483","authenticated-orcid":false,"given":"Maxime","family":"Gonthier","sequence":"first","affiliation":[{"name":"University of Chicago, Chicago, USA and Argonne National Laboratory, Lemont, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7370-4805","authenticated-orcid":false,"given":"Kyle","family":"Chard","sequence":"additional","affiliation":[{"name":"University of Chicago, Chicago, USA and Argonne National Laboratory, Lemont, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2129-5269","authenticated-orcid":false,"given":"Ian","family":"Foster","sequence":"additional","affiliation":[{"name":"University of Chicago, Chicago, USA and Argonne National Laboratory, Lemont, USA"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5519-9913","authenticated-orcid":false,"given":"Loris","family":"Marchal","sequence":"additional","affiliation":[{"name":"CNRS, Lyon, France and \u00c9TS Montr\u00e9al, Montr\u00e9al, Canada"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0663-6152","authenticated-orcid":false,"given":"Fr\u00e9d\u00e9ric","family":"Vivien","sequence":"additional","affiliation":[{"name":"INRIA, Lyon, France"}]}],"member":"320","published-online":{"date-parts":[[2025,12,20]]},"reference":[{"key":"e_1_3_3_2_2_2","doi-asserted-by":"publisher","unstructured":"Mainak Adhikari Tarachand Amgoth and Satish\u00a0Narayana Srirama. 2019. A Survey on Scheduling Strategies for Workflows in Cloud Environment and Emerging Trends. ACM Comput. Surv. (2019). 10.1145\/3325097","DOI":"10.1145\/3325097"},{"key":"e_1_3_3_2_3_2","doi-asserted-by":"publisher","unstructured":"Vahid Arabnejad Kris Bubendorfer and Bryan Ng. 2019. Budget and Deadline Aware e-Science Workflow Scheduling in Clouds. IEEE Transactions on Parallel and Distributed Systems 30 1 (2019) 29\u201344. 10.1109\/TPDS.2018.2849396","DOI":"10.1109\/TPDS.2018.2849396"},{"key":"e_1_3_3_2_4_2","doi-asserted-by":"crossref","unstructured":"L. Bautista-Gomez A. Benoit S. Di Th. Herault Y. Robert and H. Sun. 2024. A survey on checkpointing strategies: Should we always checkpoint \u00e0 la Young\/Daly? Future Generation Computer Systems 161 (2024).","DOI":"10.1016\/j.future.2024.07.022"},{"key":"e_1_3_3_2_5_2","volume-title":"ACM-SIAM SoDA","author":"Bender M.\u00a0A.","year":"1998","unstructured":"M.\u00a0A. Bender, S. Chakrabarti, and S. Muthukrishnan. 1998. Flow and Stretch Metrics for Scheduling Continuous Job Streams. In ACM-SIAM SoDA."},{"key":"e_1_3_3_2_6_2","unstructured":"Nick Brown Gordon Gibb Evgenij Belikov and Rupert Nash. 2022. Predicting batch queue job wait times for informed scheduling of urgent HPC workloads. https:\/\/arxiv.org\/abs\/2204.13543"},{"key":"e_1_3_3_2_7_2","volume-title":"Mixed Criticality Systems - A Review (13th ed.)","author":"Burns Alan","year":"2022","unstructured":"Alan Burns and Robert\u00a0Ian Davis. 2022. Mixed Criticality Systems - A Review (13th ed.). White Rose Research Online. https:\/\/eprints.whiterose.ac.uk\/183619."},{"key":"e_1_3_3_2_8_2","doi-asserted-by":"crossref","unstructured":"Maria\u00a0Carla Calzarossa Marco L.\u00a0Della Vedova Luisa Massari Giuseppe Nebbione and Daniele Tessera. 2021. Multi-Objective Optimization of Deadline and Budget-Aware Workflow Scheduling in Uncertain Clouds. IEEE Access 9 (2021).","DOI":"10.1109\/ACCESS.2021.3091310"},{"key":"e_1_3_3_2_9_2","doi-asserted-by":"crossref","unstructured":"Leah Epstein and Rob van Stee. 2003. Lower bounds for on-line single-machine scheduling. Theoretical Computer Science 299 1 (2003) 439\u2013450.","DOI":"10.1016\/S0304-3975(02)00488-7"},{"key":"e_1_3_3_2_10_2","unstructured":"M.\u00a0E. Fenstermacher J. Abbate S. Abe T. Abrams M. Adams B. Adamson N. Aiba Akiyama et\u00a0al. 2022. DIII-D research advancing the physics basis for optimizing the tokamak approach to fusion energy. Nuclear Fusion 62 4 (2022)."},{"key":"e_1_3_3_2_11_2","unstructured":"Nathan\u00a0W. Fisher. 2007. The multiprocessor real-time scheduling of general task systems. Ph.\u00a0D. Dissertation. The University of North Carolina at Chapel Hill."},{"key":"e_1_3_3_2_12_2","doi-asserted-by":"publisher","DOI":"10.1145\/3472883.3486978"},{"key":"e_1_3_3_2_13_2","volume-title":"Computers and Intractability, A Guide to the Theory of NP-Completeness","author":"Garey M.\u00a0R.","year":"1979","unstructured":"M.\u00a0R. Garey and D.\u00a0S. Johnson. 1979. Computers and Intractability, A Guide to the Theory of NP-Completeness. W.H. Freeman and Co, London (UK)."},{"key":"e_1_3_3_2_14_2","volume-title":"Annals of discrete mathematics","author":"Graham Ronald\u00a0Lewis","year":"1979","unstructured":"Ronald\u00a0Lewis Graham, Eugene\u00a0Leighton Lawler, Jan\u00a0Karel Lenstra, and AHG\u00a0Rinnooy Kan. 1979. Optimization and approximation in deterministic sequencing and scheduling: a survey. In Annals of discrete mathematics. Elsevier."},{"key":"e_1_3_3_2_15_2","doi-asserted-by":"publisher","DOI":"10.1145\/3575693.3575721"},{"key":"e_1_3_3_2_16_2","doi-asserted-by":"publisher","DOI":"10.1007\/11407522_6"},{"key":"e_1_3_3_2_17_2","doi-asserted-by":"crossref","unstructured":"M. Hussain M.-X. Luo A. Hussain M.\u00a0Hafeez Javed Z. Abbas and L.-F. Wei. 2023. Deadline-constrained cost-aware workflow scheduling in hybrid cloud. Simulation Modelling Practice and Theory 129 (2023).","DOI":"10.1016\/j.simpat.2023.102819"},{"key":"e_1_3_3_2_18_2","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45540-X_6"},{"key":"e_1_3_3_2_19_2","volume-title":"Algorithm design","author":"Kleinberg Jon","year":"2006","unstructured":"Jon Kleinberg and Eva Tardos. 2006. Algorithm design. Pearson Education India."},{"key":"e_1_3_3_2_20_2","doi-asserted-by":"crossref","unstructured":"Arnaud Legrand Alan Su and Fr\u00e9d\u00e9ric Vivien. 2008. Minimizing the Stretch When Scheduling Flows of Divisible Requests. Journal of Scheduling (2008).","DOI":"10.1007\/s10951-008-0078-4"},{"key":"e_1_3_3_2_21_2","doi-asserted-by":"crossref","unstructured":"C.\u00a0L. Liu and James\u00a0W. Layland. 1973. Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment. J. ACM (1973).","DOI":"10.1145\/321738.321743"},{"key":"e_1_3_3_2_22_2","doi-asserted-by":"crossref","unstructured":"J\u00a0Michael Moore. 1968. An n job one machine sequencing algorithm for minimizing the number of late jobs. Management science 15 1 (1968) 102\u2013109.","DOI":"10.1287\/mnsc.15.1.102"},{"key":"e_1_3_3_2_23_2","unstructured":"B. Moseley K. Pruhs C. Stein and R. Zhou. 2024. A Competitive Algorithm for Throughput Maximization on Identical Machines. arxiv:https:\/\/arXiv.org\/abs\/2111.06564"},{"key":"e_1_3_3_2_24_2","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258570"},{"key":"e_1_3_3_2_25_2","unstructured":"PuLP 2025. Optimization with PuLP. https:\/\/coin-or.github.io\/pulp\/."},{"key":"e_1_3_3_2_26_2","unstructured":"A. Reuther N. Brown W. Arndt J. Blaschke C. Boehme A. Chazapis B. Enders R. Henschel J. Kunkel and M. Martinasso. 2024. Interactive and urgent HPC: challenges and opportunities. arXiv:https:\/\/arXiv.org\/abs\/2401.14550 (2024)."},{"key":"e_1_3_3_2_27_2","doi-asserted-by":"crossref","unstructured":"Frits C.\u00a0R. Spieksma. 1999. On the approximability of an interval scheduling problem. Journal of Scheduling 2 5 (1999) 215\u2013227.","DOI":"10.1002\/(SICI)1099-1425(199909\/10)2:5<215::AID-JOS27>3.0.CO;2-Y"},{"key":"e_1_3_3_2_28_2","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTR.2007.4629218"},{"key":"e_1_3_3_2_29_2","doi-asserted-by":"crossref","unstructured":"Fuhui Wu Qingbo Wu and Yusong Tan. 2015. Workflow scheduling in cloud: a survey. The Journal of Supercomputing 71 (2015) 3373\u20133418.","DOI":"10.1007\/s11227-015-1438-4"},{"key":"e_1_3_3_2_30_2","doi-asserted-by":"crossref","unstructured":"J. Yu and R. Buyya. 2006. Scheduling Scientific Workflow Applications with Deadline and Budget Constraints Using Genetic Algorithms. Scientific Programming (2006).","DOI":"10.1155\/2006\/271608"},{"key":"e_1_3_3_2_31_2","doi-asserted-by":"publisher","unstructured":"Yuchen Zhang Long Luo Gang Sun Hongfang Yu and Bo Li. 2025. Deadline-aware Online Job Scheduling for Distributed Training in Heterogeneous Clusters. IEEE Transactions on Cloud Computing (2025). 10.1109\/TCC.2025.3548604","DOI":"10.1109\/TCC.2025.3548604"}],"event":{"name":"ICPP '25: 54th International Conference on Parallel Processing","location":"San Diego CA USA","acronym":"ICPP '25"},"container-title":["Proceedings of the 54th International Conference on Parallel Processing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3754598.3754639","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T08:37:35Z","timestamp":1766219855000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3754598.3754639"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,9,8]]},"references-count":30,"alternative-id":["10.1145\/3754598.3754639","10.1145\/3754598"],"URL":"https:\/\/doi.org\/10.1145\/3754598.3754639","relation":{},"subject":[],"published":{"date-parts":[[2025,9,8]]},"assertion":[{"value":"2025-12-20","order":3,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}