Results 11 to 20 of about 41,981 (173)
Cache replacement for transcoding proxy caching [PDF]
The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05), 2005 © 2005 IEEE.In this paper, we address the problem of cache replacement for transcoding proxy caching. First, an efficient cache replacement algorithm is proposed.
Li, K., Shen, H., Tajima, K.
core +2 more sources
Replacement problem in Web caching [PDF]
Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003, 2004 Caching has been recognized as an effective scheme for avoiding service bottleneck and reducing network traffic in World Wide Web. Our work focuses on the replacement problem in Web caching, which arises due to limited storage. We seek the best configuration for a fully connected network of N caches. The problem is formulated as a discrete optimization
Çakıroğlu, Seda, Arıkan, Erdal
openaire +2 more sources
A replacement strategy for a distributed caching system based on the spatiotemporal access pattern of geospatial data [PDF]
The International Archives of the Photogrammetry, Remote Sensing and Spatial Information Sciences, 2014 Cache replacement strategy is the core for a distributed high-speed caching system, and effects the cache hit rate and utilization of a limited cache space directly.
R. Li, X. Wang, X. Shi
doaj +1 more source
CoRR, 2021 Cache replacement algorithms are used to optimize the time taken by processor to process the information by storing the information needed by processor at that time and possibly in future so that if processor needs that information, it can be provided immediately.
openaire +2 more sources
Competitive Cache Replacement Strategies for Shared Cache Environments [PDF]
2012 IEEE 26th International Parallel and Distributed Processing Symposium, 2012 We investigate cache replacement algorithms (CRAs) at a cache shared by several processes under different multicore environments. For a single shared cache, our main result is the first CRA, GLOBAL-MAXIMA, for fixed interleaving under shared full knowledge [1], where any data can be accessed by any process, and each process has full knowledge about its
Anil Kumar Katti, Vijaya Ramachandran
openaire +1 more source
IEEE Access, 2020 Increase in the size of content due to the emergence of bandwidth-intensive applications leads to a problematic phenomenon of packet-level caching which is called looped replacement.
Yoji Yamamoto +3 more
doaj +1 more source
TCOR: A Tile Cache with Optimal Replacement
2022 IEEE International Symposium on High-Performance Computer Architecture (HPCA), 2022 Cache Replacement Policies are known to have an important impact on hit rates. The OPT replacement policy [27] has been formally proven as optimal for minimizing misses. Due to its need to look far ahead for future memory accesses, it is often reduced to a yardstick for measuring the efficacy of other practical caches.
Joseph, Diya +3 more
openaire +2 more sources
Cache Replacement Algorithm Based on Sudden-centralized Access Mode [PDF]
Jisuanji gongcheng, 2017 With the continuous expansion of computer access to the sudden-centralized problems,traditional Least Recency Used(LRU),Least Frequency Used(LFU) and other cache replacement algorithms are difficult to meet the requirements of high hit ratio and low ...
LI Cong,WEN Dongxin
doaj +1 more source
IMU: A Content Replacement Policy for CCN, Based on Immature Content Selection
Applied Sciences, 2021 In-network caching is the essential part of Content-Centric Networking (CCN). The main aim of a CCN caching module is data distribution within the network. Each CCN node can cache content according to its placement policy. Therefore, it is fully equipped
Salman Rashid +2 more
doaj +1 more source
IEEE Access, 2023 The cache replacement policy (CRP) can reduce cache redundancy, improve cache usefulness, and increase network efficiency in content-centric networks (CCN). The essential challenges in addressing CRP in (CCN) evaluation involve significant fuzziness.
Muhammad Ali Khan +2 more
doaj +1 more source