Memory Allocations for Tiled Uniform Dependence Programs

In this paper, we develop a series of extensions to schedule-independent storage mapping using Quasi-Universal Occu-pancy Vectors (QUOVs) targeting tiled execution of poly-hedral programs. By quasi-universality, we mean that we restrict the “universe” of the schedule to those that correspond to tiling. This provides the following benefits: (i) the shortest QUOVs may be shorter than the fully univer-sal ones, (ii) the shortest QUOVs can be found without any search, and (iii) multi-statement programs can be handled. The resulting storage mapping is valid for tiled execution by any tile size