The Use of Iteration Space Partitioning to Construct Representative Simple Sections

A method is presented of constructing a number of regions in a 2-dimensional array such that all accesses that can be induced by an arbitrary occurrence of this array in a program are limited to one of these regions. The index set of such regions will be described in terms of 2-dimensional simple sections. Furthermore, we show how simple loop transformations can be used to increase the number of resulting regions. In particular, this method is very useful for a restructuring compiler that performs data structure transformations.

[1]  Utpal Banerjee,et al.  Loop Transformations for Restructuring Compilers: The Foundations , 1993, Springer US.

[2]  Ken Kennedy,et al.  Interactive parallelization of numerical scientific programs , 1989 .

[3]  David L. Kuck,et al.  The Structure of Computers and Computations , 1978 .

[4]  Constantine D. Polychronopoulos,et al.  Parallel programming and compilers , 1988 .

[5]  David A. Padua,et al.  Advanced compiler optimizations for supercomputers , 1986, CACM.

[6]  Aart J. C. Bik,et al.  Compilation techniques for sparse matrix computations , 1993, ICS '93.

[7]  Zahari Zlatev,et al.  Y12M - Solution of Large and Sparse Systems of Linear Algebraic Equations , 1981, Lecture Notes in Computer Science.

[8]  Vasanth Balasundaram.  A Mechanism for Keeping Useful Internal Information in Parallel Programming Tools: The Data Access Descriptor , 1990, J. Parallel Distributed Comput..

[9]  Utpal Banerjee.  Loop Parallelization , 1994, Springer US.

[10]  Aart J. C. Bik,et al.  Reshaping Access Patterns for Generating Sparse Codes , 1994, LCPC.

[11]  Iain S. Duff,et al.  Sparse matrix test problems , 1982 .

[12]  Corinne Ancourt,et al.  Scanning polyhedra with DO loops , 1991, PPOPP '91.

[13]  Aart J. C. Bik,et al.  Nonzero structure analysis , 1994, ICS '94.

[14]  George B. Dantzig,et al.  Fourier-Motzkin Elimination and Its Dual , 1973, J. Comb. Theory A.

[15]  I. G. MacDonald,et al.  CONVEX POLYTOPES AND THE UPPER BOUND CONJECTURE , 1973 .

[16]  Aart J. C. Bik,et al.  On Automatic Data Structure Selection and Code Generation for Sparse Computations , 1993, LCPC.

[17]  Yousef Saad,et al.  SPARK: a benchmark package for sparse computations , 1990, ICS '90.

[18]  Z. Zlatev.  Computational Methods for General Sparse Matrices , 1991 .

[19]  Barbara M. Chapman,et al.  Supercompilers for parallel and vector computers , 1990, ACM Press frontier series.

[20]  Michael Wolfe,et al.  High performance compilers for parallel computing , 1995 .

[21]  Karol Borsuk,et al.  Multidimensional Analytic Geometry , 1969 .

[22]  David B. Loveman,et al.  Program Improvement by Source-to-Source Transformation , 1977, J. ACM.