Cache management algorithm for NAND flash memory based on data access counting

In view of the problem that the existing NAND flash cache management algorithmconsidering insufficiently about the buffer replacement page selection and replacement cost and the algorithm time overhead is large, a NAND flash memory cache management algorithm based on data access counting is proposed.Considering the difference of read and write cost of NAND flash memory and the difference of data access frequency, the proposed algorithm divides data pages into cold clean, cold dirty, hot clean and hot dirty, and manages them by LRU queues.Then, according to the proposed data access count strategy, the access count value of the data page is calculated. Finally, based on queue length and data page access count, a new data page replacement strategy is proposed. The simulation results based on QEMU and Linux show that compared with LRU algorithm, CF-LRU algorithm, LRU-WSR algorithm, CCF-LRU algorithm and LLRU algorithm, the proposed algorithm can effectively reduce the number of writes and reduce the running time of the program.