“An example optimization found: do { if (*--p == '.') *p = '_'; } while (p != name); originally became these AVX-2 instructions: %1 = shufflevector %0, <31, 30, 29,..., 0> %2 = icmp eq %1, <46, 46, 46,..., 46> %3 = shufflevector %2, <31, 30, 29,..., 0> Minotaur instead produced: %1 = icmp eq %0, <46, 46, 46,..., 46> Both compare the regi…”
Minotaur: A SIMD-Oriented Synthesizing Superoptimizer
A superoptimizing compiler--one that performs a meaningful search of the program space as part of the optimization process--can find optimization opportunities that are missed by even the best existing optimizing compilers. We created Minotaur: a superoptimizer for LLVM that uses program synthesis to improve its code generation, focusing on integer and floating-point SIMD code. On an Intel Cascade Lake processor, Minotaur achieves an average speedup of 7.3\% on the GNU Multiple Precision library (GMP)'s benchmark suite, with a maximum speedup of 13\%. On SPEC CPU 2017, our superoptimizer produces an average speedup of 1.5\%, with a maximum speedup of 4.5\% for 638.imagick. Every optimization produced by Minotaur has been formally verified, and several optimizations that it has discovered have been implemented in LLVM as a result of our work.
候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。
HN 书评
没有评论直接链到它;下面是它被提交的讨论串里回复最多的评论(不计入统计)“Semi related: Does anyone know if there's been promising research in using LLMs for compilation. Seems like if you have an LLM that can have higher levels of abstraction understanding of a codebase it could (in theory) be able to optimize it in ways traditional compilers might not.”
- Minotaur: A SIMD-Oriented Synthesizing Superoptimizer ↗PaulHoule · 2023-06-03 · 1 分
- Minotaur: A SIMD-Oriented Synthesizing Superoptimizer ↗luu · 2023-07-12 · 1 分