M. Cosnard et M. Loi, A SIMPLE ALGORITHM FOR THE GENERATION OF EFFICIENT LOOP STRUCTURES, International journal of parallel programming, 24(3), 1996, pp. 265-289
Citations number
25
Categorie Soggetti
Computer Sciences","Computer Science Theory & Methods
Generating code to enumerate the integer points of a polyhedron is a k
ey problem of the parallelizing compiler technology. For efficiency re
asons we plant to obtain loop bounds of the generated code that are as
simple as possible and we would like to avoid executing iterations of
outer loops for which no iterations of inner loops are executed. This
paper describes a simple algorithm to build an adequate representatio
n of the domain to enumerate, the Hierarchical Domain Descriptor (HDD)
. Starting from the HDD, generating such efficient loop structures is
straightforward. In some particular but frequently occurring cases the
HDD may also be used to count in a symbolic way the number of integer
points contained in the domain.