{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,1]],"date-time":"2026-05-01T22:46:01Z","timestamp":1777675561968,"version":"3.51.4"},"reference-count":47,"publisher":"SAGE Publications","issue":"6","license":[{"start":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T00:00:00Z","timestamp":1565568000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["The International Journal of High Performance Computing Applications"],"published-print":{"date-parts":[[2019,11]]},"abstract":"<jats:p>This work deals with scheduling and checkpointing strategies to execute scientific workflows on failure-prone large-scale platforms. To the best of our knowledge, this work is the first to target fail-stop errors for arbitrary workflows. Most previous work addresses soft errors, which corrupt the task being executed by a processor but do not cause the entire memory of that processor to be lost, contrarily to fail-stop errors. We revisit classical mapping heuristics such as Heterogeneous Earliest Finish Time and MinMin and complement them with several checkpointing strategies. The objective is to derive an efficient trade-off between checkpointing every task (CkptAll), which is an overkill when failures are rare events, and checkpointing no task (CkptNone), which induces dramatic re-execution overhead even when only a few failures strike during execution. Contrarily to previous work, our approach applies to arbitrary workflows, not just special classes of dependence graphs such as minimal series-parallel graphs. Extensive experiments report significant gain over both CkptAll and CkptNone for a wide variety of workflows.<\/jats:p>","DOI":"10.1177\/1094342019866891","type":"journal-article","created":{"date-parts":[[2019,8,12]],"date-time":"2019-08-12T23:15:14Z","timestamp":1565651714000},"page":"1255-1274","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":7,"title":["A generic approach to scheduling and checkpointing workflows"],"prefix":"10.1177","volume":"33","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5797-2554","authenticated-orcid":false,"given":"Li","family":"Han","sequence":"first","affiliation":[{"name":"East China Normal University, Shanghai, China"},{"name":"Univ Lyon, CNRS, ENS de Lyon, Inria, Universit\u00e9 Claude-Bernard Lyon, LYON, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6853-5392","authenticated-orcid":false,"given":"Valentin","family":"Le F\u00e8vre","sequence":"additional","affiliation":[{"name":"Univ Lyon, CNRS, ENS de Lyon, Inria, Universit\u00e9 Claude-Bernard Lyon, LYON, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Louis-Claude","family":"Canon","sequence":"additional","affiliation":[{"name":"FEMTO-ST Institute, CNRS, Univ. Bourgogne Franche-Comt\u00e9, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2361-055X","authenticated-orcid":false,"given":"Yves","family":"Robert","sequence":"additional","affiliation":[{"name":"Univ Lyon, CNRS, ENS de Lyon, Inria, Universit\u00e9 Claude-Bernard Lyon, LYON, France"},{"name":"University of Tennessee Knoxville, Knoxville, TN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0663-6152","authenticated-orcid":false,"given":"Fr\u00e9d\u00e9ric","family":"Vivien","sequence":"additional","affiliation":[{"name":"Univ Lyon, CNRS, ENS de Lyon, Inria, Universit\u00e9 Claude-Bernard Lyon, LYON, France"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2019,8,12]]},"reference":[{"key":"bibr1-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1145\/2443416.2443417"},{"key":"bibr2-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1109\/SSDM.2004.1311241"},{"key":"bibr3-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2004.1311904"},{"key":"bibr4-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.1631"},{"key":"bibr5-1094342019866891","doi-asserted-by":"publisher","DOI":"10.15803\/ijnc.6.1_2"},{"key":"bibr6-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1109\/FTCS.1997.614079"},{"key":"bibr7-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1145\/2692916.2555279"},{"key":"bibr8-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER.2015.108"},{"key":"bibr9-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1145\/2897189"},{"key":"bibr10-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1145\/2749246.2749253"},{"key":"bibr11-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1109\/WORKS.2008.4723958"},{"key":"bibr12-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2008.12.002"},{"key":"bibr13-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1006\/jpdc.2000.1714"},{"key":"bibr14-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2015.81"},{"issue":"1","key":"bibr15-1094342019866891","volume":"1","author":"Cappello F","year":"2014","journal-title":"Supercomputing Frontiers and Innovations"},{"key":"bibr16-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1155\/1996\/483083"},{"key":"bibr17-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1109\/eScience.2014.44"},{"key":"bibr18-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1362-8"},{"key":"bibr19-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1155\/2005\/128026"},{"key":"bibr20-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2014.10.008"},{"key":"bibr21-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1145\/378420.378824"},{"key":"bibr22-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84882-310-5"},{"key":"bibr23-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1007\/11557654_81"},{"key":"bibr24-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-84628-757-2_27"},{"issue":"1","key":"bibr25-1094342019866891","volume":"67","author":"Han L","year":"2018","journal-title":"IEEE Transactions on Computers"},{"key":"bibr26-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1145\/3225058.3225145"},{"key":"bibr27-1094342019866891","volume-title":"Fault-Tolerance Techniques for High-Performance Computing, Computer Communications and Networks","author":"H\u00e9rault T","year":"2015"},{"key":"bibr28-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1109\/TC.1984.1676475"},{"key":"bibr29-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1109\/HPDC.2003.1210023"},{"key":"bibr30-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1109\/CCGRID.2009.55"},{"key":"bibr31-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2012.08.015"},{"key":"bibr32-1094342019866891","doi-asserted-by":"publisher","DOI":"10.7494\/csci.2016.17.3.387"},{"key":"bibr33-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1109\/CLOUDCOM-ASIA.2013.83"},{"key":"bibr34-1094342019866891","unstructured":"Pegasus (2014) Pegasus workflow generator. Available at: https:\/\/confluence.pegasus.isi.edu\/display\/pegasus\/WorkflowGenerator."},{"key":"bibr35-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1137\/0914074"},{"key":"bibr36-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1145\/2304576.2304588"},{"key":"bibr37-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1002\/jos.116"},{"key":"bibr38-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1016\/j.jcss.2009.11.003"},{"key":"bibr39-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1109\/71.993206"},{"key":"bibr40-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1137\/0213039"},{"key":"bibr41-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1145\/800135.804393"},{"key":"bibr42-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1109\/DSN.2014.58"},{"key":"bibr43-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1016\/j.parco.2011.05.005"},{"key":"bibr44-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1093\/nar\/gkt328"},{"key":"bibr45-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1109\/71.80160"},{"key":"bibr46-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2012.122"},{"key":"bibr47-1094342019866891","doi-asserted-by":"publisher","DOI":"10.1109\/ICACT.2016.7423490"}],"container-title":["The International Journal of High Performance Computing Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342019866891","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/full-xml\/10.1177\/1094342019866891","content-type":"application\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.1177\/1094342019866891","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T08:15:51Z","timestamp":1777450551000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.1177\/1094342019866891"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,8,12]]},"references-count":47,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2019,11]]}},"alternative-id":["10.1177\/1094342019866891"],"URL":"https:\/\/doi.org\/10.1177\/1094342019866891","relation":{},"ISSN":["1094-3420","1741-2846"],"issn-type":[{"value":"1094-3420","type":"print"},{"value":"1741-2846","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019,8,12]]}}}