• Home
  • Search
  • Code generation for complex subscripts in data-parallel programs
  • Cite Icon7
  • https://doi.org/10.1007/bfb0032683Copy DOI Icon

Code generation for complex subscripts in data-parallel programs

  • Jan 1, 1998
  • J Ramanujam +2 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Data parallel languages like High Performance Fortran, demand efficient compile and run-time techniques for tasks such as address generation. Array references with arbitrary affine subscripts can make the task of compilers for such languages highly involved. This paper deals with the efficient address generation in programs with array references having two types of commonly encountered affine references, namely coupled subscripts and subscripts containing multiple induction variables (MIVs). Methods discussed in the paper utilize the repetitive pattern of the memory accesses. In the case of MIV, we address this issue by presenting runtime techniques which enumerate the set of addresses in lexicographic order. Our approach to the problem incorporates a general approach of computing in O(k) time, the start element on a processor for a given global start element. Several methods are proposed and evaluated here for generating the access sequences for MIV based on problem parameters. With coupled subscripts, we present two construction techniques, namely searching and hashing which minimize the time needed to construct the tables. Extensive experiments were conducted and the results were then compared with [8] to indicate the efficiency of our approach.KeywordsOuter LoopAddress GenerationRuntime OverheadLocal AddressPattern TableThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Similar Papers
  • PDF
  • Research Article
  • Citations61

VFC: The Vienna Fortran Compiler

  • Jan 01, 1999
  • Scientific Programming
  • Siegfried Benkner
  • Research Article
  • Citations63

Vienna-Fortran/HPF extensions for sparse and irregular problems and their compilation

  • Jan 01, 1997
  • IEEE Transactions on Parallel and Distributed Systems
  • M Ujaldon +3
  • Book Chapter

Chapter 5 - Collective Communication Support

  • Jan 01, 2003
  • Interconnection Networks
  • José Duato +2
  • Conference Article

Procedure call models for distributed parameters in data parallel programs

  • Dec 17, 2002
  • Bwolen Yang +1
  • Research Article
  • Citations9

High Performance Fortran, Version 2

  • Dec 01, 1997
  • Parallel Processing Letters
  • Robert Schreiber
  • Book Chapter
  • Citations8

Generalized overlap regions for communication optimization in data-parallel programs

  • Jan 01, 1997
  • A Venkatachar +2
  • Research Article
  • Citations30

Efficient Computation of Address Sequences in Data Parallel Programs Using Closed Forms for Basis Vectors

  • Nov 01, 1996
  • Journal of Parallel and Distributed Computing
  • Ashwath Thirumalai +1
  • Research Article
  • Citations3

A linear-time algorithm for computing the memory access sequence in data-parallel programs

  • Aug 01, 1995
  • ACM SIGPLAN Notices
  • Ken Kennedy +2
  • Conference Article
  • Citations57

A linear-time algorithm for computing the memory access sequence in data-parallel programs

  • Aug 01, 1995
  • Ken Kennedy +2
  • Book Chapter

Data parallel programming: The promises and limitations of high performance fortran

  • Jan 01, 1993
  • Piyush Mehrotra
  • Conference Article
  • Citations1

Efficient address sequence generation for two-level mappings in High Performance Fortran

  • Nov 27, 2002
  • J Ramanujam +2
  • Research Article
  • Citations35

An implementation framework for HPF distributed arrays on message-passing parallel computer systems

  • Jan 01, 1996
  • IEEE Transactions on Parallel and Distributed Systems
  • K Van Reeuwijk +3
  • Conference Article
  • Citations37

Interprocedural compilation of irregular applications for distributed memory machines

  • Jan 01, 1995
  • Gagan Agrawal +1
  • Conference Article
  • Citations1

Generating communication sets efficiently on data-parallel programs

  • Jan 01, 1997
  • Tsung-Chuan Huang +2
  • Research Article
  • Citations4

Compositional Oil Reservoir Simulation in Fortran D: a Feasibility Study On Intel iPsc/860

  • Jun 01, 1994
  • The International Journal of Supercomputer Applications and High Performance Computing
  • Ulrich Kremer +1
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.