You are required to read and agree to the below before accessing a full-text version of an article in the IDE article repository.

The full-text document you are about to access is subject to national and international copyright laws. In most cases (but not necessarily all) the consequence is that personal use is allowed given that the copyright owner is duly acknowledged and respected. All other use (typically) require an explicit permission (often in writing) by the copyright owner.

For the reports in this repository we specifically note that

  • the use of articles under IEEE copyright is governed by the IEEE copyright policy (available at http://www.ieee.org/web/publications/rights/copyrightpolicy.html)
  • the use of articles under ACM copyright is governed by the ACM copyright policy (available at http://www.acm.org/pubs/copyright_policy/)
  • technical reports and other articles issued by M‰lardalen University is free for personal use. For other use, the explicit consent of the authors is required
  • in other cases, please contact the copyright owner for detailed information

By accepting I agree to acknowledge and respect the rights of the copyright owner of the document I am about to access.

If you are in doubt, feel free to contact webmaster@ide.mdh.se

Near-Optimal Tiling by means of Cache Miss Equations and Genetic Algorithms

Fulltext:


Authors:

Jaume Abella , Antonio Gonzalez , Josep Llosa , Xavier Vera

Publication Type:

Conference/Workshop Paper

Venue:

Compile/Runtime Techniques for Parallel Computing (CRTPC)

Publisher:

IEEE


Abstract

The effectiveness of the memory hierarchy is critical for the performance of current processors. The performance of the memory hierarchy can be improved by means of program transformations such as loop tiling, which is a code transformation targeted to reduce capacity misses. This paper presents a novel systematic approach to perform near-optimal loop tiling based on an accurate data locality analysis (Cache Miss Equations) and a powerful technique to search the solution space that is based on a genetic algorithm. The results show that this approach can remove practically all capacity misses for all considered benchmarks. The reduction of replacement misses results in a decrease of the miss ratio that can be as significant as a factor of 7 for the matrix multiply kernel.

Bibtex

@inproceedings{Abella340,
author = {Jaume Abella and Antonio Gonzalez and Josep Llosa and Xavier Vera},
title = {Near-Optimal Tiling by means of Cache Miss Equations and Genetic Algorithms},
month = {August},
year = {2002},
booktitle = {Compile/Runtime Techniques for Parallel Computing (CRTPC)},
publisher = {IEEE},
url = {http://www.es.mdu.se/publications/340-}
}