A buffer replacement algorithm exploiting multi-chip parallelism in solid state disks

Solid State Disks (SSDs) are superior to magnetic disks from a performance point of view due to the favorable features of NAND flash memory. Furthermore, thanks to improvement on flash memory density and adopting a multi-chip architecture, SSDs replace magnetic disks rapidly. Most previous studies have been conducted for enhancing the performance of SSDs, but these studies have been worked on the assumption that the operation unit of a host interface is the same as the operation unit of NAND flash memory, where it is needless to give consideration to partially-filled pages. In this paper, we analyze the overhead caused by the partially-filled pages, and propose a buffer replacement algorithm exploiting multi-chip parallelism to enhance the write performance. Our simulation results show that the proposed algorithm improves the write performance by up to 30% over existing approaches.

[1]  Tei-Wei Kuo,et al.  Configurability of performance and overheads in flash management , 2006, Asia and South Pacific Conference on Design Automation, 2006..

[2]  Tei-Wei Kuo,et al.  An adaptive striping architecture for flash memory storage systems of embedded systems , 2002, Proceedings. Eighth IEEE Real-Time and Embedded Technology and Applications Symposium.

[3]  Sungjin Lee,et al.  Buffer-Aware Garbage Collection for NAND Flash Memory-Based Storage Systems , 2008 .

[4]  Rina Panigrahy,et al.  Design Tradeoffs for SSD Performance , 2008, USENIX ATC.

[5]  Dennis Shasha,et al.  2Q: A Low Overhead High Performance Buffer Management Replacement Algorithm , 1994, VLDB.

[6]  Garth A. Gibson,et al.  RAID: high-performance, reliable secondary storage , 1994, CSUR.

[7]  Seung Ryoul Maeng,et al.  FTL design exploration in reconfigurable high-performance SSD for server applications , 2009, ICS.

[8]  Seon-Ah Jin.  SAMSUNG Electronics , 2003 .

[9]  Daniel Gajski,et al.  Transaction level modeling: an overview , 2003, First IEEE/ACM/IFIP International Conference on Hardware/ Software Codesign and Systems Synthesis (IEEE Cat. No.03TH8721).

[10]  Scott A. Brandt,et al.  A Hybrid Disk-Aware Spin-Down Algorithm with I/O Subsystem Support , 2007, 2007 IEEE International Performance, Computing, and Communications Conference.

[11]  Jin-Soo Kim,et al.  FAB: flash-aware buffer management policy for portable media players , 2006, IEEE Transactions on Consumer Electronics.

[12]  Hyojun Kim,et al.  BPLRU: A Buffer Management Scheme for Improving Random Writes in Flash Storage , 2008, FAST.

[13]  Jin-Soo Kim,et al.  A methodology for extracting performance parameters in solid state disks (SSDs) , 2009, 2009 IEEE International Symposium on Modeling, Analysis & Simulation of Computer and Telecommunication Systems.

[14]  Steven Swanson,et al.  Gordon: using flash memory to build fast, power-efficient clusters for data-intensive applications , 2009, ASPLOS.

[15]  Banu Özden,et al.  Buffer replacement algorithms for multimedia storage systems , 1996, Proceedings of the Third IEEE International Conference on Multimedia Computing and Systems.

[16]  Nimrod Megiddo,et al.  ARC: A Self-Tuning, Low Overhead Replacement Cache , 2003, FAST.

[17]  Michael Isard,et al.  A design for high-performance flash disks , 2007, OPSR.

[18]  Joonwon Lee,et al.  A multi-channel architecture for high-performance NAND flash-based storage system , 2007, J. Syst. Archit..