Search
1 article for “Polyhedral compilation”
-
Polyhedral Compilation for Imperative Loops: Foundations, Advances, and Emerging Frontiers
Abstract: Polyhedral compilation is a mathematically rigorous framework that models imperative loop nests as sets of integer points constrained by affine inequalities, enabling precise reasoning about data dependences and the legality of complex program transformations. Over the past decade, this framework has evolved from an academic formalism into a practical compiler technology deployed in production compilers, high-performance computing libraries, and machine learning acceleration toolchains. This review surveys the theoretical underpinnings of …
Published in Recent Trends in Parallel Computing · Vol. 13, Issue 2, 2026 · pp. 7–15 Read article