With the emergence of multi-core processors, parallelism has gone main-stream. However, parallel programming is difficult for many reasons. Programmers now must think about which operations can legally be executed in parallel, when to insert synchronizations, and so on. In addition, parallelism and non-determinism nature of it makes debugging much harder. One approach to address this problem is...

We present a plan to add loop nest optimizations in GCC based on polyhedral representations of loop nests. We advocate a static analysis approach based on a hierarchy of interchangeable abstractions with solvers that range from the exact solvers such as OMEGA, to faster but less precise solvers based on more coarse abstractions. The intermediate representation GRAPHITE1 (GIMPLE Represented as P...

This paper proposes a novel optimization framework for the Data-Flow Graph Language (DFGL), a dependence-based notation for macro-dataflow model which can be used as an embedded domain-specific language. Our optimization framework follows a “dependence-first” approach in capturing the semantics of DFGL programs in polyhedral representations, as opposed to the standard polyhedral approach of der...

Polyhedral tilings are often used to represent structures such as atoms in materials, grains in crystals, foams, galaxies in the universe, etc. In the previous paper, we have developed a theory to convert a way of how polyhedra are arranged to form a polyhedral tiling into a codeword (series of numbers) from which the original structure can be recovered. The previous theory is based on the idea...