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

Optimizing Program Locality Through CMEs and GAs

Fulltext:


Authors:

Xavier Vera, Jaume Abella , Antonio Gonzalez , Josep Llosa

Publication Type:

Conference/Workshop Paper

Venue:

12th International Conference on Parallel Architectures and CompilationTechniques (PACT)

Publisher:

IEEE


Abstract

Caches have become increasingly important with the widening gap between main memory and processor speeds. Small and fast cache memories are designed to bridge this discrepancy. However, they are only effective when programs exhibit sufficient data locality.Performance of memory hierarchy can be improved by means of data and loop transformations. Tiling is a loop transformation that aims at reducing capacity misses by exploiting reuse at the lower levels of cache. Padding is a data transformation targeted to reduce conflict misses.This paper presents an accurate cost model which makes use of the Cache Miss Equations (CMEs) to guide tiling and padding transformations. It describes misses across different hierarchy levels and considers the effects of other hardware components such as branch predictors. We combine the cost model with a genetic algorithm (GA) to select the tile and pad factors that enhance the program.Our results show that this scheme is useful to optimize programs performance. When compared to previous works, we observe that with a reasonable compile-time overhead, our approach obtains significant performance improvements for all studied kernels on a variety of architectures.

Bibtex

@inproceedings{Vera465,
author = {Xavier Vera and Jaume Abella and Antonio Gonzalez and Josep Llosa},
title = {Optimizing Program Locality Through CMEs and GAs},
month = {September},
year = {2003},
booktitle = {12th International Conference on Parallel Architectures and CompilationTechniques (PACT)},
publisher = {IEEE},
url = {http://www.es.mdu.se/publications/465-}
}