
Polyhedral Analysis
Today I brought a somewhat different topic. Have you ever thought it would be great if a compiler could automatically transform loops for optimization or parallelization while using it? Compiler engineers have had the same concerns. One approach that emerged is the polyhedral compiler, which is used by LLVM’s Polly project and MLIR’s affine dialect. Today I’ll introduce this approach. Basic concepts Before going into detail, let’s go over some basic concepts. Most of these are easy to encounter with a little linear algebra. ...


