2019 · 13 citations · 45 references
ComputingComputer EngineeringComputer ScienceData StructuresParallel ComputingScientific ComputingData LocalityData Locality OptimizationData ParallelismData-flow AnalysisMemory Hierarchy OptimizationParallel Data StructuresData ReuseMemory LocalityStencil ComputationTessellation ModelsTessellationsTiling SchemesTiling StrategiesTilings
Stencil computations represent a very common class of nested loops in scientific and engineering applications. The exhaustively studied tiling is one of the most powerful transformation techniques to explore the data locality and parallelism. Existing work often uniformly handles different stencil shapes. This paper first presents a concept called natural block to identify the difference between the star and box stencils. Then we propose anew two-level tessellation scheme for star stencils, where the natural block, as well as its successors can tessellate the spatial space and their extensions along the time dimension are able to form a tessellation of the iteration space. Furthermore, a novel implementation technique called double updating is developed for star stencils specifically to improve the in-core data reuse pattern. Evaluation results are provided that demonstrate the effectiveness of the approach.
45
A data locality optimizing algorithm
Michael E. Wolf, Monica S. Lam · 1991 · 1.3K citations · Full text
A practical automatic polyhedral parallelizer and locality optimizer
Uday Bondhugula, Albert Hartono, J. Ramanujam et al. · 2008 · 883 citations
François Irigoin, Rémi Triolet · 1988 · 562 citations
Jiawei Hong, H. T. Kung · 1981 · 450 citations