Many replacement and prefetching policies have recently been proposed for buffer cache management. However, many real operating systems, including GNU/Linux, generally use the simple Least Recently Used (LRU) replacement policy with prefetching being employed in special situations such as when sequentiality is detected. In this paper, we propose the SAW 2R scheme that integrates buffer management and prefetching, where prefetching is done constantly in aggressive fashion. The scheme is simple to implement making it a feasible solution in real systems. In its basic form, for buffer replacement, it uses the LRU policy. However, its modular design allows for any replacement policy to be incorporated into the scheme. For prefetching, it uses th...
The growing performance gap caused by high processor clock rates and slow DRAM accesses makes cache ...
A spectrum of block replacement policies called LRFU (Least Recently/Frequently Used) is proposed fo...
Abstract—While many block replacement algorithms for buffer caches have been proposed to address the...
Buffer caching is an integral part of the operating system. In this paper, we propose a scheme that ...
In traditional file system implementations, the Least Recently Used (LRU) block replacement scheme i...
In traditional file system implementations, the Least Recently Used (LRU) block replacement scheme i...
High performance processors employ hardware data prefetching to reduce the negative performance impa...
The full text of this article is not available on SOAR. WSU users can access the article via IEEE Xp...
A common mechanism to perform hardware-based prefetching for regular accesses to arrays and chained...
Data prefetching is an effective technique to hide memory latency and thus bridge the increasing pro...
We introduce Selfish-LRU, a variant of the LRU (least recently used) cache replacement policy that i...
Part 6: Poster SessionsInternational audienceThis paper presents a new access-density-based prefetch...
Task-based dataflow programming models and runtimes em-erge as promising candidates for programming ...
We propose an efficient buffer management method for Cachet [7], called BCachet. Cachet is an adapti...
Although file caching and prefetching are known techniques to improve the performance of file system...
The growing performance gap caused by high processor clock rates and slow DRAM accesses makes cache ...
A spectrum of block replacement policies called LRFU (Least Recently/Frequently Used) is proposed fo...
Abstract—While many block replacement algorithms for buffer caches have been proposed to address the...
Buffer caching is an integral part of the operating system. In this paper, we propose a scheme that ...
In traditional file system implementations, the Least Recently Used (LRU) block replacement scheme i...
In traditional file system implementations, the Least Recently Used (LRU) block replacement scheme i...
High performance processors employ hardware data prefetching to reduce the negative performance impa...
The full text of this article is not available on SOAR. WSU users can access the article via IEEE Xp...
A common mechanism to perform hardware-based prefetching for regular accesses to arrays and chained...
Data prefetching is an effective technique to hide memory latency and thus bridge the increasing pro...
We introduce Selfish-LRU, a variant of the LRU (least recently used) cache replacement policy that i...
Part 6: Poster SessionsInternational audienceThis paper presents a new access-density-based prefetch...
Task-based dataflow programming models and runtimes em-erge as promising candidates for programming ...
We propose an efficient buffer management method for Cachet [7], called BCachet. Cachet is an adapti...
Although file caching and prefetching are known techniques to improve the performance of file system...
The growing performance gap caused by high processor clock rates and slow DRAM accesses makes cache ...
A spectrum of block replacement policies called LRFU (Least Recently/Frequently Used) is proposed fo...
Abstract—While many block replacement algorithms for buffer caches have been proposed to address the...