{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,7]],"date-time":"2026-01-07T07:57:12Z","timestamp":1767772632958,"version":"3.41.0"},"reference-count":47,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2024,2,19]],"date-time":"2024-02-19T00:00:00Z","timestamp":1708300800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100001809","name":"National Natural Science Foundation of China","doi-asserted-by":"crossref","award":["61872299"],"award-info":[{"award-number":["61872299"]}],"id":[{"id":"10.13039\/501100001809","id-type":"DOI","asserted-by":"crossref"}]},{"name":"Natural Science Foundation Project of CQ CSTC","award":["cstc2021ycjh-bgzxm0199, 2022NSCQ-MSX0789"],"award-info":[{"award-number":["cstc2021ycjh-bgzxm0199, 2022NSCQ-MSX0789"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Storage"],"published-print":{"date-parts":[[2024,5,31]]},"abstract":"<jats:p>\n            Sanitization is an effective approach for ensuring data security through scrubbing invalid but sensitive data pages, with the cost of impacts on storage performance due to moving out valid pages from the sanitization-required wordline, which is a logical read\/write unit and consists of multiple pages in high-density SSDs. To minimize the impacts on I\/O latency and data security, this article proposes a polling-based scheduling approach for data sanitization in high-density SSDs. Our method polls a specific SSD channel for completing data sanitization at the block granularity, meanwhile other channels can still service I\/O requests. Furthermore, our method assigns a low priority to the blocks that are more likely to have future\n            <jats:italic>adjacent page<\/jats:italic>\n            invalidations inside sanitization-required wordlines, while selecting the sanitization block, to minimize the negative impacts of moving valid pages. Through a series of emulation experiments on several disk traces of real-world applications, we show that our proposal can decrease the negative effects of data sanitization in terms of the risk-performance index, which is a united time metric of I\/O responsiveness and the unsafe time interval, by\n            <jats:monospace>16.34%<\/jats:monospace>\n            , on average, compared to related sanitization methods.\n          <\/jats:p>","DOI":"10.1145\/3639826","type":"journal-article","created":{"date-parts":[[2024,1,6]],"date-time":"2024-01-06T14:16:15Z","timestamp":1704550575000},"page":"1-23","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":9,"title":["Polling Sanitization to Balance I\/O Latency and Data Security of High-density SSDs"],"prefix":"10.1145","volume":"20","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-3312-1541","authenticated-orcid":false,"given":"Jiaojiao","family":"Wu","sequence":"first","affiliation":[{"name":"Southwest University, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8406-8461","authenticated-orcid":false,"given":"Zhigang","family":"Cai","sequence":"additional","affiliation":[{"name":"Southwest University, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2172-0608","authenticated-orcid":false,"given":"Fan","family":"Yang","sequence":"additional","affiliation":[{"name":"Southwest University, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5235-6496","authenticated-orcid":false,"given":"Jun","family":"Li","sequence":"additional","affiliation":[{"name":"Southwest University, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7329-1812","authenticated-orcid":false,"given":"Francois","family":"Trahay","sequence":"additional","affiliation":[{"name":"Telecom SudParis, France"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8610-9936","authenticated-orcid":false,"given":"Zheng","family":"Yang","sequence":"additional","affiliation":[{"name":"Southwest University, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3524-7583","authenticated-orcid":false,"given":"Chao","family":"Wang","sequence":"additional","affiliation":[{"name":"Southwest University, China"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6149-6650","authenticated-orcid":false,"given":"Jianwei","family":"Liao","sequence":"additional","affiliation":[{"name":"Southwest University, China"}]}],"member":"320","published-online":{"date-parts":[[2024,2,19]]},"reference":[{"doi-asserted-by":"publisher","key":"e_1_3_3_2_2","DOI":"10.1145\/1182807.1182827"},{"doi-asserted-by":"publisher","key":"e_1_3_3_3_2","DOI":"10.1145\/1210596.1210601"},{"doi-asserted-by":"publisher","key":"e_1_3_3_4_2","DOI":"10.1145\/3126537"},{"key":"e_1_3_3_5_2","article-title":"PR-SSD: Maximizing partial read potential by exploiting compression and channel-level parallelism","volume":"72","author":"Kang Mincheol","year":"2022","unstructured":"Mincheol Kang, Wonyoung, Lee, Jinkwon Kim, and Soontae Kim. 2022. PR-SSD: Maximizing partial read potential by exploiting compression and channel-level parallelism. IEEE Transactions on Computers (TC) 72, 3 (2022).","journal-title":"IEEE Transactions on Computers (TC)"},{"doi-asserted-by":"publisher","key":"e_1_3_3_6_2","DOI":"10.1145\/1176887.1176911"},{"doi-asserted-by":"publisher","key":"e_1_3_3_7_2","DOI":"10.1145\/3205289.3205319"},{"doi-asserted-by":"publisher","key":"e_1_3_3_8_2","DOI":"10.1109\/ISSCC42613.2021.9366003"},{"key":"e_1_3_3_9_2","volume-title":"Conference on File and Storage Technologies (FAST\u201911)","volume":"11","author":"Wei Michael","year":"2011","unstructured":"Michael Wei, Grupp Laura, Spada Frederick E, and Swanson Steven. 2011. Reliably erasing data from flash-based solid state drives. In Conference on File and Storage Technologies (FAST\u201911), Vol. 11, 8\u20138."},{"unstructured":"Data Protection Act 2018. https:\/\/www.legislation.gov.uk\/ukpga\/contents","key":"e_1_3_3_10_2"},{"doi-asserted-by":"publisher","key":"e_1_3_3_11_2","DOI":"10.5555\/3489212.3489291"},{"doi-asserted-by":"publisher","key":"e_1_3_3_12_2","DOI":"10.1145\/3433210.3453093"},{"doi-asserted-by":"publisher","key":"e_1_3_3_13_2","DOI":"10.1109\/RTAS54340.2022.00016"},{"doi-asserted-by":"publisher","key":"e_1_3_3_14_2","DOI":"10.1007\/s10617-008-9027-x"},{"doi-asserted-by":"publisher","key":"e_1_3_3_15_2","DOI":"10.1109\/TCAD.2018.2857260"},{"doi-asserted-by":"publisher","key":"e_1_3_3_16_2","DOI":"10.1109\/TCAD.2021.3100274"},{"doi-asserted-by":"publisher","key":"e_1_3_3_17_2","DOI":"10.1109\/SP.2013.28"},{"key":"e_1_3_3_18_2","volume-title":"USENIX Security Symposium (USENIX Security\u201912)","author":"Reardon Joel","year":"2012","unstructured":"Joel Reardon, Srdjan Capkun, David Basin, and ETH Zurich. 2012. Data node encrypted file system: Efficient secure deletion for flash memory. In USENIX Security Symposium (USENIX Security\u201912), 333\u2013348."},{"doi-asserted-by":"publisher","key":"e_1_3_3_19_2","DOI":"10.6028\/NIST.SP.800-88r1"},{"unstructured":"2020. Dwell Time as a Critical Security Success Metric. Retrieved from https:\/\/cdn.armor.com\/app\/uploads\/2020\/04\/Ebook-DwellTime.pdf","key":"e_1_3_3_20_2"},{"doi-asserted-by":"publisher","key":"e_1_3_3_21_2","DOI":"10.1145\/3195970.3196051"},{"key":"e_1_3_3_22_2","volume-title":"FESSD: A fast encrypted ssd employing on-chip access-control memory","author":"Lee Junghee","year":"2017","unstructured":"Junghee Lee, Kalidas Ganesh, Hyuk-Jun Lee, and Youngjae Kim. 2017. FESSD: A fast encrypted ssd employing on-chip access-control memory. IEEE Computer Architecture Letters (CAL\u201917), 16, 2 (2017), 115\u2013118."},{"doi-asserted-by":"publisher","key":"e_1_3_3_23_2","DOI":"10.1145\/3133956.3134011"},{"doi-asserted-by":"publisher","key":"e_1_3_3_24_2","DOI":"10.1145\/2414456.2414493"},{"doi-asserted-by":"publisher","key":"e_1_3_3_25_2","DOI":"10.1145\/2420950.2421013"},{"doi-asserted-by":"publisher","key":"e_1_3_3_26_2","DOI":"10.1145\/3240765.3240773"},{"doi-asserted-by":"publisher","key":"e_1_3_3_27_2","DOI":"10.1145\/3534056.3534941"},{"key":"e_1_3_3_28_2","volume-title":"Proceedings of the 2017 Hardware Security Conference Training. 1\u201310","author":"Ramsay Craig","year":"2017","unstructured":"Craig Ramsay and Jasper Lohuis. 2017. TEMPEST attacks against AES. Covertly stealing keys for 200 euro. In Proceedings of the 2017 Hardware Security Conference Training. 1\u201310."},{"doi-asserted-by":"publisher","key":"e_1_3_3_29_2","DOI":"10.1038\/323533a0"},{"doi-asserted-by":"publisher","key":"e_1_3_3_30_2","DOI":"10.1016\/S0167-7012(00)00201-3"},{"doi-asserted-by":"publisher","key":"e_1_3_3_31_2","DOI":"10.1109\/IPDPS47924.2020.00103"},{"doi-asserted-by":"publisher","key":"e_1_3_3_32_2","DOI":"10.1109\/ISCAS.2018.8351440"},{"key":"e_1_3_3_33_2","volume-title":"Yang","author":"Liu Weiguang","year":"2022","unstructured":"Weiguang Liu, Jinhua Cui, Tiantian Li, Junwei Liu, and Laurence T. Yang. 2022. A Space-efficient fair cache scheme based on machine learning for NVMe SSDs. In IEEE Transactions on Parallel and Distributed Systems (TPDS\u201922). 34, 1 (2022), 383\u2013399."},{"doi-asserted-by":"publisher","key":"e_1_3_3_34_2","DOI":"10.1007\/978-3-319-57959-7"},{"key":"e_1_3_3_35_2","first-page":"191","article-title":"Accountability. Health insurance portability and Accountability Act of 1996","volume":"104","year":"1996","unstructured":"Act. 1996. Accountability. Health insurance portability and Accountability Act of 1996. Pub. Law 104 (1996), 191.","journal-title":"Pub. Law"},{"doi-asserted-by":"publisher","key":"e_1_3_3_36_2","DOI":"10.1145\/3488932.3523255"},{"doi-asserted-by":"publisher","key":"e_1_3_3_37_2","DOI":"10.1109\/ICCD53106.2021.00047"},{"key":"e_1_3_3_38_2","volume-title":"An efficient data migration scheme to optimize garbage collection in SSDs","author":"Wang Shunzhuo","year":"2020","unstructured":"Shunzhuo Wang, You Zhou, Jiaona Zhou, Fei W., and Changsheng Xie. 2020. An efficient data migration scheme to optimize garbage collection in SSDs. IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems (TCAD\u201920). 40, 3 (2020), 430\u2013443."},{"doi-asserted-by":"publisher","key":"e_1_3_3_39_2","DOI":"10.1145\/1519065.1519081"},{"doi-asserted-by":"publisher","key":"e_1_3_3_40_2","DOI":"10.1145\/3078468.3078479"},{"doi-asserted-by":"publisher","key":"e_1_3_3_41_2","DOI":"10.1109\/2.485891"},{"doi-asserted-by":"publisher","key":"e_1_3_3_42_2","DOI":"10.1016\/j.heliyon.2018.e00938"},{"key":"e_1_3_3_43_2","volume-title":"Exploring and exploiting the multilevel parallelism inside SSDs for improved performance and endurance","author":"Hu Yang","year":"2012","unstructured":"Yang Hu, Hong Jiang, Dan Feng, Lei Tian, Hao Luo, and Chao Ren. 2012. Exploring and exploiting the multilevel parallelism inside SSDs for improved performance and endurance. IEEE Transactions on Computers (TC\u201912) 62, 6 (2012), 1141\u20131155."},{"doi-asserted-by":"publisher","key":"e_1_3_3_44_2","DOI":"10.1109\/TCAD.2020.3012252"},{"key":"e_1_3_3_45_2","volume-title":"Read refresh scheduling and data reallocation against read disturb in SSDs. ACM Transactions on Embedded Computing Systems (TECS\u201922) 21, 2","author":"Liao Jianwei","year":"2022","unstructured":"Jianwei Liao, Jun Li, Mingwang Zhao, Zhibing Sha, and Zhigang Cai. 2022. Read refresh scheduling and data reallocation against read disturb in SSDs. ACM Transactions on Embedded Computing Systems (TECS\u201922) 21, 2 (2022), 1\u201327."},{"unstructured":"Alibaba Block Traces. Alibaba Group. Retrieved from https:\/\/github.com\/alibaba\/block-traces","key":"e_1_3_3_46_2"},{"key":"e_1_3_3_47_2","volume-title":"Intermediate microeconomics","author":"Varian Hal R.","year":"2010","unstructured":"Hal R. Varian. 2010. Intermediate microeconomics (8th Edition): a modern approach. WW Norton & Company, 2010.","edition":"8"},{"doi-asserted-by":"publisher","key":"e_1_3_3_48_2","DOI":"10.1145\/3373376.3378490"}],"container-title":["ACM Transactions on Storage"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3639826","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3639826","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T00:03:50Z","timestamp":1750291430000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3639826"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,2,19]]},"references-count":47,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2024,5,31]]}},"alternative-id":["10.1145\/3639826"],"URL":"https:\/\/doi.org\/10.1145\/3639826","relation":{},"ISSN":["1553-3077","1553-3093"],"issn-type":[{"type":"print","value":"1553-3077"},{"type":"electronic","value":"1553-3093"}],"subject":[],"published":{"date-parts":[[2024,2,19]]},"assertion":[{"value":"2023-07-03","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2023-12-26","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2024-02-19","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}