Proof of Optimality based on Greedy Algorithm for Offline Cache Replacement Algorithm.

S Srivastava, PK Singh - International Journal of Next …, 2022 - search.ebscohost.com
The optimal offline cache replacement algorithm is a MIN algorithm that chooses which data
item to remove when a new data item is brought from lower level of cache or main memory …

Cache memory: An analysis on replacement algorithms and optimization techniques

Q Javaid, A Zafar, M Awais… - … Research Journal of …, 2017 - search.informit.org
Caching strategies can improve the overall performance of a system by allowing the fast
processor and slow memory to at a same pace. One important factor in caching is the …

A new cache replacement scheme based on backpropagation neural networks

H Khalid - ACM SIGARCH Computer Architecture News, 1997 - dl.acm.org
In this paper, we present a new neural network-based algorithm, KORA (K halid Shad O w R
eplacement A lgorithm), that uses backpropagation neural network (BPNN) for the purpose …

A short proof of optimality for the MIN cache replacement algorithm

B Van Roy - Information processing letters, 2007 - Elsevier
The MIN algorithm is an offline strategy for deciding which item to replace when writing a
new item to a cache. Its optimality was first established by Mattson et al.[RL Mattson, J …

[PDF][PDF] A replacement algorithm based on weighting and ranking cache objects

K Samiee - International Journal of Hybrid Information Technology, 2009 - Citeseer
Caching is one of the major steps in system designing to reach a higher performance in
operating systems, databases and World Wide Web. High performance processors need …

Learning future reference patterns for efficient cache replacement decisions

H Choi, S Park - IEEE Access, 2022 - ieeexplore.ieee.org
This study proposes a cache replacement policy technique to increase the cache hit rate.
This policy can improve the efficiency of cache management and performance. Heuristic …

A study on performance evaluation of conventional cache replacement algorithms: A review

RF Olanrewaju, A Baba, BUI Khan… - … , Distributed and Grid …, 2016 - ieeexplore.ieee.org
Cache Replacement Policies play a significant and contributory role in the context of
determining the effectiveness of cache memory cells. It has also become one of the major …

CRFP: a novel adaptive replacement policy combined the LRU and LFU policies

Z Li, D Liu, H Bi - 2008 IEEE 8th International Conference on …, 2008 - ieeexplore.ieee.org
A variety of cache replacement algorithms have been proposed and applied in different
situations, in which the LRU (least recently used) and LFU (least frequently used) …

Cache replacement algorithms with nonuniform miss costs

J Jeong, M Dubois - IEEE Transactions on Computers, 2006 - ieeexplore.ieee.org
Cache replacement algorithms originally developed in the context of uniprocessors
executing one instruction at a time implicitly assume that all cache misses have the same …

[PDF][PDF] A throughput analysis on page replacement algorithms in cache memory management

SS Daula, KS Murthy, GA Khan - system, 2012 - academia.edu
The less time any processor takes in handling instructions the more would be its speed and
efficiency. The speed of a processing device is not only based on it's Architectural features …