Results 131 to 140 of about 41,981 (173)
Some of the next articles are maybe not open access.
The Cache Replacement Problem for Multimedia Object Caching
2005 First International Conference on Semantics, Knowledge and Grid, 2005Multimedia object caching, by which the same multimedia object can be adapted to diverse mobile appliances through the technique of transcoding, is an important technology for improving the scalability of Web services, especially in the environment of mobile networks.
Wenyu Qu +4 more
openaire +1 more source
2010 IEEE International Conference on Computer Design, 2010
Conventional cache replacement policies use access information of each cache block for replacement decisions. We observe that there are many identical tags across different cache sets because programs exhibit spatial locality. The number of different tags in cache memory is significantly less than the total number of cache blocks in a cache. We propose
Chuanjun Zhang, Bing Xue
openaire +1 more source
Conventional cache replacement policies use access information of each cache block for replacement decisions. We observe that there are many identical tags across different cache sets because programs exhibit spatial locality. The number of different tags in cache memory is significantly less than the total number of cache blocks in a cache. We propose
Chuanjun Zhang, Bing Xue
openaire +1 more source
Attack Resilience of Cache Replacement Policies
IEEE INFOCOM 2021 - IEEE Conference on Computer Communications, 2021Caches are pervasively used in computer networks to speed up access by reusing previous communications, where various replacement policies are used to manage the cached contents. The replacement policy of a cache plays a key role in its performance, and is thus extensively engineered to achieve a high hit ratio in benign environments.
Tian Xie 0004 +3 more
openaire +1 more source
Effective cache replacement policy for packet processing cache
International Journal of Communication Systems, 2020SummaryOwing to the explosive increase in Internet traffic, increasing the throughput and energy efficiency of core routers is an important issue for future internet. Accessing the ternary content addressable memory (TCAM) in a core router can significantly degrade its throughput and energy efficiency owing to its low operating frequency and power ...
openaire +1 more source
Instruction Cache Replacement Policies and Organizations [PDF]
IEEE Transactions on Computers, 1985 Instruction cache replacement policies and organizations are analyzed both theoretically and experimentally. Theoretical analyses are based on a new model for cache references —the loop model. First the loop model is used to study replacement policies and cache organizations.
James E. Smith 0001, James R. Goodman
exaly +2 more sources
Cache replacement with dynamic exclusion
Proceedings of the 19th annual international symposium on Computer architecture - ISCA '92, 1992Most recent cache designs use direct-mapped caches to provide the fast access time required by modern high speed CPU's. Unfortunately, direct-mapped caches have higher miss rates than set-associative caches, largely because direct-mapped caches are more sensitive to conflicts between items needed frequently in the same phase of program execution.
openaire +1 more source
A randomized Web-cache replacement scheme
Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213), 2002The problem of document replacement in Web caches has received much attention in the literature research, and it has been shown that the eviction rule "replace the least recently used document" performs poorly in Web caches. Instead, it has been shown that using a combination of several criteria, such as the recentness and frequency of use, the size ...
Konstantinos Psounis, Balaji Prabhakar
openaire +1 more source
On the Analysis of Cache Invalidation With LRU Replacement
IEEE Transactions on Parallel and Distributed Systems, 2022Caching contents close to end-users can improve the network performance, while causing the problem of guaranteeing consistency. Specifically, solutions are classified into validation and invalidation, the latter of which can provide strong cache consistency strictly required in some scenarios.
Quan Zheng 0002 +5 more
openaire +1 more source
An Efficient Web Caching Replacement Algorithm
2020One of the keys to improve the performance of Content Delivery Network (CDN) is the efficiency of caching. To get the goal of improving caching efficiency, the main aim of current CDN caching algorithms is to obtain a higher caching hit ratio, while the validation and freshness of outdated pages have not received due consideration in these replacement ...
Fan You +5 more
openaire +1 more source
Counter-based cache replacement algorithms
2005 International Conference on Computer Design, 2006Recent studies have shown that in highly associative caches, the performance gap between the least recently used (LRU) and the theoretical optimal replacement algorithms is large, suggesting that alternative replacement algorithms can improve the performance of the cache. One main reason for this performance gap is that in the LRU replacement algorithm,
Mazen Kharbutli, Yan Solihin
openaire +1 more source