A Quantitative Analysis of Tile Size Selection Algorithms

@article{Hsu2004AQA,
  title={A Quantitative Analysis of Tile Size Selection Algorithms},
  author={Chung-Hsing Hsu and Ulrich Kremer},
  journal={The Journal of Supercomputing},
  year={2004},
  volume={27},
  pages={279-294}
}
Loop tiling is an effective optimizing transformation to boost the memory performance of a program, especially for dense matrix scientific computations. The magnitude and stability of the achieved performance improvements are heavily dependent on the appropriate selection of tile sizes. Many existing tile selection algorithms try to find tile sizes which eliminate self-interference cache conflict misses, maximize cache utilization, and minimize cross-interference cache conflict misses. These… CONTINUE READING
BETA

Citations

Publications citing this paper.
SHOWING 1-10 OF 21 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 37 REFERENCES

Similar Papers

Loading similar papers…