{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:40:03Z","timestamp":1750308003725,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":5,"publisher":"ACM","license":[{"start":{"date-parts":[[2006,4,23]],"date-time":"2006-04-23T00:00:00Z","timestamp":1145750400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2006,4,23]]},"DOI":"10.1145\/1141277.1141625","type":"proceedings-article","created":{"date-parts":[[2006,7,24]],"date-time":"2006-07-24T16:53:01Z","timestamp":1153759981000},"page":"1493-1494","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["The overhead model of word-level and page-level incremental checkpointing"],"prefix":"10.1145","author":[{"given":"Junyoung","family":"Heo","sequence":"first","affiliation":[{"name":"Seoul National University"}]},{"given":"Yookun","family":"Cho","sequence":"additional","affiliation":[{"name":"Seoul National University"}]},{"given":"Gwangil","family":"Jeon","sequence":"additional","affiliation":[{"name":"Korea Polytechnic University"}]},{"given":"Haklin","family":"Kimm","sequence":"additional","affiliation":[{"name":"East Stroudsburg University of Pennsylvania"}]}],"member":"320","published-online":{"date-parts":[[2006,4,23]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1006209.1006248"},{"key":"e_1_3_2_1_2_1","volume-title":"E86-D(9):1534--1541","author":"Hong J.","year":"2003","unstructured":"J. Hong , S. Kim , and Y. Cho . Cost analysis of optimistic recovery model for forked checkpointing. IEICE Transactions on Information and Systems , E86-D(9):1534--1541 , September 2003 . J. Hong, S. Kim, and Y. Cho. Cost analysis of optimistic recovery model for forked checkpointing. IEICE Transactions on Information and Systems, E86-D(9):1534--1541, September 2003."},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/647881.737787"},{"key":"e_1_3_2_1_4_1","first-page":"213","volume-title":"Usenix Winter Technical Conference","author":"Plank J.","year":"1995","unstructured":"J. Plank , M. Beck , G. Kingsley , and K. Li . Libckpt:transparent checkpointing under unix . In Usenix Winter Technical Conference , pages 213 -- 223 , January 1995 . J. Plank, M. Beck, G. Kingsley, and K. Li. Libckpt:transparent checkpointing under unix. In Usenix Winter Technical Conference, pages 213--223, January 1995."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(199902)29:2%3C125::AID-SPE224%3E3.0.CO;2-7"}],"event":{"name":"SAC06: The 2006 ACM Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Dijon France","acronym":"SAC06"},"container-title":["Proceedings of the 2006 ACM symposium on Applied computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1141277.1141625","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1141277.1141625","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T15:06:28Z","timestamp":1750259188000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1141277.1141625"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006,4,23]]},"references-count":5,"alternative-id":["10.1145\/1141277.1141625","10.1145\/1141277"],"URL":"https:\/\/doi.org\/10.1145\/1141277.1141625","relation":{},"subject":[],"published":{"date-parts":[[2006,4,23]]},"assertion":[{"value":"2006-04-23","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}