Authors: Shun Long, Grigori Fursin
Addresses: Department of Computer Science, JiNan University, Guangzhou 510632, PR China. ' INRIA Saclay, Parc Club Orsay Universite, 91893 Orsay Cedex, France
Abstract: Modern compilers have limited ability to exploit the performance improvement potential of complex transformation compositions due to their ad-hoc nature. Unified Transformation Framework (Kelly and Pugh, 1993a) provides a unified representation of different iteration reordering transformations. It results in a large and complex space to explore. This paper presents a heuristic search algorithm capable of efficiently locating good optimisations within this space. Preliminary experimental results on Java show that it can achieve an average speedup of 1.14 and 1.10 on two different platforms, and more than 75% of the maximum performance available can be obtained within 20 evaluations.
Keywords: iterative compilation; adaptive optimisation; UTF; unified transformation framework; Java; optimisation space; heuristic search; iteration reordering transformations.
International Journal of Computational Science and Engineering, 2009 Vol.4 No.2, pp.102 - 111
Published online: 12 Jul 2009 *Full-text access for editors Access for subscribers Purchase this article Comment on this article