… We have reduced the problem of computing these competitive ratios to the minimum cycle
ratio problem over finite graphs which represent the possible relative behavior of the two …

… To solve these problems, in this paper we proposed two cache replacement algorithms,
the Pareto Least Recently Used algorithm (PLRU for short) and Pareto Least Frequently Used …

… To solve this problem, researchers have proposed many methods and the web … , high-hit
rate cache replacement policy for web cache to improve the performance of cache. We consider …

… the problem of improving cache predictability and performance in embedded systems
through the use of softwareassisted replacement … that affects the cache replacement decision. …

… The data management schemes developed for architecture based wireless network cannot
be use directly to solve the data management problems in a MANET as they are inherently …

… , an adaptive cache replacement algorithm based on RDD … cache replacement algorithm
proposed in this paper can fully use memory resources and effectively reduce the problem …

… problem in (5) with a priori unknown popularity set P, we propose an Online Distributed Cache
Replacement (… In order to address this problem, we proposed an ODCR algorithm based …

… This proves that our approach to the energy consumption problem is correct and that when
we achieve better-hit rate and reduce the number of misses we are actually reducing the …

… However, the drawbacks of NVM, such as long read/write latency give rise to potential
problems leading to asymmetric cache misses in the hybrid main memory. Current last level …

… We consider the paging problem where the pages have … The problem of developing and
evaluating page replacement … brought into the cache, we call our version of the problem the …