… We propose a new replacement algorithm which is based on both recency, frequency and
… the references of each object. In fact, it performs both LRU and LFU algorithms and gives a …

… replacement algorithm’s general goal in a uniform caching environment is to reduce cache
misses, usually by replacing an object … cache misses is more important in nonuniform caching …

… the problem of cache replacement for multimedia object caching. There are many cache
replacement algorithms available in the literature. However, these algorithms cannot be directly …

… The problem with the cache memory is that there are fewer cache lines … algorithm for mapping
memory into cache lines • A mean to determine which memory block is in which cache line…

… cache replacements for transcoding proxy caching. It proposed an efficient cache replacement
algorithm to maintain the cache … into account different version of same multimedia objects. …

… Using an event-driven simulation, we investigate the performance of our cache replacement
algorithm by varying the cache capacity. As shown in Figure 3, algorithm IWCP outperforms …

… other local replacement algorithms; 4) our hierarchicalgreedy-dual replacement algorithm
… further improvements over the greedy-dual algorithm especially when there are idle caches …

… novel, high-performance cache replacement algorithm for the web cache, named weighting
size and cost replacement policy (WSCRP) bases on the weighting replacement policy. The …

… In this paper, an approximate randomized algorithm is used to replace pages in web proxy
cache. The worst case occurs when randomly selected bin does not contain any old page. …

… cache replacement algorithms are computed and the results showing the improvement in the
efficiency of the algorithm … Hence a lot of cache replacement algorithms have been devised. …