The visualization tool rdvis is presented which aims at helping the programmer to find program transformations to improve temporal data locality. We present a number of locality metrics that capture the necessary information. Based on a cluster analysis of basic block vectors, the tool gives strong hints on which program transformations are needed. The visualizer allowed us to find the necessary transformations for three SPEC2000 programs in just a few minutes. After performing these transformations, the programs run 3 times faster on average on a number of different platforms
In most computer systems, page fault rate is currently minimized by generic page replacement algorit...
In the past decade, processor speed has become significantly faster than memory speed. Small, fast c...
Suggestions for locality optimizations (SLO), a cache profiling tool, analyzes runtime reuse paths t...
The visualization tool rdvis is presented which aims at helping the programmer to find program trans...
Due to the huge speed gaps in the memory hierarchy of modern computer architectures, it is important...
Many programs execution speed suffer from cache misses. These can be reduced on three different leve...
For many applications, cache misses are the primary performance bottleneck. Even though much researc...
This paper presents a tool based on a new approach for analyzing the locality exhibited by data memo...
The growing memory wall requires that more attention is given to the data cache behavior of programs...
In the past decade, processor speed has become significantly faster than memory speed. Small, fast c...
Cache memory design in embedded systems can take advantage from the analysis of the software that ru...
Data locality is central to modern computer designs. The widening gap between processor speed and me...
Over the past decades, core speeds have been improving at a much higher rate than memory bandwidth. ...
Numerical software for sequential or parallel machines with memory hierarchies can benefit from loca...
In memory hierarchies, programs can be speeded up by increasing their degree of locality. This paper...
In most computer systems, page fault rate is currently minimized by generic page replacement algorit...
In the past decade, processor speed has become significantly faster than memory speed. Small, fast c...
Suggestions for locality optimizations (SLO), a cache profiling tool, analyzes runtime reuse paths t...
The visualization tool rdvis is presented which aims at helping the programmer to find program trans...
Due to the huge speed gaps in the memory hierarchy of modern computer architectures, it is important...
Many programs execution speed suffer from cache misses. These can be reduced on three different leve...
For many applications, cache misses are the primary performance bottleneck. Even though much researc...
This paper presents a tool based on a new approach for analyzing the locality exhibited by data memo...
The growing memory wall requires that more attention is given to the data cache behavior of programs...
In the past decade, processor speed has become significantly faster than memory speed. Small, fast c...
Cache memory design in embedded systems can take advantage from the analysis of the software that ru...
Data locality is central to modern computer designs. The widening gap between processor speed and me...
Over the past decades, core speeds have been improving at a much higher rate than memory bandwidth. ...
Numerical software for sequential or parallel machines with memory hierarchies can benefit from loca...
In memory hierarchies, programs can be speeded up by increasing their degree of locality. This paper...
In most computer systems, page fault rate is currently minimized by generic page replacement algorit...
In the past decade, processor speed has become significantly faster than memory speed. Small, fast c...
Suggestions for locality optimizations (SLO), a cache profiling tool, analyzes runtime reuse paths t...