{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T14:45:25Z","timestamp":1746283525254,"version":"3.37.3"},"reference-count":41,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"7","license":[{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,7,1]],"date-time":"2022-07-01T00:00:00Z","timestamp":1656633600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Comput."],"published-print":{"date-parts":[[2022,7,1]]},"DOI":"10.1109\/tc.2021.3104747","type":"journal-article","created":{"date-parts":[[2021,8,13]],"date-time":"2021-08-13T20:10:26Z","timestamp":1628885426000},"page":"1696-1710","source":"Crossref","is-referenced-by-count":5,"title":["Resilient Scheduling of Moldable Parallel Jobs to Cope With Silent Errors"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2910-3540","authenticated-orcid":false,"given":"Anne","family":"Benoit","sequence":"first","affiliation":[{"name":"LIP Laboratory, Ecole Normale Sup&#x00E9;rieure de Lyon, Lyon, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentin","family":"Le Fevre","sequence":"additional","affiliation":[{"name":"Barcelona Supercomputing Center, Barcelona, Spain"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lucas","family":"Perotin","sequence":"additional","affiliation":[{"name":"LIP Laboratory, Ecole Normale Sup&#x00E9;rieure de Lyon, Lyon, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Padma","family":"Raghavan","sequence":"additional","affiliation":[{"name":"Vanderbilt University, Nashville, TN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2361-055X","authenticated-orcid":false,"given":"Yves","family":"Robert","sequence":"additional","affiliation":[{"name":"LIP Laboratory, Ecole Normale Sup&#x00E9;rieure de Lyon, Lyon, France"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hongyang","family":"Sun","sequence":"additional","affiliation":[{"name":"University of Kansas, Lawrence, KS, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"doi-asserted-by":"publisher","key":"ref1","DOI":"10.1145\/1465482.1465560"},{"key":"ref2","first-page":"72","article-title":"An approximate algorithm for the partitionable independent task scheduling problem","volume-title":"Proc. Int. Conf. Parallel Process.","author":"Belkhale"},{"doi-asserted-by":"publisher","key":"ref3","DOI":"10.1109\/IPPS.1991.153827"},{"doi-asserted-by":"publisher","key":"ref4","DOI":"10.1109\/CLUSTER49012.2020.00018"},{"doi-asserted-by":"publisher","key":"ref5","DOI":"10.15803\/ijnc.11.1_2"},{"doi-asserted-by":"publisher","key":"ref6","DOI":"10.1007\/3-540-44681-8_29"},{"doi-asserted-by":"publisher","key":"ref7","DOI":"10.1145\/3208040.3208043"},{"doi-asserted-by":"publisher","key":"ref8","DOI":"10.1109\/TPDS.2012.258"},{"doi-asserted-by":"publisher","key":"ref9","DOI":"10.1145\/1189056.1189078"},{"doi-asserted-by":"publisher","key":"ref10","DOI":"10.1137\/0402042"},{"key":"ref11","first-page":"136","article-title":"Online scheduling of malleable parallel jobs","volume-title":"Proc. 19th IASTED Int. Conf. Parallel Distrib. Comput. Syst.","author":"Dutton"},{"doi-asserted-by":"publisher","key":"ref12","DOI":"10.1007\/BFb0022284"},{"doi-asserted-by":"publisher","key":"ref13","DOI":"10.1023\/A:1009794729459"},{"doi-asserted-by":"publisher","key":"ref14","DOI":"10.1007\/978-3-662-48096-0_37"},{"doi-asserted-by":"publisher","key":"ref15","DOI":"10.1007\/978-3-319-43659-3_47"},{"doi-asserted-by":"publisher","key":"ref16","DOI":"10.1016\/j.ejor.2006.06.064"},{"doi-asserted-by":"publisher","key":"ref17","DOI":"10.1007\/978-3-319-20943-2"},{"doi-asserted-by":"publisher","key":"ref18","DOI":"10.1007\/978-3-540-77918-6_6"},{"doi-asserted-by":"publisher","key":"ref19","DOI":"10.1145\/2312005.2312048"},{"doi-asserted-by":"publisher","key":"ref20","DOI":"10.1109\/IPDPS.2018.00027"},{"doi-asserted-by":"publisher","key":"ref21","DOI":"10.1137\/080736491"},{"doi-asserted-by":"publisher","key":"ref22","DOI":"10.1145\/1073970.1073983"},{"doi-asserted-by":"publisher","key":"ref23","DOI":"10.1007\/s10951-006-8497-6"},{"doi-asserted-by":"publisher","key":"ref24","DOI":"10.1007\/s10951-014-0406-9"},{"doi-asserted-by":"publisher","key":"ref25","DOI":"10.1137\/S0097539796299540"},{"doi-asserted-by":"publisher","key":"ref26","DOI":"10.1007\/3-540-44676-1_12"},{"key":"ref27","first-page":"167","article-title":"Scheduling malleable and nonmalleable parallel tasks","volume-title":"Proc. 5th Annu. ACM-SIAM Symp. Discrete Algorithms","author":"Ludwig"},{"doi-asserted-by":"publisher","key":"ref28","DOI":"10.1177\/1094342014522573"},{"doi-asserted-by":"publisher","key":"ref29","DOI":"10.1145\/331524.331530"},{"doi-asserted-by":"publisher","key":"ref30","DOI":"10.1145\/305619.305622"},{"doi-asserted-by":"publisher","key":"ref31","DOI":"10.1137\/S0097539701385995"},{"doi-asserted-by":"publisher","key":"ref32","DOI":"10.1109\/16.278509"},{"doi-asserted-by":"publisher","key":"ref33","DOI":"10.1145\/1120582.1120585"},{"doi-asserted-by":"publisher","key":"ref34","DOI":"10.1007\/978-3-540-24749-4_54"},{"doi-asserted-by":"publisher","key":"ref35","DOI":"10.1007\/s004539900002"},{"doi-asserted-by":"publisher","key":"ref36","DOI":"10.1145\/140901.141909"},{"doi-asserted-by":"publisher","key":"ref37","DOI":"10.1137\/0221021"},{"doi-asserted-by":"publisher","key":"ref38","DOI":"10.1145\/2133173.2133185"},{"doi-asserted-by":"publisher","key":"ref39","DOI":"10.1007\/s10951-018-0556-2"},{"doi-asserted-by":"publisher","key":"ref40","DOI":"10.1007\/s10878-007-9125-x"},{"doi-asserted-by":"publisher","key":"ref41","DOI":"10.1109\/4.658626"}],"container-title":["IEEE Transactions on Computers"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/12\/9790737\/09513573.pdf?arnumber=9513573","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,1,11]],"date-time":"2024-01-11T22:39:29Z","timestamp":1705012769000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9513573\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,7,1]]},"references-count":41,"journal-issue":{"issue":"7"},"URL":"https:\/\/doi.org\/10.1109\/tc.2021.3104747","relation":{},"ISSN":["0018-9340","1557-9956","2326-3814"],"issn-type":[{"type":"print","value":"0018-9340"},{"type":"electronic","value":"1557-9956"},{"type":"electronic","value":"2326-3814"}],"subject":[],"published":{"date-parts":[[2022,7,1]]}}}