DesynchLRU: an efficient page replacement algorithm with desynchronized cache and RAM In this paper, we present DesynchLRU, a new page replacement algorithm. DesynchLRU is a modified version of the celebrated LRU (least recently used) page replacement algorithm. The basic distinction between LRU and DesynchLRU is that, in the former, the pages in cache and RAM always remain synchronized, whereas, in the latter, they can be desynchronized. Here, we show that the page fault rate in DesynchLRU is always smaller than that of LRU. We further analyze the average cost for a page request and establish conditions for which DesynchLRU would always perform better than LRU.

Keywords for this software

Anything in here will be replaced on browsers that support the canvas element