• Home
  • Search
  • A linear-time algorithm for computing the memory access sequence in data-parallel programs
  • Cite Icon57
  • https://doi.org/10.1145/209936.209948Copy DOI Icon

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

  • Aug 1, 1995
  • Ken Kennedy +2 more
Show More
  • Abstract
  • Literature Map
  • References
  • Citations
  • Similar Papers
Abstract

Data-parallel languages, such as High Performance Fortran, are widely regarded as a promising means for writing portable programs for distributed-memory machines. Novel features of these languages call for the development of new techniques in both compilers and run-time systems. In this paper, we present an improved algorithm for finding the local memory access sequence in computations involving regular sections of arrays with cyclic(k) distributions. After establishing the fact that regular section indices correspond to elements of an integer lattice, we show how to find a lattice basis that allows for simple and fast enumeration of memory accesses. The complexity of our algorithm is shown to be lower than that of the previous solution for the same problem. In addition, the experimental results demonstrate the efficiency of our method in practice.

Similar Papers
  • 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
  • Research Article

Generating efficient local memory access sequences for coupled subscripts in data-parallel programs

  • Jan 21, 2003
  • Information Sciences
  • Tsung-Chuan Huang +2
  • Research Article
  • Citations87

Compiling Array Expressions for Efficient Execution on Distributed-Memory Machines

  • Feb 01, 1996
  • Journal of Parallel and Distributed Computing
  • S.K.S Gupta +3
  • Book Chapter
  • Citations7

Code generation for complex subscripts in data-parallel programs

  • Jan 01, 1998
  • J Ramanujam +2
  • Conference Article

Efficient address generation for affine subscripts in data-parallel programs

  • Dec 14, 1998
  • Kuei-Ping Shih +2
  • Research Article
  • Citations9

High Performance Fortran, Version 2

  • Dec 01, 1997
  • Parallel Processing Letters
  • Robert Schreiber
  • 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
  • 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
  • PDF
  • Research Article
  • Citations61

VFC: The Vienna Fortran Compiler

  • Jan 01, 1999
  • Scientific Programming
  • Siegfried Benkner
  • Book Chapter

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

  • Jan 01, 1993
  • Piyush Mehrotra
  • Book Chapter
  • Citations8

Generalized overlap regions for communication optimization in data-parallel programs

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

Efficient Address Generation for Affine Subscripts in Data-Parallel Programs

  • Jan 01, 2000
  • The Journal of Supercomputing
  • Kuei-Ping Shih +2
  • Conference Article
  • Citations1

Generating communication sets efficiently on data-parallel programs

  • Jan 01, 1997
  • Tsung-Chuan Huang +2
  • Conference Article
  • Citations53

Generating local addresses and communication sets for data-parallel programs

  • Jan 01, 1993
  • Siddhartha Chatterjee +4
Cactus Communications logo

Copyright 2026 Cactus Communications. All rights reserved.