Orthogonal Latin squares: an application of experiment design to compiler testing
Communications of the ACM
Approximations for the maximum acyclic subgraph problem
Information Processing Letters
The AETG System: An Approach to Testing Based on Combinatorial Design
IEEE Transactions on Software Engineering
`` Direct Search'' Solution of Numerical and Statistical Problems
Journal of the ACM (JACM)
Nonlinear regression and the solution of simultaneous equations
Communications of the ACM
Computer Methods for Mathematical Computations
Computer Methods for Mathematical Computations
Adaptive Optimizing Compilers for the 21st Century
The Journal of Supercomputing
IEEE Concurrency
IEEE Concurrency
In-Parameter-Order: A Test Generation Strategy for Pairwise Testing
HASE '98 The 3rd IEEE International Symposium on High-Assurance Systems Engineering
Fast searches for effective optimization phase sequences
Proceedings of the ACM SIGPLAN 2004 conference on Programming language design and implementation
Finding effective compilation sequences
Proceedings of the 2004 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
Statistical Models for Empirical Search-Based Performance Tuning
International Journal of High Performance Computing Applications
Queue - Multiprocessors
Exhaustive Optimization Phase Order Space Exploration
Proceedings of the International Symposium on Code Generation and Optimization
Fast and Effective Orchestration of Compiler Optimizations for Automatic Performance Tuning
Proceedings of the International Symposium on Code Generation and Optimization
Exploring the structure of the space of compilation sequences using randomized search algorithms
The Journal of Supercomputing
Rapidly Selecting Good Compiler Optimizations using Performance Counters
Proceedings of the International Symposium on Code Generation and Optimization
On the Advantage over Random for Maximum Acyclic Subgraph
FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
A Framework for Exploring Optimization Properties
CC '09 Proceedings of the 18th International Conference on Compiler Construction: Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2009
Analytic models and empirical search: a hybrid approach to code optimization
LCPC'05 Proceedings of the 18th international conference on Languages and Compilers for Parallel Computing
| Hi-index | 0.00 |
Most compilers apply optimizations in a fixed order regardless of input programs. However, it is well known that optimizations can have enabling, and disabling interactions or equivalent effects. The effects of interference are program specific and hence no single sequence is universally appropriate for all input programs. In this paper we explore the problem of searching for optimal sequences of compiler optimizations to apply for a given program and describe novel strategies that bring us a step closer to searching this problem space efficiently. We also construct models for accurately predicting the runtime performance of a program when a sequence of optimizations is applied to it. The early results of the models on a small set of input programs are encouraging and suggest that the approaches we describe are worthy of further consideration.