Open AccessA Multiple LRU List Buffer Management Algorithm
Author(s) -
Xiang Wu,
Delin Cai,
Shujie Guan
Publication year - 2019
Publication title -
iop conference series. materials science and engineering
Language(s) - English
Resource type - Journals
eISSN - 1757-899X
pISSN - 1757-8981
DOI - 10.1088/1757-899x/569/5/052002
Subject(s) - computer science , flash (photography) , reading (process) , algorithm , law , art , political science , visual arts
Paper[1] proposes LLRU algorithm. The buffer is divided into four categories in LLRU: cold clean LRU list, cold dirty LRU list, hot clean LRU list and hot dirty LRU list. But the cold clean LRU list may be empty when the algorithm runs for a while. Then a new page just reading in buffer will be victim when the LLRU selects the victim page, leading to a clean page hard to turn into a hot page. The AM-LRU proposed in this paper ensures that the cold clean page has the chance to turn into a hot page by setting the minimum length of the cold clean LRU list and adopting secondary opportunity replacement strategy for the victim page from the hot area. As a result, compared with LLRU, the hit rate of AM-LRU can be improved and the flash reads counts, writes counts and erases counts can be reduced.