Data Space Oriented Tiling

  • Authors:
  • Mahmut T. Kandemir

  • Affiliations:
  • -

  • Venue:
  • ESOP '02 Proceedings of the 11th European Symposium on Programming Languages and Systems
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

An optimizing compiler can play an important role in enhancing data locality in array-intensive applications with regular data access patterns. This paper presents a compiler-based data space oriented tiling approach (DST). In this strategy, the data space (i.e., the array index space) is logically divided into chunks (called data tiles) and each data tile is processed in turn. In processing a data tile, our approach traverses the entire iteration space of all nests in the code and executes all iterations (potentially coming from different nests) that access the data tile being processed. In doing so, it also takes data dependences into account. Since a data space is common across all nests that access it, DST can potentially achieve better results than traditional tiling by exploiting inter-nest data locality. This paper also shows how data space oriented tiling can be used for improving the performance of software-managed scratch pad memories.