CRPC-TR94497-S

Title:    Efficient Address Generation for Block-Cyclic Distributions
          
Authors:  Ken Kennedy, Nenad Nedeljkovic, Ajay Sethi

Date:     December, 1994


Of the authors listed above, please indicate which are:

  Minority authors:

  Female authors:    

  Student authors:   Nenad Nedeljkovic, Ajay Sethi


Keywords (list up to 8):

  High Performance Fortran, Cyclic(k), Block-cyclic, Data parallelism

Abstract:

  Data-parallel languages, such as High Performance Fortran, are designed
  to make programming of distributed-memory machines easier, and resulting
  programs more portable and efficient. Advanced features of these languages
  require new methods in both compilers and run-time systems. We present
  efficient techniques for generating local memory addresses, in the exact
  order as specified by the original program, for computations involving
  references to arrays with cyclic(k) distribution, the most general regular
  data distribution provided in data-parallel languages. Our method exploits
  the repetitive pattern of memory accesses to handle arbitrary affine 
  subscripts, while minimizing the space and time overhead.  Extensive 
  experimental results indicate the efficiency of our approach in practice.

Publication History:

  Submitted to:	The 9th ACM International Conference on Supercomputing (ICS'95)