 
Summary: DataCentric Transformations on NonInteger Iteration
Spaces
Swarup Kumar Sahoo Gagan Agrawal
Department of Computer Science and Engineering
Ohio State University, Columbus OH 43210
sahoo,agrawalĄ @cse.ohiostate.edu
ABSTRACT
Datacentric transformations have been used in recent years to im
prove locality for several classes of applications. However, the ex
isting work has applied these transformations for integer iteration
spaces, i.e., the iteration spaces involving loop variables that take
integer values between specified lower and upper bounds. In many
applications, a loop could involve a loop variable which takes val
ues from a sequence or set of real numbers, strings, or any other
data type. We refer to such iteration spaces as noninteger iteration
spaces.
This paper focuses on the problem of applying datacentric trans
formations on applications with noninteger iteration spaces. We
first present a general algorithm that uses a hash table. Then, we
show how in many cases, we can exploit the repetitive nature of the
