Entry Ball:1993:BPF 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{Ball:1993:BPF,
  author =       "Thomas Ball and James R. Larus",
  title =        "Branch prediction for free",
  journal =      j-SIGPLAN,
  volume =       "28",
  number =       "6",
  pages =        "300--313",
  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/p300-ball/",
  abstract =     "Many compilers rely on branch prediction to improve
                 program performance by identifying frequently executed
                 regions and by aiding in scheduling instructions.{\em
                 Profile-based\/} predictors require a time-consuming
                 and inconvenient compile-profile-compile cycle in order
                 to make predictions. We present a {\em program-based\/}
                 branch predictor that performs well for a large and
                 diverse set of programs written in C and Fortran. In
                 addition to using natural loop analysis to predict
                 branches that control the iteration of loops, we focus
                 on heuristics for predicting non-loop branches, which
                 dominate the dynamic branch count of many programs. The
                 heuristics are simple and require little program
                 analysis, yet they are effective in terms of coverage
                 and miss rate. Although program-based prediction does
                 not equal the accuracy of profile-based prediction, we
                 believe it reaches a sufficiently high level to be
                 useful. Additional type and semantic information
                 available to a compiler would enhance our heuristics.",
  acknowledgement = ack-nhfb,
  affiliation =  "Dept. of Comput. Sci., Wisconsin Univ., Madison, WI,
                 USA",
  annote =       "Published as part of the Proceedings of PLDI'93.",
  classification = "C6110 (Systems analysis and programming); C6120
                 (File organisation); C6150C (Compilers, interpreters
                 and other processors)",
  confdate =     "23-25 June 1993",
  conflocation = "Albuquerque, NM, USA",
  confsponsor =  "ACM",
  keywords =     "Branch prediction; C; Compile-profile-compile cycle;
                 Dynamic branch count; Fortran; Frequently executed
                 regions; Heuristics; languages; Miss rate; Natural loop
                 analysis; Non-loop branches; performance; Program
                 performance; Program-based branch predictor; Scheduling
                 instructions; Semantic information",
  subject =      "{\bf G.2.2} Mathematics of Computing, DISCRETE
                 MATHEMATICS, Graph Theory. {\bf D.3.2} Software,
                 PROGRAMMING LANGUAGES, Language Classifications,
                 FORTRAN. {\bf D.3.4} Software, PROGRAMMING LANGUAGES,
                 Processors, Optimization. {\bf D.3.4} Software,
                 PROGRAMMING LANGUAGES, Processors, Compilers.",
  thesaurus =    "Program compilers; Programming; Tree data structures",
}

Related entries