Nick Mitchell5
, Larry Carter6
and Jeanne Ferrante7 
| (5) |
IBM T.J. Watson Research Center, 30 Saw Mill River Road, Hawthorne, NY 10532, USA |
| (6) |
San Diego and San Diego Supercomputing Center, University of California, California |
| (7) |
University of California, San Diego |
Abstract
We consider the problem of automatically guiding program transformations for locality, despite incomplete information due
to complicated program structures, changing target architectures, and lack of knowledge of the properties of the input data.
Our system, the modal model of memory, uses limited static analysis and bounded runtime experimentation to produce performance formulas that can be used to make
runtime locality transformation decisions. Static analysis is performed once per program to determine its memory reference
properties, using modes, a small set of parameterized, kernel reference patterns. Once per architectural system, our system automatically performs
a set of experiments to determine a family of kernel performance formulas. The system can use these kernel formulas to synthesize
a performance formula for any program’s mode tree. Finally, with program transformations represented as mappings between mode
trees, the generated performance formulas can be used to guide transformation decisions.
Keywords performance - model - cache - profiling - modal
Contact author: Nick Mitchell, who was funded by an Intel Graduate Fellowship, 1999-2000. In addition this work was funded
by NSF grant CCR-9808946. Equipment used in this research was supported in part by the UCSD Active Web Project, NSF Research
Infrastructure Grant Number 9802219.
References secured to subscribers.