{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:34:21Z","timestamp":1725554061318},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540343790"},{"type":"electronic","value":"9783540343806"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11758501_100","type":"book-chapter","created":{"date-parts":[[2006,5,9]],"date-time":"2006-05-09T16:38:01Z","timestamp":1147192681000},"page":"753-760","source":"Crossref","is-referenced-by-count":0,"title":["Speculation Meets Checkpointing"],"prefix":"10.1007","author":[{"given":"Arkadiusz","family":"Danilecki","sequence":"first","affiliation":[]},{"given":"Micha\u0142","family":"Szychowiak","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"100_CR1","doi-asserted-by":"crossref","unstructured":"Bianchini, R., Pinto, R., Amorim, C.L.: Data Prefetching for Software DSMs. In: Int. Conf. on Supercomputing, Melbourne, Australia (1998)","DOI":"10.1145\/277830.277925"},{"key":"100_CR2","unstructured":"Brzeziski, J., Szychowiak, M.: Replication of Checkpoints in Recoverable DSM Systems. In: 21st Int. Conf. on Parallel and Distributed Computing and Networks PDCN 2003, Innsbruck, Austria (2003)"},{"key":"100_CR3","unstructured":"Danilecki, A., Szychowiak, M.: Checkpointing Speculative DSM Systems. Technical Report RA-021\/05, Institute of Computing Science, Pozna\u0144 University of Technology, Pozna\u0144, Poland (2005)"},{"key":"100_CR4","doi-asserted-by":"crossref","unstructured":"Lai, A.-C., Babak Falsafi, B.: Memory Sharing Predictor: The Key to a Speculative Coherent DSM. In: 26th Int. Symp. on Computer Architecture (ISCA 26), Atlanta, Georgia, pp. 172\u2013183 (1999)","DOI":"10.1145\/307338.300994"},{"key":"100_CR5","doi-asserted-by":"crossref","unstructured":"Lai, A.-C., Babak Falsafi, B.: Selective, Accurate, and Timely Self-Invalidation Using Last-Touch Prediction. In: 27th Int. Symp. on Computer Architecture (ISCA\u00a027), Vancouver, BC, Canada, pp. 139\u2013148 (2000)","DOI":"10.1145\/342001.339669"},{"issue":"3","key":"100_CR6","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1023\/A:1008116511402","volume":"15","author":"T. Park","year":"2002","unstructured":"Park, T., Yeom, H.Y.: A Low Overhead Logging Scheme for Fast Recovery in Distributed Shared Memory Systems. Journal of Supercomputing\u00a015(3), 295\u2013320 (2002)","journal-title":"Journal of Supercomputing"},{"issue":"3","key":"100_CR7","first-page":"273","volume":"32","author":"R. Rajwar","year":"2004","unstructured":"Rajwar, R., Kagi, A., Goodman, J.R.: Inferential Queueing and Speculative Push. Int. Journal of Parallel Programming (IJPP)\u00a032(3), 273\u2013284 (2004)","journal-title":"Int. Journal of Parallel Programming (IJPP)"}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11758501_100","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,18]],"date-time":"2019-04-18T18:47:28Z","timestamp":1555613248000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11758501_100"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540343790","9783540343806"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/11758501_100","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}