Abstractions for Polyhedral Topology-Aware Tasking [Position Paper]

Traditional polyhedral compilation techniques rely on Integer Linear Programming (ILP) and lexicographic optimization to compute optimal transformations. Although, these techniques excel at exposing and leveraging data and pipeline parallelism as well as exploiting (hidden) available locality, they are not the best suited when tackling problems such as the Manhattan distance in a grid.