乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,30]],"date-time":"2024-10-30T06:18:12Z","timestamp":1730269092099,"version":"3.28.0"},"reference-count":53,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,6,1]],"date-time":"2021-06-01T00:00:00Z","timestamp":1622505600000},"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":[],"published-print":{"date-parts":[[2021,6]]},"DOI":"10.1109\/ipdpsw52791.2021.00089","type":"proceedings-article","created":{"date-parts":[[2021,6,24]],"date-time":"2021-06-24T16:12:58Z","timestamp":1624551178000},"page":"556-565","source":"Crossref","is-referenced-by-count":2,"title":["Checkpointing vs. Supervision Resilience Approaches for Dynamic Independent Tasks"],"prefix":"10.1109","author":[{"given":"Jonas","family":"Posner","sequence":"first","affiliation":[]},{"given":"Lukas","family":"Reitz","sequence":"additional","affiliation":[]},{"given":"Claudia","family":"Fohry","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1145\/3332372"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.01.026"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2009.5161063"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1177\/1094342020901885"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1002\/cpe.4851"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.2172\/1436045"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.15803\/ijnc.5.1_2"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1007\/11428831_39"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.2172\/984082"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/2063384.2063427"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.2307\/3033543"},{"key":"ref27","first-page":"235","article-title":"UTS: An unbalanced tree search benchmark","author":"olivier","year":"2006","journal-title":"Languages and Compilers for Parallel Computing (LCPC)"},{"journal-title":"Schach und Mathematik","year":"1987","author":"gik","key":"ref29"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-20943-2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1177\/1094342014522573"},{"journal-title":"Proc Int Conf on Partitioned Global Address Space Programming Models (PGAS)","article-title":"Hierarchical work stealing on manycore clusters","year":"0","author":"min","key":"ref20"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/2771774.2771780"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462193"},{"article-title":"PLM-APGAS-Examples","year":"2020","author":"posner","key":"ref24"},{"journal-title":"Proc SIGPLAN Workshop on Advances in Message Passing","article-title":"The asynchronous partitioned global address space model","year":"2010","author":"saraswat","key":"ref23"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/1941553.1941582"},{"article-title":"Artefact: Checkpointing vs. Supervision Resilience Approaches for Dynamic Tasks","year":"2020","author":"posner","key":"ref25"},{"journal-title":"Int Symp on Checkpointing for Supercomputing (SuperCheck)","article-title":"Checkpointing and localized recovery for nested fork-join programs","year":"2021","author":"fohry","key":"ref50"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1177\/1094342017703448"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/3295500.3356171"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2004.11.016"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/2567634.2567639"},{"journal-title":"Introduction to Parallel Computing","year":"2003","author":"grama","key":"ref11"},{"key":"ref40","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/978-3-319-44881-7_11","article-title":"Fault tolerance in MapReduce: A survey","author":"memishi","year":"2016","journal-title":"Computer Communications and Networks"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/3332466.3374537"},{"key":"ref13","first-page":"1","article-title":"Work-first and help-first scheduling policies for async-finish task parallelism","author":"guo","year":"2009","journal-title":"Proc Int Parallel and Distributed Processing Symp (IPDPS)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.4236\/jsea.2017.1013053"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2019.11.031"},{"key":"ref16","first-page":"1","article-title":"Adaptive and reliable parallel computing on networks of workstations","author":"blumofe","year":"1997","journal-title":"Proc Annual Conf on USENIX"},{"key":"ref17","first-page":"425","article-title":"Persistent fault-tolerance for divide-and-conquer applications on the grid","volume":"4641","author":"wrzesi?ska","year":"2007","journal-title":"Proc Euro-Par Parallel Processing"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2017.75"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.15803\/ijnc.8.1_2"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1016\/j.future.2020.06.003"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1142\/S0129626413400112"},{"year":"2018","key":"ref6","article-title":"OpenMP application program interface version 5.0"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1016\/j.jpdc.2008.12.002"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1177\/1094342007078442"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/2676870.2676883"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1109\/CLUSTER.2017.27"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/277650.277725"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1177\/1094342016669416"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2015.81"},{"key":"ref48","first-page":"13","article-title":"Fault-tolerance, malleability and migration for divide-and-conquer applications on the grid","author":"wrzesi?ska","year":"2005","journal-title":"Proc Int Parallel and Distributed Processing Symp (IPDPS)"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/2304576.2304589"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/HPCSim.2015.7237083"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2013.40"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1109\/SC.2014.64"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/2934664"}],"event":{"name":"2021 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)","start":{"date-parts":[[2021,6,17]]},"location":"Portland, OR, USA","end":{"date-parts":[[2021,6,21]]}},"container-title":["2021 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9459012\/9459251\/09460608.pdf?arnumber=9460608","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,10]],"date-time":"2022-05-10T11:42:47Z","timestamp":1652182967000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9460608\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,6]]},"references-count":53,"URL":"https:\/\/doi.org\/10.1109\/ipdpsw52791.2021.00089","relation":{},"subject":[],"published":{"date-parts":[[2021,6]]}}}