A Feasibility Study in Iterative Compilation

Toru Kisuki, Peter M. W. Knijnenburg, Michael F. P. O'Boyle, François Bodin, Harry A. G. Wijshoff

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

In this paper we investigate the feasibility of iterative compilation in program optimisation. This technique enables compilers to deliver efficient code by searching for the best sequence of optimisations. In embedded systems, long compilation time can be afforded since the application is an integral part of the shipped product. However, in practice search spaces may be extremely large. Our experimental results show that in the case of large transformation spaces, near optimal transformations can be found by visiting only a small fraction of the entire search space by using a simple search algorithm.
Original languageEnglish
Title of host publicationHigh Performance Computing
Subtitle of host publicationSecond International Symposium, ISHPC'99 Kyoto, Japan, May 26–28, 1999 Proceedings
PublisherSpringer Berlin Heidelberg
Pages121-132
Number of pages12
ISBN (Electronic)978-3-540-48821-7
ISBN (Print)978-3-540-65969-3
DOIs
Publication statusPublished - 19 Oct 2006

Fingerprint Dive into the research topics of 'A Feasibility Study in Iterative Compilation'. Together they form a unique fingerprint.

Cite this