Results 201 to 210 of about 24,906 (235)
Some of the next articles are maybe not open access.
Simple penalty-sensitive replacement policies for caches
Proceedings of the 3rd conference on Computing frontiers, 2006Classic cache replacement policies assume that miss costs are uniform. However, the correlation between miss rate and cache performance is not as straightforward as it used to be. Ultimately, the true cost measure of a miss should be the penalty, i.e. the actual processing bandwidth lost because of the miss.
Jaeheon Jeong +2 more
openaire +1 more source
A Replacement Policy to Save Energy for Data Cache
19th International Symposium on High Performance Computing Systems and Applications (HPCS'05), 2005For a current processor, it has been reported that more than 50% of power has been consumed by an on-chip cache memory. To reduce power consumption for the cache memory, it is required to develop an effective replacement policy and mapping function, which would decide the cache memory accesses. In this paper, we introduce an ELRU-SEQ replacement policy
Saibhushan Musalappa +2 more
openaire +1 more source
Disk cache replacement policies for network fileservers
[1993] Proceedings. The 13th International Conference on Distributed Computing Systems, 2002Trace driven simulations were used to study the performance of several disk cache replacement policies for network file servers. It is shown that locality based approaches, such as the common least recently used (LRU) policy, which are known to work well on stand-alone disked workstations and at client workstations in distributed systems, are ...
Darryl L. Willick +2 more
openaire +1 more source
Cache Behavior Analysis of a Compiler-Assisted Cache Replacement Policy
2004Recent research results show that conventional hardware-only cache replacement policies result in unsatisfactory cache utilization because of cache pollution. To overcome this problem, cache hints are introduced to assist cache replacement. Cache hints are used to specify the cache level at which the data is stored after accessing it.
Xingyan Tian +3 more
openaire +1 more source
An Application-Aware Cache Replacement Policy for Last-Level Caches
2013Current day multicore processors employ multi-level cache hierarchy with one or two levels of private caches and a shared last-level cache (LLC). Efficient cache replacement policies at LLC are essential for reducing the off-chip memory traffic as well as contention for memory bandwidth.
Tripti S. Warrier +2 more
openaire +1 more source
Leverage cache replacement policy in multicore processors
2016 IEEE 12th International Conference on Intelligent Computer Communication and Processing (ICCP), 2016Computer hardware is currently moving towards heavily parallelized architectures with multiprocessors, multicore and chip multithreaded designs. Cache memory, the fastest component of the memory hierarchy, adapts to this new kind of parallel systems in order to provide the promised performance increase.
Marius Geanta +2 more
openaire +1 more source
Optimal Cache Replacement Policy for Matrix Multiplication
2013Matrix multiplication is compute intensive, memory demand and cache intensive algorithm. It performs O(N 3) operations, demands storing O(N 2) elements and accesses O(N) times each element, where N is the matrix size. Implementation of cache intensive algorithms can achieve speedups due to cache memory behavior if the algorithms frequently reuse the ...
Nenad Anchev +3 more
openaire +1 more source
Web cache replacement policies: a pragmatic approach
IEEE Network, 2006Research involving Web cache replacement policy has been active for at least a decade. In this-article we would like to claim that there is a sufficient number of good policies, and further proposals would only produce minute improvements. We argue that the focus should be fitness for purpose rather than proposing any new policies.
openaire +1 more source
Cache replacement policy based on server distance
2015 IFIP/IEEE International Symposium on Integrated Network Management (IM), 2015The transmission bandwidth consumed by delivering rich content is enormous, so it is urgent for Internet service providers to design an efficient delivery system that minimizes the amount of network resources consumed, i.e., minimizing the hop length of delivery flows.
Noriaki Kamiyama +2 more
openaire +1 more source
Performance evaluation of Web proxy cache replacement policies
Performance Evaluation, 1998Summary: The continued growth of the World-Wide Web and the emergence of new end-user technologies such as cable modems necessitate the use of proxy caches to reduce latency, network traffic and Web server loads. In this paper we analyze the importance of different Web proxy workload characteristics in making good cache replacement decisions.
Martin F. Arlitt +2 more
openaire +2 more sources