Compression and analysis between classic and modern cache replacement techniques

Abstract EN

A physical memory needs active cache replacement techniques to resolve which data blocks to drive out from memory in case of a cache miss.

Over the years have been put forward a number of algorithms to replace cache.

And all trying to reduce the proportion of reduce error while incur minimal overhead.

As more recent memory access patterns were surveyed, research basically constricted on formulating newer approaches to cache replacement which could adapt to changing workloads.

This paper attempts to recap major cache replacement techniques proposed till date.

We look at the traditional techniques like LRU and CLOCK, and also study the recent approaches such as LIRS, CLOCK-Pro, CAR, and 2-DPR.