{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T10:26:28Z","timestamp":1725618388028},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2005,3,13]]},"DOI":"10.1145\/1066677.1067026","type":"proceedings-article","created":{"date-parts":[[2005,8,3]],"date-time":"2005-08-03T04:31:47Z","timestamp":1123043507000},"page":"1558-1562","update-policy":"http:\/\/dx.doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":13,"title":["Space-efficient page-level incremental checkpointing"],"prefix":"10.1145","author":[{"given":"Junyoung","family":"Heo","sequence":"first","affiliation":[{"name":"Seoul National University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sangho","family":"Yi","sequence":"additional","affiliation":[{"name":"Seoul National University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yookun","family":"Cho","sequence":"additional","affiliation":[{"name":"Seoul National University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jiman","family":"Hong","sequence":"additional","affiliation":[{"name":"Kwangwoon University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sung Y.","family":"Shin","sequence":"additional","affiliation":[{"name":"South Dakota State University"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2005,3,13]]},"reference":[{"key":"e_1_3_2_1_2_1","first-page":"365","volume-title":"IASTED International Conference on Parallel and, Distributed and Networks","author":"Heo J.","year":"2004","unstructured":"J. Heo , S. Yi , J. Hong , Y. Cho , and J. Choi . An efficient merging algorithm for recovery and garbage collection in incremental checkpointing . In IASTED International Conference on Parallel and, Distributed and Networks , pages 365 -- 368 , February 2004 .]] J. Heo, S. Yi, J. Hong, Y. Cho, and J. Choi. An efficient merging algorithm for recovery and garbage collection in incremental checkpointing. In IASTED International Conference on Parallel and, Distributed and Networks, pages 365--368, February 2004.]]"},{"key":"e_1_3_2_1_3_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_4_1","first-page":"303","volume-title":"International Conference on Computers and Their Applications","author":"Hong J.","year":"2000","unstructured":"J. Hong , T. Park , H. Yeom , and Y. Cho . Kckpt: An efficient checkpoint facility on unixware . In International Conference on Computers and Their Applications , pages 303 -- 308 , March 2000 .]] J. Hong, T. Park, H. Yeom, and Y. Cho. Kckpt: An efficient checkpoint facility on unixware. In International Conference on Computers and Their Applications, pages 303--308, March 2000.]]"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/647881.737787"},{"key":"e_1_3_2_1_7_1","first-page":"62","volume-title":"Special Issue on Fault-Tolerance","author":"Plank J.","year":"1995","unstructured":"J. Plank , M. Beck , and G. Kingsley . Compiler-assisted memory exclusion for fast checkpointing. In IEEE Technical Committee on Operating Systems and Application Environments , Special Issue on Fault-Tolerance , pages 62 -- 67 , December 1995 .]] J. Plank, M. Beck, and G. Kingsley. Compiler-assisted memory exclusion for fast checkpointing. In IEEE Technical Committee on Operating Systems and Application Environments, Special Issue on Fault-Tolerance, pages 62--67, December 1995.]]"},{"key":"e_1_3_2_1_8_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_9_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(199902)29:2%3C125::AID-SPE224%3E3.0.CO;2-7"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.730527"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/12.620479"}],"event":{"name":"SAC05: The 2005 ACM Symposium on Applied Computing","sponsor":["SIGAPP ACM Special Interest Group on Applied Computing"],"location":"Santa Fe New Mexico","acronym":"SAC05"},"container-title":["Proceedings of the 2005 ACM symposium on Applied computing"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1066677.1067026","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,7]],"date-time":"2023-01-07T14:37:01Z","timestamp":1673102221000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1066677.1067026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005,3,13]]},"references-count":9,"alternative-id":["10.1145\/1066677.1067026","10.1145\/1066677"],"URL":"https:\/\/doi.org\/10.1145\/1066677.1067026","relation":{},"subject":[],"published":{"date-parts":[[2005,3,13]]},"assertion":[{"value":"2005-03-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}