Evolving compiler heuristics to manage communication and contention

M Taylor, K Coons, B Robatmili, B Maher… - Proceedings of the …, 2010 - ojs.aaai.org
Proceedings of the AAAI Conference on Artificial Intelligence, 2010ojs.aaai.org
As computer architectures become increasingly complex, hand-tuning compiler heuristics
becomes increasingly tedious and time consuming for compiler developers. This paper
presents a case study that uses a genetic algorithm to learn a compiler policy. The target
policy implicitly balances communication and contention among processing elements of the
TRIPS processor, a physically realized prototype chip. We learn specialized policies for
individual programs as well as general policies that work well across all programs. We also …
Abstract
As computer architectures become increasingly complex, hand-tuning compiler heuristics becomes increasingly tedious and time consuming for compiler developers. This paper presents a case study that uses a genetic algorithm to learn a compiler policy. The target policy implicitly balances communication and contention among processing elements of the TRIPS processor, a physically realized prototype chip. We learn specialized policies for individual programs as well as general policies that work well across all programs. We also employ a two-stage method that first classifies the code being compiled based on salient characteristics, and then chooses a specialized policy based on that classification.
ojs.aaai.org
Showing the best result for this search. See all results