按年被提到
20212021 · 1 次2026
编程语言与编译器›编译器与运行时优化·arXiv:2112.14679 · cs.PL

Profile Guided Optimization without Profiles: A Machine Learning Approach

Nadav Rotem, Chris Cummins · 2021
开始阅读 ↗PDFalphaXiv 讨论
被提及 · 2 人首次 2021-12-30 · 最近 2023-09-18
2不同的人
2活跃月份
2讨论串
11被引(OpenAlex)
arXiv 摘要(候选层不写导读)

Profile guided optimization is an effective technique for improving the optimization ability of compilers based on dynamic behavior, but collecting profile data is expensive, cumbersome, and requires regular updating to remain fresh. We present a novel statistical approach to inferring branch probabilities that improves the performance of programs that are compiled without profile guided optimizations. We perform offline training using information that is collected from a large corpus of binaries that have branch probabilities information. The learned model is used by the compiler to predict the branch probabilities of regular uninstrumented programs, which the compiler can then use to inform optimization decisions. We integrate our technique directly in LLVM, supplementing the existing human-engineered compiler heuristics. We evaluate our technique on a suite of benchmarks, demonstrating some gains over compiling without profile information. In deployment, our technique requires no profiling runs and has negligible effect on compilation time.

候选层:至少 2 个不同的人、在 2 个不同月份提到过,还没到主书架的 3 人 3 个月。没有做立场标注,所以只写“被提及”。

HN 书评

推荐在前,同类按时间 · 每篇最多保留 20 条,统计用全部提及
评论boomanaiden154 · 2023-09

“What's the benefit of having an LLM do those things in a way that guesstimates? There are big wins to be had in code-size and some wins to be had in performance related to inlining [1][2], but I think the implementation in the references directly tied into the compiler's inlining heuristic is a much better way to do that as it guarantees correctness. In a…”

Large Language Models for Compiler Optimization原评论 ↗
被提交为 story · 1 次