Skip to main navigation Skip to search Skip to main content

Automatic static feature generation for compiler optimization problems

Research output: Chapter in Book/Report/Conference proceedingConference contributionpeer-review

1 Scopus citations

Abstract

Modern compilers have many optimization passes which help to get a better binary code for a given program. These optimizations are NP-hard. People use different heuristics to get a near optimal solution. These heuristics are designed by a compiler expert after examining sample programs. This is a challenging task. Recently, people have used machine learning techniques instead of heuristics for compiler optimizations. Machine learning techniques have not only eliminated the human efforts but have also out-performed human made huristics. However, the human efforts have now been moved from creating heuristics to selecting good features. Selecting right set of features is important for machine learning techniques since no machine learning tool will work well with poorly choosen features. This paper introduces a noval approach to generate features for machine learning for compiler optimization problems with out any human involvement.

Original languageEnglish
Title of host publicationAI 2011
Subtitle of host publicationAdvances in Artificial Intelligence - 24th Australasian Joint Conference, Proceedings
Pages769-778
Number of pages10
DOIs
StatePublished - 2011
Event24th Australasian Joint Conference on Artificial Intelligence, AI 2011 - Perth, WA, Australia
Duration: Dec 5 2011Dec 8 2011

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume7106 LNAI
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference24th Australasian Joint Conference on Artificial Intelligence, AI 2011
Country/TerritoryAustralia
CityPerth, WA
Period12/5/1112/8/11

Fingerprint

Dive into the research topics of 'Automatic static feature generation for compiler optimization problems'. Together they form a unique fingerprint.

Cite this