Diagnosing Compiler Performance by Comparing Optimization Decisions

Abstract:

Modern compilers apply a set of optimization passes aiming to speed up the generated code. The combined effect of individual optimizations is difficult to predict. Thus, changes to a compiler's code may hinder the performance of generated code as an unintended consequence. Performance regressions in compiled code are often related to misapplied optimizations. The regressions are hard to investigate, considering the vast number of compilation units and applied optimizations. A compilation unit consists of a root method and inlined methods. Thus, a method may be part of several compilation units and may be optimized differently in each. Moreover, inlining decisions are not invariant across runs of the virtual machine (VM). We propose to solve the problem of diagnosing performance regressions by capturing the compiler's optimization decisions. We do so by representing the applied optimization phases, optimization decisions, and inlining decisions in the form of trees. This paper introduces an approach utilizing tree edit distance (TED) to detect optimization differences in a semi-automated way. We present an approach to compare optimization decisions in differently inlined methods. We employ these techniques to pinpoint the causes of performance problems in various benchmarks of the Graal compiler.

BibTeX:

@inproceedings{pecimuth_diagnosing_2023,
    title = {{Diagnosing Compiler Performance by Comparing Optimization Decisions}},
    author = {Pečimú th, Andrej and Leopoldseder, David and Tůma, Petr},
    year = {2023},
    booktitle = {{Proceedings of the 20th ACM SIGPLAN International Conference on Managed Programming Languages and Runtimes}},
    publisher = {ACM},
    location = {New York, NY, USA},
    doi = {10.1145/3617651.3622994},
    isbn = {979-8-4007-0380-5/23/10},
    url = {https://doi.org/10.1145/3617651.3622994},
}

Proceedings paper