Current split data caches classify data as having either spatial locality or temporal locality. The cache usually comprises two subcaches with each subcache being used to cache one type of data. More precisely, however, data can exhibit not only temporal or spatial locality, but also both localities, or no locality. Current split data caches do not take advantages of this more precise characterization. In addition, runtime locality change is not supported completely by current split data caches, leading to lower system performance. This thesis presents a new data classification method which divides data into five types in terms of the locality they present. A new kind of split data cache, called the OST cache, which has three subcac...
Abstract Caches are widely used to reduce the speed gap between processors and memories. However, th...
Treating data based on its location in memory has received much attention in recent years due to its...
This paper studies the theory of caching and temporal and spatial locality. We show the following re...
Current split data caches classify data as having either spatial locality or temporal locality. The...
The purpose of this paper is to reevaluate the performance of the Split Temporal/Spatial (STS) cache...
The performance of cache memories relies on the locality exhibited by programs. Traditionally this l...
Since the introduction of cache memories in computer architecture, techniques to improve the data lo...
The widening gap between the processor clock speed and the memory latency puts an added pressure on ...
This paper shows that even very small reconfigurable data caches, when split to serve data streams ...
The widening gap between processor and memory speeds renders data locality optimization a very impor...
Applications often under-utilize cache space and there are no software locality optimization techniq...
Data locality is central to modern computer designs. The widening gap between processor speed and me...
Emerging computer architectures will feature drastically decreased flops/byte (ratio of peak process...
Caches are widely used to reduce the speed gap between processors and memories. However, the spatial...
Next generation multicore applications will process massive amounts of data with significant sharing...
Abstract Caches are widely used to reduce the speed gap between processors and memories. However, th...
Treating data based on its location in memory has received much attention in recent years due to its...
This paper studies the theory of caching and temporal and spatial locality. We show the following re...
Current split data caches classify data as having either spatial locality or temporal locality. The...
The purpose of this paper is to reevaluate the performance of the Split Temporal/Spatial (STS) cache...
The performance of cache memories relies on the locality exhibited by programs. Traditionally this l...
Since the introduction of cache memories in computer architecture, techniques to improve the data lo...
The widening gap between the processor clock speed and the memory latency puts an added pressure on ...
This paper shows that even very small reconfigurable data caches, when split to serve data streams ...
The widening gap between processor and memory speeds renders data locality optimization a very impor...
Applications often under-utilize cache space and there are no software locality optimization techniq...
Data locality is central to modern computer designs. The widening gap between processor speed and me...
Emerging computer architectures will feature drastically decreased flops/byte (ratio of peak process...
Caches are widely used to reduce the speed gap between processors and memories. However, the spatial...
Next generation multicore applications will process massive amounts of data with significant sharing...
Abstract Caches are widely used to reduce the speed gap between processors and memories. However, th...
Treating data based on its location in memory has received much attention in recent years due to its...
This paper studies the theory of caching and temporal and spatial locality. We show the following re...