Entry Feign:1979:NLO from sigplan1970.bib

Last update: Fri Jun 20 02:11:11 MDT 2008                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{Feign:1979:NLO,
  author =       "David Feign",
  title =        "A note on loop `optimization'",
  journal =      j-SIGPLAN,
  volume =       "14",
  number =       "11",
  pages =        "23--25",
  month =        nov,
  year =         "1979",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/988056.988060",
  ISSN =         "0362-1340",
  bibdate =      "Wed Jun 18 16:11:19 MDT 2008",
  bibsource =    "http://portal.acm.org/",
  abstract =     "The well-known execution-time reduction by moving
                 invariant code out of a loop can be applied to an
                 unconditional jump. Yet, this simple 'optimization' is
                 overlooked by most programmers and compiler designers.
                 This paper reveals the overlooked unconditional jump
                 and shows how moving it can not only reduce execution
                 time, but can standardize and simplify the prototype
                 loop.",
  acknowledgement = ack-nhfb,
  classification = "C6110 (Systems analysis and programming)",
  corpsource =   "Chapman Coll., Orange, CA, USA",
  keywords =     "execution time; programmers; programming;
                 unconditional jump",
  treatment =    "P Practical",
}

Related entries