2013Unpublished venueRequires access

A Case-Based Reasoning Approach to Find Good Compiler Optimization Sequences

Ewerton Daniel de Lima, Anderson Faustino da Silva, Carlos Herrera

Open publisher page 2 citations

Abstract

Among several optimizations provided by an optimizing compiler, it is a challenge, even for the most expert programmer, to know which compiler optimizations will generate the best target code. The goal of this paper is to describe a case-based reasoning approach that automatically selects a compiler optimization sequence that is able to outperform a well-engineered compiler optimization level in terms of runtime. The results obtained by our approach indicate that it achieves improvement on a set of standard benchmarks over a well-engineered compiler optimization sequence.

About this research paper

What this paper is about

Among several optimizations provided by an optimizing compiler, it is a challenge, even for the most expert programmer, to know which compiler optimizations will generate the best target code. The goal of this paper is to describe a case-based reasoning approach that automatically selects a compiler optimization sequence that is able to outperform a well-engineered compiler optimization level in terms of runtime. The results obtained by our approach indicate that it achieves improvement on a set of standard benchmarks over a well-engineered compiler optimization sequence.

Why it matters

OpenAlex reports 2 citations for this work. Citation counts describe recorded attention and do not establish research quality.

Key contribution

A contribution statement is not available in the OpenAlex record.

Method / approach

Method details are not available in the OpenAlex metadata.

Main findings

Findings are not separately available in the OpenAlex metadata.

Limitations

Limitations are not available in the OpenAlex metadata.

Applications

Application details are not available in the OpenAlex metadata.

Available abstract

Among several optimizations provided by an optimizing compiler, it is a challenge, even for the most expert programmer, to know which compiler optimizations will generate the best target code. The goal of this paper is to describe a case-based reasoning approach that automatically selects a compiler optimization sequence that is able to outperform a well-engineered compiler optimization level in terms of runtime. The results obtained by our approach indicate that it achieves improvement on a set of standard benchmarks over a well-engineered compiler optimization sequence.

Key concepts: Compiler, Computer science, Optimizing compiler, Programmer, Interprocedural optimization, Compiler correctness, Programming language, Program optimization

Related papers

Back to paper searchBrowse research topicsOriginal source
A Case-Based Reasoning Approach to Find Good Compiler Optimization Sequences — Research Paper | ScholarLens