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

PROJECT TITLE :

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

ABSTRACT:

Flash-memory-based mostly solid-state drives use multiple NAND flash memory chips as storage media and deploy a massive-sized random access memory (RAM) within it. This RAM buffer absorbs the read and write requests by file systems, and therefore the resulting write requests to NAND flash memory are determined by the buffer replacement scheme. Many of the previously proposed algorithms think about improving the random write performance by reordering the writes, addressing the temporal locality, or evicting the clean pages beforehand. However, the sequential write patterns within the incoming write stream are not completely utilised by the flash translation layer; this increases garbage assortment overhead. To overcome this limitation, we propose a completely unique algorithm, referred to as random first flash enlargement (RFFE), to improve the performance of the write operation. The algorithm identifies the interleaved sequential writes and builds numerous policy selections, and the write sequence is made by contemplating the flash memory characteristics. In specific, the write stream is written into an applicable log block space. Trace driven simulation is compared with the previously proposed least recently used totally-associative sector translation (QUICK), block padding least recently used (BPLRU), and recently-evicted-initial (REF) buffer management schemes. The result shows that the RFFE outperforms the previously proposed schemes with respect to merge, erase, and write count.

Did you like this research project?

To get this research project Guidelines, Training and Code... Click Here