RFFE: A Buffer Cache Management Algorithm for Flash-Memory-Based SSD to Improve Write Performance

Flash-memory-based solid-state drives use multiple NAND flash memory chips as storage media and deploy a large-sized random access memory (RAM) inside it. This RAM buffer absorbs the read and write requests by file systems, and thus the resulting write requests to NAND flash memory are determined by the buffer replacement scheme. Many of the previously proposed algorithms concentrate on improving the random write performance by reordering the writes, addressing the temporal locality, or evicting the clean pages beforehand. However, the sequential write patterns in the incoming write stream are not completely utilized by the flash translation layer; this increases garbage collection overhead. To overcome this limitation, we propose a novel algorithm, called random first flash enlargement (RFFE), to improve the performance of the write operation. The algorithm identifies the interleaved sequential writes and builds various policy decisions, and the write sequence is constructed by contemplating the flash memory characteristics. In particular, the write stream is written into an appropriate log block area. Trace driven simulation is compared with the previously proposed least recently used fully-associative sector translation (FAST), block padding least recently used (BPLRU), and recently-evicted-first (REF) buffer management schemes. The result shows that the RFFE outperforms the previously proposed schemes with respect to merge, erase, and write count.