Results 11 to 20 of about 3,052 (265)
Cache Replacement for Transcoding Proxy Caching [PDF]
The 2005 IEEE/WIC/ACM International Conference on Web Intelligence (WI'05), 2005 In this paper, we address the problem of cache replacement for transcoding proxy caching. First, an efficient cache replacement algorithm is proposed. Our algorithm considers both the aggregate effect of caching multiple versions of the same multimedia object and cache consistency.
null Keqiu Li, K. Tajima, null Hong Shen
openaire +1 more source
IEEE Access, 2023 Belady’s algorithm is widely known as an optimal cache replacement policy. It has been the foundation of numerous recent studies on cache replacement policies, and most studies assume this as an upper limit.
Ho Jung Yoo, Jeong Hun Kim, Tae Hee Han
doaj +1 more source
Replacement algorithms for object caching [PDF]
Proceedings of the 1998 ACM symposium on Applied Computing - SAC '98, 1998 Saied Hosseini-Khayat
openalex +2 more sources
A Cache Placement Strategy Based on Entropy Weighting Method and TOPSIS in Named Data Networking
IEEE Access, 2021 Named data networking (NDN) aims to change the traditional content delivery method and caching by router nodes caching and participating in forwarding.
Yiqi Gui, Yongkang Chen
doaj +1 more source
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
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
Managing data caches using selective cache line replacement [PDF]
International Journal of Parallel Programming, 1997 As processor performance continues to improve, more demands are being placed on the performance of the memory system. The caches employed in current processor designs are very similar to those described in early cache studies. In this paper, a detailed characterization of data cache behavior for individual load instructions is given.
Gary Tyson +3 more
openaire +1 more source
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