CFLRU: a replacement algorithm for flash memory
CASES '06 Proceedings of the 2006 international conference on Compilers, architecture and synthesis for embedded systems
An adaptive two-level management for the flash translation layer in embedded systems
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
A log buffer-based flash translation layer using fully-associative sector translation
ACM Transactions on Embedded Computing Systems (TECS)
A reliable B-tree implementation over flash memory
Proceedings of the 2008 ACM symposium on Applied computing
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 reconfigurable FTL (flash translation layer) architecture for NAND flash-based applications
ACM Transactions on Embedded Computing Systems (TECS)
Performance Trade-Offs in Using NVRAM Write Buffer for Flash Memory-Based Storage Devices
IEEE Transactions on Computers
CFDC: a flash-aware replacement policy for database buffer management
Proceedings of the Fifth International Workshop on Data Management on New Hardware
A flexible simulation environment for flash-aware algorithms
Proceedings of the 18th ACM conference on Information and knowledge management
Operation-aware buffer management in flash-based systems
Proceedings of the 2011 ACM SIGMOD International Conference on Management of data
Plugging versus logging: a new approach to write buffer management for solid-state disks
Proceedings of the 48th Design Automation Conference
AD-LRU: An efficient buffer replacement algorithm for flash-based databases
Data & Knowledge Engineering
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
CCF-LRU: a new buffer replacement algorithm for flash memory
IEEE Transactions on Consumer Electronics
| Hi-index | 0.00 |
Due to the limitations of flash memory, such as asymmetric I/O latencies and not-in-place update, there are two kinds of buffer replacement algorithms: page-clustered policy and group-clustered policy. That the former one organizes pages at page-level makes it easy to deal with hot pages, but shows a bad performance when the buffer size is large enough. The latter one organizes pages at group-level, which usually ignores the read request from the host as the RAM size inside SSDs (Solid State Disks) is limited. However, as the read/write latency for flash memory is about 1:10, and most of desk and server application programs are read-intensive, applying a small portion of buffer space for some hot clean pages will benefit most. In this paper, we propose such a buffer management scheme called h-Buffer with three lists. Applying less than 7.125% of the buffer size for clean pages, h-Buffer considers both the write and read requests by the adoption of a replacement policy, a write-back policy and a HL (hot list) compensating policy. Unlike certain existing algorithms, it does not only consider the recency and frequency of page references, but also interacts with the buffer capacities and FTL timely. Experiment results show that the erase count, write count, read count and run time of h-Buffer decrease 50% over traditional algorithms on average.