Entry Duesterwald:1993:PDF 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{Duesterwald:1993:PDF,
  author =       "Evelyn Duesterwald and Rajiv Gupta and Mary Lou
                 Soffa",
  title =        "A practical data flow framework for array reference
                 analysis and its use in optimizations",
  journal =      j-SIGPLAN,
  volume =       "28",
  number =       "6",
  pages =        "68--77",
  month =        jun,
  year =         "1993",
  CODEN =        "SINODQ",
  ISBN =         "0-89791-598-4",
  ISBN-13 =      "978-0-89791-598-4",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Sun Dec 14 09:16:37 MST 2003",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/proceedings/pldi/155090/index.html",
  URL =          "http://www.acm.org:80/pubs/citations/proceedings/pldi/155090/p68-duesterwald/",
  abstract =     "Data flow analysis techniques have traditionally been
                 restricted to the analysis of scalar variables. This
                 restriction, however, imposes a limitation on the kinds
                 of optimizations that can be performed in loops
                 containing array references. We present a data flow
                 framework for array reference analysis that provides
                 the information needed in various optimizations
                 targeted at sequential or fine-grained parallel
                 architectures. The framework extends the traditional
                 scalar framework by incorporating iteration distance
                 values into the analysis to qualify the computed data
                 flow solution during the fixed point iteration.
                 Analyses phrased in this framework are capable of
                 discovering recurrent access patterns among array
                 references that evolve during the execution of a loop.
                 Applications of our framework are discussed for
                 register allocation, load/store optimizations, and
                 controlled loop unrolling.",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Comput. Sci., Pittsburgh Univ., PA, USA",
  annote =       "Published as part of the Proceedings of PLDI'93.",
  classification = "C6110P (Parallel programming); C6120 (File
                 organisation); C6150C (Compilers, interpreters and
                 other processors)",
  confdate =     "23-25 June 1993",
  conflocation = "Albuquerque, NM, USA",
  confsponsor =  "ACM",
  keywords =     "algorithms; Array references; Computed data flow
                 solution; Controlled loop unrolling; Data flow
                 framework; Fine-grained parallel architectures; Fixed
                 point iteration; Fixed point solution; Iteration
                 distance values; Load/store optimizations; performance;
                 Recurrent access patterns; Reference analysis; Register
                 allocation; Structured loops",
  subject =      "{\bf D.3.4} Software, PROGRAMMING LANGUAGES,
                 Processors, Optimization. {\bf C.1.2} Computer Systems
                 Organization, PROCESSOR ARCHITECTURES, Multiple Data
                 Stream Architectures (Multiprocessors), Parallel
                 processors**. {\bf F.3.3} Theory of Computation, LOGICS
                 AND MEANINGS OF PROGRAMS, Studies of Program
                 Constructs.",
  thesaurus =    "Data structures; Parallel programming; Program
                 compilers; Storage allocation",
}

Related entries