Tag
This article explains how HotSpot's C2 JIT compiler uses a 'known bits' abstraction to track which bits of an integer are definitely zero or one, enabling optimizations like eliminating redundant bitwise AND operations.
Article comparing old C++ performance tricks with modern compiler capabilities, showing that compilers can now optimize naive code better than hand-tuned hacks. Includes benchmarks on AMD Zen 5 with Clang 21.
A developer shares months of work building a compiler that outperforms cuBLAS for matrix multiplication on an A100 GPU, with visualizations.
The article explores the optimal ApplicativeDo scheduling problem in GHC, which is disabled by default due to slowness, and draws an analogy to the dynamic programming algorithm used for RNA folding to improve compiler performance.
A technical blog post demonstrating how Profile-Guided Optimization (PGO) with LLVM can significantly improve binary performance beyond standard -O3 and LTO, using SQLite as a benchmark.
A talk tracing the evolution from goto spaghetti to structured loops and finally to recursion schemes, showing how control-flow abstractions mirror data structures and why most languages still hide the best combinators.
Matt Godbolt explores compiler optimizations that convert an O(n) summation loop into an O(1) closed-form solution, highlighting how Clang and GCC employ sophisticated techniques like loop unrolling and mathematical simplification to dramatically improve code performance.