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.
|Title of host publication||High Performance Computing|
|Subtitle of host publication||Second International Symposium, ISHPC'99 Kyoto, Japan, May 26–28, 1999 Proceedings|
|Publisher||Springer Berlin Heidelberg|
|Number of pages||12|
|Publication status||Published - 19 Oct 2006|