Fast, effective code generation in a just-in-time Java compiler
PLDI '98 Proceedings of the ACM SIGPLAN 1998 conference on Programming language design and implementation
Optimizing compilers for modern architectures: a dependence-based approach
Optimizing compilers for modern architectures: a dependence-based approach
Machine Learning
Java Performance Tuning
A Feasibility Study in Iterative Compilation
ISHPC '99 Proceedings of the Second International Symposium on High Performance Computing
Proceedings of the 2002 ACM/IEEE conference on Supercomputing
Compiler optimization-space exploration
Proceedings of the international symposium on Code generation and optimization: feedback-directed and runtime optimization
Adaptive java optimisation using instance-based learning
Proceedings of the 18th annual international conference on Supercomputing
Statistical Selection of Compiler Options
MASCOTS '04 Proceedings of the The IEEE Computer Society's 12th Annual International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems
Probabilistic source-level optimisation of embedded programs
LCTES '05 Proceedings of the 2005 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
A practical method for quickly evaluating program optimizations
HiPEAC'05 Proceedings of the First international conference on High Performance Embedded Architectures and Compilers
Evaluating iterative compilation
LCPC'02 Proceedings of the 15th international conference on Languages and Compilers for Parallel Computing
Iterative Optimization in the Polyhedral Model: Part I, One-Dimensional Time
Proceedings of the International Symposium on Code Generation and Optimization
Iterative optimization in the polyhedral model: part ii, multidimensional time
Proceedings of the 2008 ACM SIGPLAN conference on Programming language design and implementation
| Hi-index | 0.00 |
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.