Computer Science ›› 2017, Vol. 44 ›› Issue (6): 51-56.doi: 10.11896/j.issn.1002-137X.2017.06.008

Previous Articles     Next Articles

Read-Write Performance Optimization Scheduling Scheme for SSD

ZHU Yue, WU Fei, XIONG Qin and XIE Chang-sheng   

  • Online:2018-11-13 Published:2018-11-13

Abstract: Compared with traditional hard disk drives (HDDs),NAND-Flash-based solid-state drives (SSDs) are non-volatile and can provide better performance as well as lower power consumption.Therefore,they have achieved extensive application in data centers,cloud computing and online transaction trading,etc.However,in NAND Flash memory,the speed of read operation is significantly faster than the write operation.Hence,for a concurrent workload with a mixture of read and write requests,reads may be blocked by writes,which exhibites an enormous read latency.In many read-intensive applications,especially the online transaction trading,in which the proportion of read requests is than 90%,the sharp increase of the read latency influences the overall performance of the system severely.In this paper,we proposed a read-write performance optimization scheduling scheme which achieves remarkable improvement about the read performance by dynamically adjusting the priority sequence of read and write requests beneath the flash translation layer.In the experiment,we designed and built an SSD simulator to evaluate the effectiveness of the scheduling scheme.Experimental results show that by implementing the proposed scheme,the maximum and the average read latency in the system are substantially reduced,with the reduction of 72% and 41%,respectively.

Key words: Flash memory,SSD,Data scheduling,Queue management

[1] QIN Z,WANG Y,LIU D,et al.Real-time flash translation layer for NAND flash memory storage systems [C]∥Proc of IEEE RTAS’12.Piscataway,NJ:IEEE,2012:35-44.
[2] JUNG M,CHOI W,SRIKANTAIAH S,et al.HIOS:A host interface I/O scheduler for solid state disks [J].ACM SIGARCH Computer Architecture News,2014,2(3):289-300.
[3] LEE J,KIM Y,SHIPMAN G M,et al.Preemptible I/O scheduling of garbage collection for solid state drives [J].IEEE Tran-sactions on CADCS,2013,2(2):247-260.
[4] ABDURRAB A R,XIE T,WANG W.DLOOP:A flash translation layer exploiting plane-level parallelism [C]∥Proc of IEEE IPDPS’13.Piscataway,NY:IEEE,2013:908-918.
[5] GAO C,SHI L,ZHAO M,et al.Exploiting parallelism in I/Oscheduling for access conflict minimization in flash-based solid state drives [C]∥ Proc of IEEE MSST’14.Piscataway,NY:IEEE,2014:1-11.
[6] PARK S,SHEN K.FIOS:A fair,efficient flash I/O scheduler [C]∥Proc of USENIX FAST’12.Berkeley,CA:USENIX,2012:1-15.
[7] PARK S,SEO E,SHIN J Y,et al.Exploiting internal paralle-lism of flash-based SSDs [J].Computer Architecture Letters,2010,9(1):9-12.
[8] CHEN F,LEE R,ZHANG X.Essential roles of exploiting internal parallelism of flash memory based solid state drives in high-speed data processing [C]∥Proc of IEEE HPCA’11.Piscata-way,NY:IEEE,2011:266-277.
[9] PARK S,SHEN K.A performance evaluation of scientific I/O workloads on flash-based SSDs[C]∥Proc of IEEE CLUSTER’09.Piscataway,NY:IEEE,2009:1-5.
[10] CAI Y,LUO Y,GHOSE S,et al.Read disturb errors in MLC NAND flash memory:Characterization,mitigation,and recovery [C]∥ Proc of IEEE DSN’15.Piscataway,NY:IEEE,2015:438-449.
[11] YANG M C,CHANG Y H,TSAO C W,et al.Utilization-aware self-tuning design for TLC flash storage devices [J].IEEE Trans.on Very Large Scale Integration Systems,2016,24(10):3132-3144.
[12] BEZ R,CAMERLENGHI E,MODELLI A,et al.Introduction to flash memory [J].Proceedings of the IEEE,2003,1(4):489-502.
[13] JUNG D,CHAE Y H,JO H,et al.A group-based wear-leveling algorithm for large-capacity flash memory storage systems [C]∥Proc of ACM CASES’07.New York,NY:ACM,2007:160-164.
[14] HU Y,JIANG H,FENG D,et al.Exploring and exploiting the multilevel parallelism inside SSDs for improved performance and endurance [J].IEEE Transactions on Computers,2013,2(6):1141-1155.

No related articles found!
Viewed
Full text


Abstract

Cited

  Shared   
  Discussed   
No Suggested Reading articles found!