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.
This research was partially supported by the ESPRIT IV reactive LTR project OCEANS, under contract number 22729.
This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
B. Aarts, M. Barreteau F. Bodin, P. Brinkhaus, Z. Chamski, H.-P., Charles, C. Eisenbeis, J. Gurd, J. Hoogerbrugge, P. Hu, W. Jalby, P.M.W. Knijnenburg, M.F.P. O'Boyle, E. Rohou., R. Sakellariou, H. Schepers, A. Seznec, E. Stöhr, M. Verhoeven, and H.A.G. Wijshoff. OCEANS: Optimizing compilers for embedded applications. In Proc. Euro-Par 97, volume 1300 of Lecture Notes in Computer Science, pages 1351–1356, 1997.
M. Barreteau, F. Bodin, P. Brinkhaus, Z. Chamski, H.-P. Charles, C. Eisenbeis J. Gurd, J. Hoogerbrugge, P. Hu, W. Jalby, P.M.W. Knijnenburg, M.F.P. O'Boyle, E. Rohou, R. Sakellariou, A. Seznec, A. Stöhr, M. Treffers, and H.A.G. Wijshoff. OCEANS: Optimizing compilers for embedded applications. In Proc. Euro-Par 98. volume 1470 of Lecture Notes in Computer Science, pages 1123–1130, 1998.
J. Bilmes, K. Asanović, C.W. Chim, and J. Demmel. Optimizing matrix multiply using PHiPAC: A portable, high-performance, ANSI C coding methodology. In Proc. ICS'97, pages 340–347, 1997.
F. Bodin, Z. Chamski, C. Eisenbeis, E. Rohou, and A. Seznec. GCDS: A compiler strategy for trading code size against performance in embedded applications. Technical Report 1153, IRISA, Rennes, 1997.
F. Bodin, T. Kisuki, P.M.W. Knijnenburg, M.F.P. O'Boyle, and E. Rohou, Iterative compilation in a non-linear optimisation space. In Proc. Workshop on Profile and Feedback Directed Compilation, pages Bodin et al. 1–10, 1998. Organised in conjuction with PACT'98.
S. Coleman and K. McKinley. Tile size selection using cache organization and data layout. In Proc. Programming Language Design and Implementation, 1995.
A.M. Turing. On computable numbers, with an application to the Entscheidungsproblem. Proc. London Mathematical Society, 2(42):230–265, 1936.
R.C. Whaley and J.J. Dongarra. Automatically tuned linear algebra software. Available through http://www.netlib.org/atlas/1998.
M.E. Wolf, D.E. Maydan, and D.-K. Chen. Combining, loop transformations considering caches and scheduling. Int'l. J. of Parallel Programming, 26(4):479–503, 1998.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1999 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kisuki, T., Knijnenburg, P.M.W., O'Boyle, M.F.P., Bodin, F., Wijshoff, H.A.G. (1999). A feasibility study in iterative compilation. In: Polychronopoulos, C., Fukuda, K.J.A., Tomita, S. (eds) High Performance Computing. ISHPC 1999. Lecture Notes in Computer Science, vol 1615. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0094916
Download citation
DOI: https://doi.org/10.1007/BFb0094916
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-65969-3
Online ISBN: 978-3-540-48821-7
eBook Packages: Springer Book Archive