Please wait a minute...
Frontiers of Computer Science

ISSN 2095-2228

ISSN 2095-2236(Online)

CN 10-1014/TP

邮发代号 80-970

2019 Impact Factor: 1.275

Frontiers of Computer Science  2016, Vol. 10 Issue (5): 951-964   https://doi.org/10.1007/s11704-016-5286-z
  本期目录
Prober: exploiting sequential characteristics in buffer for improving SSDs write performance
Wen ZHOU,Dan FENG,Yu HUA,Jingning LIU(),Fangting HUANG,Yu CHEN,Shuangwu ZHANG
Wuhan National Laboratory for Optoelectronics, School of Computer Science and Technology, Huazhong University of Science and Technology,Wuhan 430074, China
 全文: PDF(1008 KB)  
Abstract

Solid state disks (SSDs) are becoming one of the mainstream storage devices due to their salient features, such as high read performance and low power consumption. In order to obtain high write performance and extend flash lifespan, SSDs leverage an internal DRAM to buffer frequently rewritten data to reduce the number of program operations upon the flash. However, existing buffer management algorithms demonstrate their blank in leveraging data access features to predict data attributes. In various real-world workloads, most of large sequential write requests are rarely rewritten in near future. Once these write requests occur, many hot data will be evicted from DRAM into flash memory, thus jeopardizing the overall system performance. In order to address this problem, we propose a novel large write data identification scheme, called Prober. This scheme probes large sequential write sequences among the write streams at early stage to prevent them from residing in the buffer. In the meantime, to further release space and reduce waiting time for handling the incoming requests, we temporarily buffer the large data into DRAM when the buffer has free space, and leverage an actively write-back scheme for large sequential write data when the flash array turns into idle state. Experimental results demonstrate that our schemes improve hit ratio of write requests by up to 10%, decrease the average response time by up to 42% and reduce the number of erase operations by up to 11%, compared with the state-of-the-art buffer replacement algorithms.

Key wordsSSDs    storage system    buffer management    sequential write requests
收稿日期: 2015-07-10      出版日期: 2016-09-07
Corresponding Author(s): Jingning LIU   
 引用本文:   
. [J]. Frontiers of Computer Science, 2016, 10(5): 951-964.
Wen ZHOU,Dan FENG,Yu HUA,Jingning LIU,Fangting HUANG,Yu CHEN,Shuangwu ZHANG. Prober: exploiting sequential characteristics in buffer for improving SSDs write performance. Front. Comput. Sci., 2016, 10(5): 951-964.
 链接本文:  
https://academic.hep.com.cn/fcs/CN/10.1007/s11704-016-5286-z
https://academic.hep.com.cn/fcs/CN/Y2016/V10/I5/951
1 Intel Corporation. Understanding the flash translation layer (FTL) specification. Application Note AP-684. 1998
2 Micron Technology Inc. 64Gb, 128Gb, 256Gb, 512Gb Asynchronous/ Synchronous NAND Features. Micron, 2009
3 Jiang S, Zhang L, Yuan X H, Hu H, Chen Y. S-FTL: an efficient address translation for flash memory by exploiting spatial locality. In: Proceedings of the 27th IEEE Symposium on Mass Storage Systems and Technologies. 2011, 1–12
https://doi.org/10.1109/msst.2011.5937215
4 Gupta A, Kim Y, Urgaonkar B. DFTL: a flash translation layer employing demand-based selective caching of page-level address mappings. In: Proceedings of the International Conference on Architectural Support for Programming Languages and Operating System. 2009
https://doi.org/10.1145/1508244.1508271
5 Chang L P. On efficient wear leveling for large-scale flash-memory storage systems. In: Proceedings of the 2007 ACM symposium on Ap plied computing. 2007, 1126–1130
https://doi.org/10.1145/1244002.1244248
6 Murugan M, Du D H C. Rejuvenator: a static wear leveling algorithm for NAND flash memory with minimized overhead. In: Proceedings of the 27th IEEE Symposium on Mass Storage Systems and Technologies. 2011, 1–12
https://doi.org/10.1109/msst.2011.5937225
7 Kavalanekar S, Worthington B, Zhang Q, Sharda V. Characterization of storage workload traces from production windows servers. In: Proceedings of IEEE International Symposium on Workload Characterization. 2008, 119–128
https://doi.org/10.1109/iiswc.2008.4636097
8 Jiang S, Zhang X. LIRS: an efficient low inter-reference recency set replacement policy to improve buffer cache performance. In: Proceedings of ACM SIGMETRICS Conference. 2002, 31–42
https://doi.org/10.1145/511399.511340
9 Hu Y, Jiang H, Feng D, Tian L, Zhang S, Liu J, Tong W, Qin Y, Wang L. Achieving page-mapping FTL performance at block-mapping FTL cost by hiding address translation. In: proceedings of the 26th IEEE Symposium on Mass Storage Systems and Technologies. 2010
https://doi.org/10.1109/msst.2010.5496970
10 Kim C S. LRFU: a spectrum of policies that subsumes the least recently used and least frequently used policies. IEEE Transactions on Computers, 2001, 50(12): 1352–1361
https://doi.org/10.1109/TC.2001.970573
11 Zhou Y, Philbin J, Li K. The multi-queue replacement algorithm for second level buffer caches. In: Proceedings of the 2001 USENIX Annual Technical Conference. 2001, 91–104
12 O’neil E J, O’neil P E, Weikum G, The LRU-K page replacement algorithm for database disk buffering. ACMSIGMOD Record, 1993, 22(2): 297–306
https://doi.org/10.1145/170036.170081
13 Jo H, Kang J U, Park S Y, Kim J S, Lee J. FAB: flash-aware buffer management policy for portable media players. IEEE Transactions on Consumer Electronics, 2006, 52(2): 485–493
https://doi.org/10.1109/TCE.2006.1649669
14 Kim H, Ahn S. BPLRU: a buffer management scheme for improving random writes in flash storage. In: Proceedings of the 6th USENIX Conference on File and Storage Technologies. 2008
15 Wu G, Eckart B, He X. BPAC: an adaptive write buffer management scheme for flash-based solid state drives. In: Proceedings of the 26th IEEE Symposium on Mass Storage Systems and Technologies. 2010, 1–6
https://doi.org/10.1109/msst.2010.5496998
16 Canim M, Mihaila G A, Bhattacharjee B, Lang C A, Ross K A. Buffered bloom filters on solid state storage. In: Proceedings of VLDB ADMS Workshop. 2010
17 Park S Y, Jung D, Kang J U, Kim J S, Lee J. CFLRU: a replacement algorithm for flash memory. In: Proceedings of the 2006 ACM International Conference on Compilers, Architecture and Synthesis for Embedded Systems. 2006, 234–241
https://doi.org/10.1145/1176760.1176789
18 Jung H, Shim H, Park S, Kang S, Cha J. LRU-WSR: integration of LRU and writes sequence reordering for flash memory. IEEE Transactions on Consumer Electronics, 2008, 54(3): 1215–1223
https://doi.org/10.1109/TCE.2008.4637609
19 Li Z, Jin P, Su X, Cui K, Yue L. CCF-LRU: a new buffer replacement algorithm for flashmemory. IEEE Transactions on Consumer Electronics, 2009, 55(3): 1351–1359
https://doi.org/10.1109/TCE.2009.5277999
20 Jin P, Ou Y, Härder T, Li Z. AD-LRU: an efficient buffer replacement algorithm for flash-based databases. Data & Knowledge Engineering, 2012, 72: 83–102
https://doi.org/10.1016/j.datak.2011.09.007
21 On S T, Li Y, He B,Wu M, Luo Q, Xu J. FD-buffer: a buffer manager for databases on flash disks. In: Proceedings of the 19th ACM International Conference on Information and Knowledge Management. 2010, 1297–1300
https://doi.org/10.1145/1871437.1871605
22 Lv Y, Cui B, He B, Chen X, Operation-aware buffer management in flash-based systems. In: Proceedings of the 2011 ACM SIGMOD International Conference on Management of data. 2011, 13–24
https://doi.org/10.1145/1989323.1989326
23 Canim M, Mihaila G A, Bhattacharjee B, Ross K A, Lang C A. SSD bufferpool extensions for database systems. Proceedingsof the VLDB Endowment, 2010, 3(1–2): 1435–1446
https://doi.org/10.14778/1920841.1921017
24 Stuecheli J, Kaseridis D, Daly D, Hunter H C, John L K. The virtual write queue: coordinating dram and last-level cache policies. ACM SIGARCH Computer Architecture News, 2010, 38(3): 72–82
https://doi.org/10.1145/1816038.1815972
25 Lee H H S, Tyson G S, Farrens M K. Eager writeback — a technique for improving bandwidth utilization. In: Proceedings of the 33rd Annual ACM/IEEE International Symposium onMicroarchitecture. 2000, 11–21
[1]   Download
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed