{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,4]],"date-time":"2026-03-04T06:43:44Z","timestamp":1772606624881,"version":"3.50.1"},"reference-count":31,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2016,5,12]],"date-time":"2016-05-12T00:00:00Z","timestamp":1463011200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"name":"Ministry of Science"},{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"crossref","award":["NRF-2013R1A6A3A03063762"],"award-info":[{"award-number":["NRF-2013R1A6A3A03063762"]}],"id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"crossref"}]},{"name":"ICT and Future Planning","award":["NRF-2013R1A2A2A01068260"],"award-info":[{"award-number":["NRF-2013R1A2A2A01068260"]}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Storage"],"published-print":{"date-parts":[[2016,6,27]]},"abstract":"<jats:p>NAND flash-based Solid-State Drives (SSDs) are becoming a viable alternative as a secondary storage solution for many computing systems. Since the physical characteristics of NAND flash memory are different from conventional Hard-Disk Drives (HDDs), flash-based SSDs usually employ an intermediate software layer, called a Flash Translation Layer (FTL). The FTL runs several firmware algorithms for logical-to-physical mapping, I\/O interleaving, garbage collection, wear-leveling, and so on. These FTL algorithms not only have a great effect on storage performance and lifetime, but also determine hardware cost and data integrity. In general, a hybrid FTL scheme has been widely used in mobile devices because it exhibits high performance and high data integrity at a low hardware cost. Recently, a demand-based FTL based on page-level mapping has been rapidly adopted in high-performance SSDs. The demand-based FTL more effectively exploits the device-level parallelism than the hybrid FTL and requires a small amount of memory by keeping only popular mapping entries in DRAM. Because of this caching mechanism, however, the demand-based FTL is not robust enough for power failures and requires extra reads to fetch missing mapping entries from NAND flash. In this article, we propose a new flash translation layer called LAST++. The proposed LAST++ scheme is based on the hybrid FTL, thus it has the inherent benefits of the hybrid FTL, including low resource requirements, strong robustness for power failures, and high read performance. By effectively exploiting the locality of I\/O references, LAST++ increases device-level parallelism and reduces garbage collection overheads. This leads to a great improvement of I\/O performance and makes it possible to overcome the limitations of the hybrid FTL. Our experimental results show that LAST++ outperforms the demand-based FTL by 27% for writes and 7% for reads, on average, while offering higher robustness against sudden power failures. LAST++ also improves write performance by 39%, on average, over the existing hybrid FTL.<\/jats:p>","DOI":"10.1145\/2905054","type":"journal-article","created":{"date-parts":[[2016,5,13]],"date-time":"2016-05-13T14:30:58Z","timestamp":1463149858000},"page":"1-39","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":10,"title":["Exploiting Sequential and Temporal Localities to Improve Performance of NAND Flash-Based SSDs"],"prefix":"10.1145","volume":"12","author":[{"given":"Sungjin","family":"Lee","sequence":"first","affiliation":[{"name":"Massachusetts Institute of Technology, Cambridge, MA"}]},{"given":"Dongkun","family":"Shin","sequence":"additional","affiliation":[{"name":"Sungkyunkwan University, Gyeonggi-do, Republic of Korea"}]},{"given":"Youngjin","family":"Kim","sequence":"additional","affiliation":[{"name":"Ajou University, Republic of Korea"}]},{"given":"Jihong","family":"Kim","sequence":"additional","affiliation":[{"name":"Seoul National University, Republic of Korea"}]}],"member":"320","published-online":{"date-parts":[[2016,5,12]]},"reference":[{"key":"e_1_2_1_1_1","volume-title":"USENIX 2008 Annual Technical Conference on Annual Technical Conference (ATC\u201908)","author":"Agrawal Nitin","year":"2008","unstructured":"Nitin Agrawal , Vijayan Prabhakaran , Ted Wobber , John D. Davis , Mark Manasse , and Rina Panigrahy . 2008 . Design tradeoffs for SSD performance . In USENIX 2008 Annual Technical Conference on Annual Technical Conference (ATC\u201908) . USENIX Association, Berkeley, CA, 57--70. Nitin Agrawal, Vijayan Prabhakaran, Ted Wobber, John D. Davis, Mark Manasse, and Rina Panigrahy. 2008. Design tradeoffs for SSD performance. In USENIX 2008 Annual Technical Conference on Annual Technical Conference (ATC\u201908). USENIX Association, Berkeley, CA, 57--70."},{"key":"e_1_2_1_2_1","first-page":"404","article-title":"Flash file system. (April 4 1995)","volume":"5","author":"Ban Amir","year":"1995","unstructured":"Amir Ban . 1995 . Flash file system. (April 4 1995) . US Patent 5 , 404 ,485. Amir Ban. 1995. Flash file system. (April 4 1995). US Patent 5,404,485.","journal-title":"US Patent"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/1243418.1243429"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/1244002.1244248"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2010.14"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0164-1212(99)00059-X"},{"key":"e_1_2_1_7_1","volume-title":"Proceedings of the Conference on Design, Automation and Test in Europe (DATE\u201909)","author":"Cho Hyunjin","year":"2009","unstructured":"Hyunjin Cho , Dongkun Shin , and Young Ik Eom . 2009 . KAST: K-associative sector translation for NAND flash memory in real-time systems . In Proceedings of the Conference on Design, Automation and Test in Europe (DATE\u201909) . European Design and Automation Association, Leuven, Belgium, 507--512. Hyunjin Cho, Dongkun Shin, and Young Ik Eom. 2009. KAST: K-associative sector translation for NAND flash memory in real-time systems. In Proceedings of the Conference on Design, Automation and Test in Europe (DATE\u201909). European Design and Automation Association, Leuven, Belgium, 507--512."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/1508244.1508271"},{"key":"e_1_2_1_9_1","volume-title":"Proceedings of the Workshop on Algorithm Engineering and Experiments. 141--154","author":"Gregory","unstructured":"Gregory L. Heileman and Wenbin Luo. 2005. How caching affects hashing . In Proceedings of the Workshop on Algorithm Engineering and Experiments. 141--154 . Gregory L. Heileman and Wenbin Luo. 2005. How caching affects hashing. In Proceedings of the Workshop on Algorithm Engineering and Experiments. 141--154."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/MSST.2011.5937215"},{"key":"e_1_2_1_11_1","volume-title":"Proceedings of 20th International Conference on Very Large Data Bases (VLDB\u201994)","author":"Johnson Theodore","year":"1994","unstructured":"Theodore Johnson and Dennis Shasha . 1994 . 2Q: A low overhead high performance buffer management replacement algorithm . In Proceedings of 20th International Conference on Very Large Data Bases (VLDB\u201994) , September 12 --15 , 1994, Santiago de Chile, Jorge B. Bocca, Matthias Jarke, and Carlo Zaniolo (Eds.). Morgan Kaufmann, 439--450. Theodore Johnson and Dennis Shasha. 1994. 2Q: A low overhead high performance buffer management replacement algorithm. In Proceedings of 20th International Conference on Very Large Data Bases (VLDB\u201994), September 12--15, 1994, Santiago de Chile, Jorge B. Bocca, Matthias Jarke, and Carlo Zaniolo (Eds.). Morgan Kaufmann, 439--450."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1176887.1176911"},{"key":"e_1_2_1_13_1","volume-title":"Proceedings of the 23rd International Computer Software and Applications Conference (COMPSAC\u201999)","author":"Lee Kim","year":"1999","unstructured":"Han-joon Kim and Sang-goo Lee . 1999 . A new flash memory management for flash storage system . In Proceedings of the 23rd International Computer Software and Applications Conference (COMPSAC\u201999) . IEEE Computer Society, Washington, DC, 284. Han-joon Kim and Sang-goo Lee. 1999. A new flash memory management for flash storage system. In Proceedings of the 23rd International Computer Software and Applications Conference (COMPSAC\u201999). IEEE Computer Society, Washington, DC, 284."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCE.2002.1010143"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1109\/MC.2006.22"},{"key":"e_1_2_1_16_1","volume-title":"Proceedings of the 2009 Conference on USENIX Annual Technical Conference (USENIX\u201909)","author":"Lee Sungjin","year":"2009","unstructured":"Sungjin Lee , Keonsoo Ha , Kangwon Zhang , Jihong Kim , and Junghwan Kim . 2009 . FlexFS: A flexible flash file system for MLC NAND flash memory . In Proceedings of the 2009 Conference on USENIX Annual Technical Conference (USENIX\u201909) . USENIX Association, Berkeley, CA, 9--9. Sungjin Lee, Keonsoo Ha, Kangwon Zhang, Jihong Kim, and Junghwan Kim. 2009. FlexFS: A flexible flash file system for MLC NAND flash memory. In Proceedings of the 2009 Conference on USENIX Annual Technical Conference (USENIX\u201909). USENIX Association, Berkeley, CA, 9--9."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1453775.1453783"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/1275986.1275990"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/JSSC.2010.2040230"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/SNAPI.2010.9"},{"key":"e_1_2_1_21_1","unstructured":"Micron Technology Inc. 2012. MT29F16G08 MLC NAND Flash Memory Data Sheet.  Micron Technology Inc. 2012. MT29F16G08 MLC NAND Flash Memory Data Sheet."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.5555\/1927882.1927888"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/362851.362882"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1811039.1811089"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1109\/TC.2012.281"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1109\/TCE.2009.5278005"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICCSE.2012.68"},{"key":"e_1_2_1_28_1","unstructured":"SNIA. 2015. Storage Networking Industry Association. Retrieved from http:\/\/www.snia.org\/.  SNIA. 2015. Storage Networking Industry Association. Retrieved from http:\/\/www.snia.org\/."},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSEC.2014.6978234"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/PCCC.2012.6407747"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.5555\/2591272.2591300"}],"container-title":["ACM Transactions on Storage"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2905054","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2905054","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T04:54:02Z","timestamp":1750222442000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2905054"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016,5,12]]},"references-count":31,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,6,27]]}},"alternative-id":["10.1145\/2905054"],"URL":"https:\/\/doi.org\/10.1145\/2905054","relation":{},"ISSN":["1553-3077","1553-3093"],"issn-type":[{"value":"1553-3077","type":"print"},{"value":"1553-3093","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016,5,12]]},"assertion":[{"value":"2014-10-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2015-11-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2016-05-12","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}