Data relation vectors

A new abstraction for data optimizations

Mahmut Kandemir, J. Ramanujam

Research output: Contribution to journalArticle

9 Citations (Scopus)

Abstract

We present an abstraction, called data relation vectors, to improve the data access characteristics and memory layouts in regular computations. The key idea is to define a relation between the data elements accessed by close-by iterations and use this relation to guide to a number of optimizations for array-based computations. The specific optimizations studied in this paper include enhancing group-spatial and self-spatial reuses and improving intratile and intertile data reuses. In addition, this abstraction works well with other known abstractions such as data reuse vectors. We also present a unified scheme for optimizing the memory performance of programs using this new abstraction in conjunction with reuse vectors. The data relation vector abstraction has been implemented in the SUIF compilation framework and has been tested using a set of 12 benchmarks from image processing and scientific computation domains. Preliminary results on a superscalar processor show that it is successful in reducing compilation time and outperforms two previously proposed techniques, one that uses only loop transformations and one that uses both loop and data transformations. Our experiments also show that the proposed abstraction helps one to select good data tile shapes which can subsequently be used to determine iteration space tiles.

Original languageEnglish (US)
Pages (from-to)798-810
Number of pages13
JournalIEEE Transactions on Computers
Volume50
Issue number8
DOIs
StatePublished - Aug 1 2001

Fingerprint

Optimization
Tile
Loop Transformations
Data Reuse
Compilation
Data storage equipment
Reuse
Superscalar Processor
Iteration
Data Transformation
Image processing
Abstraction
Layout
Image Processing
Benchmark
Experiments
Experiment

All Science Journal Classification (ASJC) codes

  • Software
  • Theoretical Computer Science
  • Hardware and Architecture
  • Computational Theory and Mathematics

Cite this

@article{e1c4748c5c8446bf9b1da56e56017359,
title = "Data relation vectors: A new abstraction for data optimizations",
abstract = "We present an abstraction, called data relation vectors, to improve the data access characteristics and memory layouts in regular computations. The key idea is to define a relation between the data elements accessed by close-by iterations and use this relation to guide to a number of optimizations for array-based computations. The specific optimizations studied in this paper include enhancing group-spatial and self-spatial reuses and improving intratile and intertile data reuses. In addition, this abstraction works well with other known abstractions such as data reuse vectors. We also present a unified scheme for optimizing the memory performance of programs using this new abstraction in conjunction with reuse vectors. The data relation vector abstraction has been implemented in the SUIF compilation framework and has been tested using a set of 12 benchmarks from image processing and scientific computation domains. Preliminary results on a superscalar processor show that it is successful in reducing compilation time and outperforms two previously proposed techniques, one that uses only loop transformations and one that uses both loop and data transformations. Our experiments also show that the proposed abstraction helps one to select good data tile shapes which can subsequently be used to determine iteration space tiles.",
author = "Mahmut Kandemir and J. Ramanujam",
year = "2001",
month = "8",
day = "1",
doi = "10.1109/12.947000",
language = "English (US)",
volume = "50",
pages = "798--810",
journal = "IEEE Transactions on Computers",
issn = "0018-9340",
publisher = "IEEE Computer Society",
number = "8",

}

Data relation vectors : A new abstraction for data optimizations. / Kandemir, Mahmut; Ramanujam, J.

In: IEEE Transactions on Computers, Vol. 50, No. 8, 01.08.2001, p. 798-810.

Research output: Contribution to journalArticle

TY - JOUR

T1 - Data relation vectors

T2 - A new abstraction for data optimizations

AU - Kandemir, Mahmut

AU - Ramanujam, J.

PY - 2001/8/1

Y1 - 2001/8/1

N2 - We present an abstraction, called data relation vectors, to improve the data access characteristics and memory layouts in regular computations. The key idea is to define a relation between the data elements accessed by close-by iterations and use this relation to guide to a number of optimizations for array-based computations. The specific optimizations studied in this paper include enhancing group-spatial and self-spatial reuses and improving intratile and intertile data reuses. In addition, this abstraction works well with other known abstractions such as data reuse vectors. We also present a unified scheme for optimizing the memory performance of programs using this new abstraction in conjunction with reuse vectors. The data relation vector abstraction has been implemented in the SUIF compilation framework and has been tested using a set of 12 benchmarks from image processing and scientific computation domains. Preliminary results on a superscalar processor show that it is successful in reducing compilation time and outperforms two previously proposed techniques, one that uses only loop transformations and one that uses both loop and data transformations. Our experiments also show that the proposed abstraction helps one to select good data tile shapes which can subsequently be used to determine iteration space tiles.

AB - We present an abstraction, called data relation vectors, to improve the data access characteristics and memory layouts in regular computations. The key idea is to define a relation between the data elements accessed by close-by iterations and use this relation to guide to a number of optimizations for array-based computations. The specific optimizations studied in this paper include enhancing group-spatial and self-spatial reuses and improving intratile and intertile data reuses. In addition, this abstraction works well with other known abstractions such as data reuse vectors. We also present a unified scheme for optimizing the memory performance of programs using this new abstraction in conjunction with reuse vectors. The data relation vector abstraction has been implemented in the SUIF compilation framework and has been tested using a set of 12 benchmarks from image processing and scientific computation domains. Preliminary results on a superscalar processor show that it is successful in reducing compilation time and outperforms two previously proposed techniques, one that uses only loop transformations and one that uses both loop and data transformations. Our experiments also show that the proposed abstraction helps one to select good data tile shapes which can subsequently be used to determine iteration space tiles.

UR - http://www.scopus.com/inward/record.url?scp=0035416147&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=0035416147&partnerID=8YFLogxK

U2 - 10.1109/12.947000

DO - 10.1109/12.947000

M3 - Article

VL - 50

SP - 798

EP - 810

JO - IEEE Transactions on Computers

JF - IEEE Transactions on Computers

SN - 0018-9340

IS - 8

ER -