Entry Kennedy:1995:LTA from sigplan1990.bib

Last update: Thu Apr 12 03:37:15 MDT 2012                Valid HTML 3.2!

Index sections

Top | Symbols | Numbers | Math | A | B | C | D | E | F | G | H | I | J | K | L | M | N | O | P | Q | R | S | T | U | V | W | X | Y | Z

BibTeX entry

@Article{Kennedy:1995:LTA,
  author =       "Ken Kennedy and Nenad Nedeljkovic and Ajay Sethi",
  title =        "A Linear-Time Algorithm for Computing the Memory
                 Access Sequence in Data-Parallel Programs",
  journal =      j-SIGPLAN,
  volume =       "30",
  number =       "8",
  pages =        "102--111",
  month =        aug,
  year =         "1995",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Sun Dec 14 09:17:08 MST 2003",
  bibsource =    "http://portal.acm.org/",
  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.",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Comput. Sci., Rice Univ., Houston, TX, USA",
  classification = "C4240P (Parallel programming and algorithm theory);
                 C6110P (Parallel programming); C6150C (Compilers,
                 interpreters and other processors); C6150N (Distributed
                 systems software)",
  keywords =     "Compilers; Data-parallel programs; Distributed-memory
                 machines; High Performance Fortran; Linear-time
                 algorithm; Memory access sequence; Portable programs;
                 Regular section indices; Run-time systems",
  thesaurus =    "Parallel algorithms; Parallel programming; Processor
                 scheduling; Program compilers",
}

Related entries