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 Padding for Removing Conflict Misses

Fulltext:


Authors:

Xavier Vera, Josep Llosa , Antonio Gonzalez

Publication Type:

Conference/Workshop Paper

Venue:

Languages and Compilers for Parallel Computers (LCPC02)

Publisher:

LNCS - Springer Verlag


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 padding, which is a code transformation targeted to reduce conflict misses. This paper presents a novel approach to perform near-optimal padding for multi-level caches. It analyzes programs, detecting conflict misses by means of the Cache Miss Equations. A genetic algorithm is used to compute the parameter values that enhance the program. Our results show that it can remove practically all conflicts among variables in the SPECfp95, targeting all the different cache levels simultaneously.

Bibtex

@inproceedings{Vera364,
author = {Xavier Vera and Josep Llosa and Antonio Gonzalez},
title = {Near-Optimal Padding for Removing Conflict Misses},
editor = {C.-W. Tseng},
month = {July},
year = {2002},
booktitle = {Languages and Compilers for Parallel Computers (LCPC02)},
publisher = {LNCS - Springer Verlag},
url = {http://www.es.mdu.se/publications/364-}
}