Iterative compilation in a non-linear optimisation space

Abstract : This paper investigates the applicability of iterative search techniques in program optimisation. Iterative compilation is usually considered too expensive for general purpose computing but is applicable to embedded applications where the cost is easily amortised over the number of embedded systems produced. This paper presents a case study, where an iterative search algorithm is used to investigate a nonlinear transformation space and find the fastest execution time within a fixed number of evaluations. By using execution time as feedback, it searches a large but restricted transformation space and shows performance improvement over existing approaches. We showthat in the case of large transformation spaces, we can achieve within 0.3% of the best possible time by visiting less then 0.25% of the space using a simple algorithm and find the minimum after visiting less than 1% of the space.
Type de document :
Communication dans un congrès
Workshop on Profile and Feedback-Directed Compilation, Oct 1998, Paris, France. 1998
Liste complète des métadonnées

Littérature citée [6 références]  Voir  Masquer  Télécharger

https://hal.inria.fr/inria-00475919
Contributeur : Erven Rohou <>
Soumis le : vendredi 23 avril 2010 - 12:17:48
Dernière modification le : vendredi 16 novembre 2018 - 01:30:10
Document(s) archivé(s) le : mardi 28 septembre 2010 - 12:32:29

Fichier

iterative.pdf
Fichiers produits par l'(les) auteur(s)

Identifiants

  • HAL Id : inria-00475919, version 1

Collections

Citation

François Bodin, Toru Kisuki, Peter Knijnenburg, Mike O' Boyle, Erven Rohou. Iterative compilation in a non-linear optimisation space. Workshop on Profile and Feedback-Directed Compilation, Oct 1998, Paris, France. 1998. 〈inria-00475919〉

Partager

Métriques

Consultations de la notice

541

Téléchargements de fichiers

317