{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:55:40Z","timestamp":1750308940091,"version":"3.41.0"},"reference-count":38,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2017,11,17]],"date-time":"2017-11-17T00:00:00Z","timestamp":1510876800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Korea Government","award":["2016R1A2A1A05005494"],"award-info":[{"award-number":["2016R1A2A1A05005494"]}]},{"name":"National Research Foundation of Korean"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Storage"],"published-print":{"date-parts":[[2017,11,30]]},"abstract":"<jats:p>In multi-level cell (MLC) NAND flash memory, two logical pages are overlapped on a single physical page. Even after a logical page is programmed, the data can be corrupted if the programming of the coexisting logical page is interrupted. This phenomenon is called paired page interference.<\/jats:p>\n          <jats:p>This article proposes a novel software technique to deal with the paired page interference without any additional hardware or extra page write. The proposed technique utilizes valid pages in the victim block during garbage collection (GC) as the backup against the interference, and pairs them with incoming pages written by the host. This approach eliminates undesirable page copy to backup pages against the interference. However, such a strategy has an adverse effect on the hot\/cold separation policy, which is essential to improve the efficiency of GC. To limit the downside, we devise a metric to estimate the benefit of GCMix on-the-fly so that GCMix can be adaptively utilized only when the benefit outweighs the overhead. Evaluations using synthetic and real workloads show GCMix can effectively deal with the paired page interference, reducing the write amplification factor by up to 17.5%compared to the traditional technique, while providing comparable I\/O performance.<\/jats:p>","DOI":"10.1145\/3149373","type":"journal-article","created":{"date-parts":[[2017,11,17]],"date-time":"2017-11-17T14:02:02Z","timestamp":1510927322000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["GCMix"],"prefix":"10.1145","volume":"13","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2105-1734","authenticated-orcid":false,"given":"Sang-Hoon","family":"Kim","sequence":"first","affiliation":[{"name":"Virginia Polytechnic Institute and State University and KAIST, VA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jinhyuk","family":"Lee","sequence":"additional","affiliation":[{"name":"Samsung Electronics Co. and Sungkyunkwan University, Hwaseong, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jin-Soo","family":"Kim","sequence":"additional","affiliation":[{"name":"Sungkyunkwan University, Suwon, South Korea"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2017,11,17]]},"reference":[{"volume-title":"Flash file system. US Patent No. 540485. Filed","year":"1993","author":"Ban Amir","key":"e_1_2_1_1_1"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555349.1555371"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1002\/(SICI)1097-024X(199903)29:3%3C267::AID-SPE233%3E3.0.CO;2-T"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1555754.1555790"},{"volume-title":"Proceedings of the 2013 USENIX Annual Technical Conference (USENIX ATC\u201913)","year":"2013","author":"Grupp Laura M.","key":"e_1_2_1_5_1"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508244.1508271"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1138041.1138043"},{"volume-title":"Asymmetric programming: A highly reliable metadata allocation strategy for MLC NAND flash memory-based sensor systems. 14, 10 (Oct","year":"2014","author":"Huang Min","key":"e_1_2_1_8_1"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.sysarc.2010.09.005"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/IISWC.2008.4636097"},{"volume-title":"Proceedings of the","year":"1995","author":"Kawaguchi Atsuo","key":"e_1_2_1_11_1"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCE.2008.4587896"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCE.2002.1010143"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/1151374.1151375"},{"volume-title":"Filed","year":"2011","author":"Kwon Min Cheol","key":"e_1_2_1_15_1"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/2485732.2485745"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2014.2309857"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1453775.1453783"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1007\/11807964_88"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559937"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376723"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1275986.1275990"},{"volume-title":"Proceedings of the 10th USENIX Conference on File and Storage Technologies (USENIX FAST\u201912)","year":"2012","author":"Min Changwoo","key":"e_1_2_1_23_1"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1413254.1413263"},{"volume-title":"Sameh Elnikety, and Antony Rowstron.","year":"2008","author":"Narayanan Dushyanth","key":"e_1_2_1_25_1"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2011.5937216"},{"volume-title":"Proceedings of the 2008 CELF Embedded Linux Conference (ELC\u201908)","year":"2008","author":"Park Khyugmin","key":"e_1_2_1_27_1"},{"volume-title":"Proceedings of the 2000 USENIX Annual Technical Conference (USENIX ATC\u201905)","author":"Prabhakaran Vijayan","key":"e_1_2_1_28_1"},{"volume-title":"Single level cell programming in a multiple level cell non-volatile memory device. US Patent No. 7366013. Filed","year":"2005","author":"Roohparvar Frankie F.","key":"e_1_2_1_29_1"},{"key":"e_1_2_1_30_1","unstructured":"Samsung Electronics Co. Ltd. 2006. 2G x 8 Bit NAND Flash Memory K9GAG08B0M K9GAG08U0M K9LBG08U1M. http:\/\/n2k1.com\/n2k1\/NB7\/PDF\/K9GAG08U0E.pdf.  Samsung Electronics Co. Ltd. 2006. 2G x 8 Bit NAND Flash Memory K9GAG08B0M K9GAG08U0M K9LBG08U1M. http:\/\/n2k1.com\/n2k1\/NB7\/PDF\/K9GAG08U0E.pdf."},{"key":"e_1_2_1_31_1","unstructured":"Samsung Electronics Co. Ltd. 2010. 32Gb A-die NAND Flash Datasheet K9GBG08U0A K9LCG08U1A K9HDG08U5A. http:\/\/dl.btc.pl\/kamami_wa\/k9gbg08u0a_ds.pdf.  Samsung Electronics Co. Ltd. 2010. 32Gb A-die NAND Flash Datasheet K9GBG08U0A K9LCG08U1A K9HDG08U5A. http:\/\/dl.btc.pl\/kamami_wa\/k9gbg08u0a_ds.pdf."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2008.2004319"},{"key":"e_1_2_1_33_1","unstructured":"SNIA IOTTA Repository. 2011. Microsoft Enterprise Traces - Exchange Server Traces. Retrieved from http:\/\/iotta.snia.org\/traces\/130.  SNIA IOTTA Repository. 2011. Microsoft Enterprise Traces - Exchange Server Traces. Retrieved from http:\/\/iotta.snia.org\/traces\/130."},{"key":"e_1_2_1_34_1","unstructured":"Anil Vasudeva. 2011. Are SSDs Ready for Enterprise Storage Systems. Retrieved from http:\/\/www.snia.org\/sites\/default\/files\/AnilVasudeva_Are_SSDs_Ready_Enterprise_Storage_Systemsv4.pdf.  Anil Vasudeva. 2011. Are SSDs Ready for Enterprise Storage Systems. Retrieved from http:\/\/www.snia.org\/sites\/default\/files\/AnilVasudeva_Are_SSDs_Ready_Enterprise_Storage_Systemsv4.pdf."},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.5555\/1096673.1096692"},{"volume-title":"Filed","year":"2011","author":"Yoon Han Bin","key":"e_1_2_1_36_1"},{"volume-title":"Filed","year":"2010","author":"Yu Jae-Sung","key":"e_1_2_1_37_1"},{"volume-title":"Selected Studies of the Principle of Relative Frequency in Language","author":"Zipf George Kingsley","key":"e_1_2_1_38_1","doi-asserted-by":"crossref","DOI":"10.4159\/harvard.9780674434929"}],"container-title":["ACM Transactions on Storage"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3149373","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3149373","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T21:37:02Z","timestamp":1750282622000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3149373"}},"subtitle":["An Efficient Data Protection Scheme against the Paired Page Interference"],"short-title":[],"issued":{"date-parts":[[2017,11,17]]},"references-count":38,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2017,11,30]]}},"alternative-id":["10.1145\/3149373"],"URL":"https:\/\/doi.org\/10.1145\/3149373","relation":{},"ISSN":["1553-3077","1553-3093"],"issn-type":[{"type":"print","value":"1553-3077"},{"type":"electronic","value":"1553-3093"}],"subject":[],"published":{"date-parts":[[2017,11,17]]},"assertion":[{"value":"2016-03-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-09-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2017-11-17","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}