{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,15]],"date-time":"2025-12-15T19:49:59Z","timestamp":1765828199023,"version":"3.41.0"},"reference-count":36,"publisher":"Association for Computing Machinery (ACM)","issue":"1","license":[{"start":{"date-parts":[[2022,10,29]],"date-time":"2022-10-29T00:00:00Z","timestamp":1667001600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Ministry of Science and Technology","award":["108-2221-E-011-057-MY3"],"award-info":[{"award-number":["108-2221-E-011-057-MY3"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Embed. Comput. Syst."],"published-print":{"date-parts":[[2023,1,31]]},"abstract":"<jats:p>Although NAND flash memory has the advantages of small size, low-power consumption, shock resistance, and fast access speed, NAND flash memory still faces the problems of \u201cout-of-place updates,\u201d \u201cgarbage collection,\u201d and \u201cunbalanced execution time\u201d due to its hardware limitations. Usually, a flash translation layer (FTL) can maintain the mapping cache (in limited DRAM space) to store the frequently accessed address mapping for \u201cout-of-place updates\u201d and maintain the read\/write buffer (in limited DRAM space) to store the frequently accessed data for \u201cgarbage collection\u201d and \u201cunbalanced execution time\u201d. In this article, we will propose a write-related and read-related DRAM allocation strategy inside solid-state drives (SSDs). The design idea behind the write-related DRAM allocation method is to calculate the suitable DRAM allocation for the write buffer and the write mapping cache by building a statistical model with a minimum expected value of writes for NAND flash memory. To further reduce reads in NAND flash memory, the design idea behind the read-related DRAM allocation method is to adopt a cost-benefit policy to reallocate the proper DRAM space from the write buffer and the write mapping cache to the read buffer and the read mapping cache, respectively. According to the experimental results, we can demonstrate that the proposed write-related and read-related DRAM allocation strategy can reduce more reads\/writes in NAND flash memory than other methods to improve the response time.<\/jats:p>","DOI":"10.1145\/3561301","type":"journal-article","created":{"date-parts":[[2022,9,3]],"date-time":"2022-09-03T12:21:01Z","timestamp":1662207661000},"page":"1-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":5,"title":["A Write-Related and Read-Related DRAM Allocation Strategy Inside Solid-State Drives (SSDs)"],"prefix":"10.1145","volume":"22","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-0918-4577","authenticated-orcid":false,"given":"Po-Chen","family":"Yeh","sequence":"first","affiliation":[{"name":"National Taiwan University of Science and Technology, Taipei, Taiwan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8704-1483","authenticated-orcid":false,"given":"Chin-Hsien","family":"Wu","sequence":"additional","affiliation":[{"name":"National Taiwan University of Science and Technology, Taipei, Taiwan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9583-8997","authenticated-orcid":false,"given":"Yung-Hsiang","family":"Lin","sequence":"additional","affiliation":[{"name":"National Taiwan University of Science and Technology, Taipei, Taiwan"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0063-820X","authenticated-orcid":false,"given":"Ming-Yan","family":"Wu","sequence":"additional","affiliation":[{"name":"National Taiwan University of Science and Technology, Taipei, Taiwan"}]}],"member":"320","published-online":{"date-parts":[[2022,10,29]]},"reference":[{"key":"e_1_3_1_2_2","unstructured":"2020. SNIA IOTTA Trace Repository."},{"key":"e_1_3_1_3_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCE.2017.7931973"},{"key":"e_1_3_1_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/9780470316757"},{"key":"e_1_3_1_5_2","first-page":"187","volume-title":"Proceedings of the 8th IEEE Real-Time and Embedded Technology and Applications Symposium","author":"Chang Li-Pin","year":"2002","unstructured":"Li-Pin Chang and Tei-Wei Kuo. 2002. An adaptive striping architecture for flash memory storage systems of embedded systems. In Proceedings of the 8th IEEE Real-Time and Embedded Technology and Applications Symposium. IEEE, 187\u2013196."},{"key":"e_1_3_1_6_2","doi-asserted-by":"publisher","DOI":"10.23919\/DATE.2019.8715252"},{"key":"e_1_3_1_7_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCE.2020.2981618"},{"key":"e_1_3_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/3373376.3378502"},{"key":"e_1_3_1_9_2","unstructured":"Storage Performance Council. 2002. SPC Trace File Format Specification."},{"key":"e_1_3_1_10_2","doi-asserted-by":"publisher","DOI":"10.1007\/s11390-019-1902-3"},{"key":"e_1_3_1_11_2","doi-asserted-by":"publisher","DOI":"10.1145\/1508284.1508271"},{"key":"e_1_3_1_12_2","doi-asserted-by":"publisher","DOI":"10.1109\/NAS.2015.7255206"},{"key":"e_1_3_1_13_2","doi-asserted-by":"publisher","DOI":"10.1145\/3126537"},{"key":"e_1_3_1_14_2","doi-asserted-by":"publisher","DOI":"10.1145\/3195970.3196034"},{"key":"e_1_3_1_15_2","doi-asserted-by":"publisher","DOI":"10.1109\/TCAD.2019.2962781"},{"key":"e_1_3_1_16_2","doi-asserted-by":"publisher","DOI":"10.1145\/3078468.3078479"},{"key":"e_1_3_1_17_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICCAD45719.2019.8942140"},{"key":"e_1_3_1_18_2","doi-asserted-by":"publisher","DOI":"10.1145\/3400302.3415652"},{"key":"e_1_3_1_19_2","unstructured":"Marvell. 2018. Marvell Demonstrates Artificial Intelligence SSD Controller Architecture Solution. https:\/\/www.marvell.com\/company\/newsroom\/marvell-demonstrates-artificial-intelligence-ssd-controller-architecture-solution.html."},{"key":"e_1_3_1_20_2","doi-asserted-by":"publisher","DOI":"10.1145\/1416944.1416949"},{"key":"e_1_3_1_21_2","doi-asserted-by":"publisher","DOI":"10.1145\/170036.170081"},{"key":"e_1_3_1_22_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICTC.2017.8190778"},{"key":"e_1_3_1_23_2","doi-asserted-by":"publisher","DOI":"10.23919\/DATE54114.2022.9774532"},{"key":"e_1_3_1_24_2","unstructured":"Lloyd S. Shapley. 1952. A Value for n-Person Games."},{"key":"e_1_3_1_25_2","first-page":"439","volume-title":"Proceedings of the 20th International Conference on Very Large Databases. Santiago, Chile","author":"Shasha D.","year":"1994","unstructured":"D. Shasha and T. Johnson. 1994. 2q: A low overhead high performance buffer management replacement algoritm. In Proceedings of the 20th International Conference on Very Large Databases. Santiago, Chile, 439\u2013450."},{"key":"e_1_3_1_26_2","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2010.5496995"},{"key":"e_1_3_1_27_2","doi-asserted-by":"publisher","DOI":"10.1109\/ISSCC.2019.8662445"},{"key":"e_1_3_1_28_2","doi-asserted-by":"publisher","DOI":"10.1145\/3392717.3392766"},{"key":"e_1_3_1_29_2","doi-asserted-by":"publisher","DOI":"10.1109\/RTCSA.2019.8864577"},{"key":"e_1_3_1_30_2","doi-asserted-by":"publisher","DOI":"10.1038\/s41592-019-0686-2"},{"key":"e_1_3_1_31_2","doi-asserted-by":"publisher","DOI":"10.1145\/3225058.3225126"},{"key":"e_1_3_1_32_2","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2019.2938956"},{"key":"e_1_3_1_33_2","doi-asserted-by":"publisher","DOI":"10.1109\/ICESS.2019.8782508"},{"key":"e_1_3_1_34_2","doi-asserted-by":"publisher","DOI":"10.5555\/3357062.3357089"},{"key":"e_1_3_1_35_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2019.2958609"},{"key":"e_1_3_1_36_2","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2017.2723758"},{"key":"e_1_3_1_37_2","doi-asserted-by":"publisher","DOI":"10.1109\/TPDS.2018.2871826"}],"container-title":["ACM Transactions on Embedded Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3561301","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3561301","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T19:00:35Z","timestamp":1750186835000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3561301"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,10,29]]},"references-count":36,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2023,1,31]]}},"alternative-id":["10.1145\/3561301"],"URL":"https:\/\/doi.org\/10.1145\/3561301","relation":{},"ISSN":["1539-9087","1558-3465"],"issn-type":[{"type":"print","value":"1539-9087"},{"type":"electronic","value":"1558-3465"}],"subject":[],"published":{"date-parts":[[2022,10,29]]},"assertion":[{"value":"2022-03-08","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-08-13","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2022-10-29","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}