Cooperative caching seeks to improve memory system performance by using compiler locality hints to assist hardware cache decisions. In this paper, the compiler suggests cache lines to keep or evict in setassociative caches. A compiler analysis predicts data that will be and will not be reused, and annotates the corresponding memory operations with a keep-me or evict-me hint. The architecture maintains these hints on a cache line and only acts on them on a cache miss. Evict-me caching prefers to evict lines marked evictme. Keep-me caching retains keep-me lines if possible. Otherwise, the default replacement algorithm evicts the least-recently-used (LRU) line in the set. This paper introduces the keep-me hint, the associated compiler analysis...
The performance of cache memories relies on the locality exhibited by programs. Traditionally this l...
In this paper, we present compiler algorithms for detecting references to stale data in sharedmemory...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 2014.On most modern computers, ...
The memory system remains a major performance bottleneck in modern and future architectures. In this...
Set-associative caches are traditionally managed using hardwarebased lookup and replacement schemes ...
In this paper, an efficient technique is proposed to manage the cache memory. The proposed technique...
The memory system remains a major performance bottleneck in modern and future architectures. In this...
The cache interference is found to play a critical role in optimizing cache allocation among concurr...
AbstractCurrently the most widely used replacement policy in the last cache is the LRU algorithm. Po...
We address the problem of improving cache predictability and performance in embedded systems through...
The goal of cache management is to maximize data reuse. Collaborative caching provides an interface ...
This dissertation focuses on caching in distributed file systems, where the performance is constrain...
We introduce a new organization for multi-bank caches: the skewed-associative cache. A two-way skewe...
We introduce a new organization for multi-bank caches: the skewed-associative cache. A two-way skewe...
In this paper we propose a technique that uses an ad-ditional mini cache located between the I-Cache...
The performance of cache memories relies on the locality exhibited by programs. Traditionally this l...
In this paper, we present compiler algorithms for detecting references to stale data in sharedmemory...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 2014.On most modern computers, ...
The memory system remains a major performance bottleneck in modern and future architectures. In this...
Set-associative caches are traditionally managed using hardwarebased lookup and replacement schemes ...
In this paper, an efficient technique is proposed to manage the cache memory. The proposed technique...
The memory system remains a major performance bottleneck in modern and future architectures. In this...
The cache interference is found to play a critical role in optimizing cache allocation among concurr...
AbstractCurrently the most widely used replacement policy in the last cache is the LRU algorithm. Po...
We address the problem of improving cache predictability and performance in embedded systems through...
The goal of cache management is to maximize data reuse. Collaborative caching provides an interface ...
This dissertation focuses on caching in distributed file systems, where the performance is constrain...
We introduce a new organization for multi-bank caches: the skewed-associative cache. A two-way skewe...
We introduce a new organization for multi-bank caches: the skewed-associative cache. A two-way skewe...
In this paper we propose a technique that uses an ad-ditional mini cache located between the I-Cache...
The performance of cache memories relies on the locality exhibited by programs. Traditionally this l...
In this paper, we present compiler algorithms for detecting references to stale data in sharedmemory...
Thesis (Ph. D.)--University of Rochester. Dept. of Computer Science, 2014.On most modern computers, ...