CFLRU: a replacement algorithm for flash memory
CASES '06 Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems
A log buffer-based flash translation layer using fully-associative sector translation
ACM Transactions on Embedded Computing Systems (TECS)
BPLRU: a buffer management scheme for improving random writes in flash storage
FAST'08 Proceedings of the 6th USENIX Conference on File and Storage Technologies
A case for flash memory ssd in enterprise database applications
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Proceedings of the 14th international conference on Architectural support for programming languages and operating systems
FlashSim: A Simulator for NAND Flash-Based Solid-State Drives
SIMUL '09 Proceedings of the 2009 First International Conference on Advances in System Simulation
KAST: K-Associative Sector Translation for NAND flash memory in real-time systems
Proceedings of the Conference on Design, Automation and Test in Europe
FeGC: An efficient garbage collection scheme for flash memory based storage systems
Journal of Systems and Software
A space-efficient flash translation layer for CompactFlash systems
IEEE Transactions on Consumer Electronics
FAB: flash-aware buffer management policy for portable media players
IEEE Transactions on Consumer Electronics
Write-aware buffer management policy for performance and durability enhancement in NAND flash memory
IEEE Transactions on Consumer Electronics
Hi-index | 0.00 |
NAND ash memory has many advantages such as low-power consumption, shock-resistance, and non-volatility. For these reasons, NAND ash memory is used for data storage purposes in mobile, personal and even enterprise computer systems. When we use NAND ash memory as a means of data storage, it requires a garbage collection procedure due to its erase-before-write characteristic. The efficiency of this garbage collection is an important issue because it affects the performance of the NAND ash memory. In this paper, we propose an efficient garbage collection scheme that can be combined with previous hybrid FTLs. Our garbage collection scheme considers the associativity of the blocks when selecting a victim block. The proposed scheme effectively reduces the number of time-consuming block erasures. Our trace-driven simulation results show that the proposed garbage collection scheme can reduce the number of block erasures by as much as 14%. It can also reduce the average response time and maximum response time by nearly 10% and 70%, respectively.