ACM Home Page
Please provide us with feedback. Feedback
Fast compiler optimisation evaluation using code-feature based performance prediction
Full text PdfPdf (410 KB)
Source
Conference On Computing Frontiers archive
Proceedings of the 4th international conference on Computing frontiers table of contents
Ischia, Italy
SESSION: Software for high-performance systems table of contents
Pages: 131 - 142  
Year of Publication: 2007
ISBN:978-1-59593-683-7
Authors
Christophe Dubach  University of Edinburgh, Edinburgh, United Kingdom
John Cavazos  University of Edinburgh, Edinburgh, United Kingdom
Björn Franke  University of Edinburgh, Edinburgh, United Kingdom
Grigori Fursin  INRIA Futurs and LRI: Paris-Sud University, Paris, France
Michael F.P. O'Boyle  University of Edinburgh, Edinburgh, United Kingdom
Olivier Temam  INRIA Futurs and LRI: Paris-Sud University, Paris, France
Sponsors
ACM: Association for Computing Machinery
SIGMICRO: ACM Special Interest Group on Microarchitectural Research and Processing
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 7,   Downloads (12 Months): 87,   Citation Count: 1
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Review this Article  
Save this Article to a Binder    Display Formats: BibTex  EndNote ACM Ref   
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1242531.1242553
What is a DOI?

ABSTRACT

Performance tuning is an important and time consuming task which may have to be repeated for each new application and platform. Although iterative optimisation can automate this process, it still requires many executions of different versions of the program. As execution time is frequently the limiting factor in the number of versions or transformed programs that can be considered, what is needed is a mechanism that can automatically predict the performance of a modified program without actually having to run it. This paper presents a new machine learning based technique to automatically predict the speedup of a modified program using a performance model based on the code features of the tuned programs. Unlike previous approaches it does not require any prior learning over a benchmark suite. Furthermore, it can be used to predict the performance of any tuning and is not restricted to a prior seen trans-formation space. We show that it can deliver predictions with a high correlation coefficient and can be used to dramatically reduce the cost of search.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
2
 
3
BISHOP, C. Neural Networks for Pattern Recognition. Oxford University Press, 2005.
4
5
 
6
COOPER, K., GROSUL, A., HARVEY, T., REEVES, S., SUBRAMANIAN, D., TORCZON, L., AND WATERMAN, T. Searching for compilation sequences. Tech. rep., Rice University, 2005.
7
8
9
 
10
FURSIN, G., COHEN, A., O'BOYLE, M., AND TEMAM, O. A practical method for quickly evaluating program optimizations. In Proceedings of the 1st International Conference on High Performance Embedded Architectures & Compilers (HiPEAC) (2005), pp. 29--46.
 
11
FURSIN, G., O'BOYLE, M., AND KNIJNENBURG, P. Evaluating iterative compilation. In Proceedings of the 15th Workshop on Languages and Compilers for Parallel Computers (LCPC) (2002), pp. 305--315.
 
12
13
14
15
16
 
17
LEE, C. Utdsp benchmark suite. In http://www.eecg.toronto.edu/~corinna/DSP/infrastructure/UTDSP.html (1998).
 
18
19
 
20
SAGHIR, M., CHOW, P., AND LEE, C. A comparison of traditional and vliw dsp architecture for compiled dsp applications. In Proceedings of the International Workshop on Compiler and Architecture Support for Embedded Systems (CASES) (1998).
 
21
 
22
23
24


Collaborative Colleagues:
Christophe Dubach: colleagues
John Cavazos: colleagues
Björn Franke: colleagues
Grigori Fursin: colleagues
Michael F.P. O'Boyle: colleagues
Olivier Temam: colleagues