Everything about Polytope model
Framework for computer program optimization
The polyhedral model is a mathematical framework for programs that perform large numbers of operations -- too large to be explicitly enumerated -- thereby requiring a compact representation. Nested loop programs are the typical, but not the only example, and the most common use of the model is for loop nest optimization in program optimization. The polyhedral method treats each loop iteration within nested loops as lattice points inside mathematical objects called polyhedra, performs affine transformations or more general non-affine transformations such as tiling on the polytopes, and then converts the transformed polytopes into equivalent, but optimized, loop nests through polyhedra scanning. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Polytope modelA 5-minute orientation
- Pick up a classic book: Geometry of Higher-Dimensional PolytopesThe most-reprinted book on the subject
- Read the landmark paper: Polytope model and the electronic and structural properties of amorphous semiconductorsCited 61 times
- Go sideways: Frameworks supporting the polyhedral modelA closely related topic
- Go sideways: Loop optimizationA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
đź“š Books worth reading
- 📕Geometry of Higher-Dimensional PolytopesGennadiy Vladimirovich Zhizhin · 2018
Polytope ProjectsOctavian Iordache · 2013
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- Frameworks supporting the polyhedral model Use of the polyhedral model (also called the polytope model) within a compiler requires software to represent the objects of this framework (sets of integer-val…
- Loop optimization In compiler theory, loop optimization is the process of increasing execution speed and reducing the overheads associated with loops. It plays an important…
- Gale diagram In the mathematical discipline of polyhedral combinatorics, the Gale transform turns the vertices of any convex polytope into a set of vectors or points…
- Loop nest optimization In computer science and particularly in compiler design, loop nest optimization (LNO) is an optimization technique that applies a set of loop transformations…
- Integer points in convex polyhedra The study of integer points in convex polyhedra is motivated by questions such as "how many nonnegative integer-valued solutions does a system of linear…
- Automatic parallelization Automatic parallelization, also auto-parallelization or autoparallelization, is a compiler optimization in which a compiler or other software tool transforms…
- Loop interchange In compiler theory, loop interchange is the process of exchanging the order of two iteration variables used by a nested loop. The variable used in the…
- Coxeter–Dynkin diagram In geometry, a Coxeter–Dynkin diagram (or Coxeter diagram, Coxeter graph) is a graph with numerically labeled edges (called branches) representing a Coxeter…