Entry Grant:2000:BCD from toplas.bib

Last update: Tue May 1 02:05:46 MDT 2012                Valid HTML 3.2!

Index sections

Top | Symbols | 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{Grant:2000:BCD,
  author =       "Brian Grant and Markus Mock and Matthai Philipose and
                 Craig Chambers and Susan J. Eggers",
  title =        "The benefits and costs of {DyC}'s run-time
                 optimizations",
  journal =      j-TOPLAS,
  volume =       "22",
  number =       "5",
  pages =        "932--972",
  year =         "2000",
  CODEN =        "ATPSDT",
  ISSN =         "0164-0925 (print), 1558-4593 (electronic)",
  ISSN-L =       "0164-0925",
  bibdate =      "Tue Apr 17 10:05:24 MDT 2001",
  bibsource =    "http://www.acm.org/pubs/toc/;
                 http://www.math.utah.edu/pub/tex/bib/toplas.bib",
  URL =          "http://www.acm.org/pubs/articles/journals/toplas/2000-22-5/p932-grant/p932-grant.pdf;
                 http://www.acm.org/pubs/citations/journals/toplas/2000-22-5/p932-grant/",
  abstract =     "DyC selectively dynamically compiles programs during
                 their execution, utilizing the run-time-computed values
                 of variables and data structures to apply optimizations
                 that are based on partial evaluation. The dynamic
                 optimizations are preplanned at static compile time in
                 order to reduce their run-time cost; we call this {\em
                 staging}. DyC's staged optimizations include (1) an
                 advanced binding-time analysis that supports
                 polyvariant specialization (enabling both single-way
                 and multiway complete loop unrolling), polyvariant
                 division, static loads, and static calls, (2) low-cost,
                 dynamic versions of traditional global optimizations,
                 such as zero and copy propagation and dead-assignment
                 elimination, and (3) dynamic peephole optimizations,
                 such as strength reduction. Because of this large suite
                 of optimizations and its low dynamic compilation
                 overhead, DyC achieves good performance improvements on
                 programs that are larger and more complex than the
                 kernels previously targeted by other dynamic
                 compilation systems. This paper evaluates the benefits
                 and costs of applying DyC's optimizations. We assess
                 their impact on the performance of a variety of small
                 to medium-sized programs, both for the regions of code
                 that are actually transformed and for the entire
                 application as a whole. Our study includes an analysis
                 of the contribution to performance of individual
                 optimizations, the performance effect of changing the
                 applications' inputs, and a detailed accounting of
                 dynamic compilation costs.",
  acknowledgement = ack-nhfb,
  fjournal =     "ACM Transactions on Programming Languages and
                 Systems",
  generalterms = "Performance",
  keywords =     "dynamic compilation; specialization",
  subject =      "Software --- Programming Languages --- Processors
                 (D.3.4): {\bf Compilers}; Software --- Programming
                 Languages --- Processors (D.3.4): {\bf Optimization}",
}

Related entries