@inproceedings{8cc67b1a11fe4e1dbefd385f4b27c32f,
title = "Data space oriented tiling",
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., thearray index space) is logically divided into chunks (called data tiles) andeach 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 thedata tile being processed. In doing so, it also takes data dependences into account. Since a data space is common across all nests that accessit, DST can potentially achieve better results than traditional tiling by exploiting inter-nest data locality. This paper also shows how data spaceoriented tiling can be used for improving the performance of softwaremanaged scratch pad memories.",
author = "Mahmut Kandemir",
note = "Publisher Copyright: {\textcopyright} Springer-Verlag Berlin Heidelberg 2002.; 11th European Symposium on Programming, ESOP 2002 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002 ; Conference date: 08-04-2002 Through 12-04-2002",
year = "2002",
doi = "10.1007/3-540-45927-8\_13",
language = "English (US)",
isbn = "3540433635",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "178--193",
editor = "\{Le M{\'e}tayer\}, Daniel",
booktitle = "Programming Languages and Systems - 11th European Symposium on Programming, ESOP 2002 Held as Part of the Joint European Conferences on Theory and Practice of Software, ETAPS 2002, Proceedings",
address = "Germany",
}