Compiler Auto-tuning through Multiple Phase Learning
Mingxuan Zhu, Dan Hao, Junjie Chen

TL;DR
This paper introduces CompTuner, a lightweight auto-tuning method that uses minimal runtime data and a particle swarm algorithm to efficiently optimize compiler flags, significantly improving performance over existing techniques.
Contribution
It proposes a novel, efficient auto-tuning approach combining a small data-driven prediction model with a particle swarm search to optimize compiler flags.
Findings
CompTuner outperforms five existing techniques including BOCA.
The approach reduces runtime cost of auto-tuning.
Experimental results show significant performance improvements.
Abstract
Widely used compilers like GCC and LLVM usually have hundreds of optimizations controlled by optimization flags, which are enabled or disabled during compilation to improve runtime performance (e.g., small execution time) of the compiler program. Due to the large number of optimization flags and their combination, it is difficult for compiler users to manually tune compiler optimization flags. In the literature, a number of auto-tuning techniques have been proposed, which tune optimization flags for a compiled program by comparing its actual runtime performance with different optimization flag combination. Due to the huge search space and heavy actual runtime cost, these techniques suffer from the widely-recognized efficiency problem. To reduce the heavy runtime cost, in this paper we propose a lightweight learning approach which uses a small number of actual runtime performance data to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsParallel Computing and Optimization Techniques · Cloud Computing and Resource Management · Ferroelectric and Negative Capacitance Devices
