Entry Krall:1994:ISS 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{Krall:1994:ISS,
  author =       "Andreas Krall",
  title =        "Improving Semi-static Branch Prediction by Code
                 Replication",
  journal =      j-SIGPLAN,
  volume =       "29",
  number =       "6",
  pages =        "97--106",
  month =        jun,
  year =         "1994",
  CODEN =        "SINODQ",
  DOI =          "http://doi.acm.org/10.1145/178243.178252",
  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 =      "Wed Jun 18 16:26:55 MDT 2008",
  bibsource =    "http://portal.acm.org/;
                 http://www.acm.org/pubs/contents/proceedings/pldi/178243/index.html",
  URL =          "http://www.acm.org:80/pubs/citations/proceedings/pldi/178243/p97-krall/",
  abstract =     "Speculative execution on superscalar processors
                 demands substantially better branch prediction than
                 what has been previously available. In this paper we
                 present code replication techniques that improve the
                 accuracy of semi-static branch prediction to a level
                 comparable to dynamic branch prediction schemes. Our
                 technique uses profiling to collect information about
                 the correlation between different branches and about
                 the correlation between the subsequent outcomes of a
                 single branch. Using this information and code
                 replication the outcome of branches is represented in
                 the program state. Our experiments have shown that the
                 misprediction rate can almost be halved while the code
                 size is increased by one third.",
  acknowledgement = ack-nhfb,
  annote =       "Published as part of the Proceedings of PLDI'94.",
  classification = "C1180 (Optimisation techniques); C4240 (Programming
                 and algorithm theory); C6110P (Parallel programming);
                 C6150C (Compilers, interpreters and other processors)",
  conflocation = "Orlando, FL, USA; 20-24 June 1994",
  conftitle =    "ACM SIGPLAN '94 Conference on Programming Language
                 Design and Implementation (PLDI)",
  corpsource =   "Inst. fur Computersprachen, Tech. Univ. Wien,
                 Austria",
  keywords =     "algorithms; branch prediction; code replication; code
                 size; dynamic branch prediction scheme; measurement;
                 misprediction rate; optimisation; parallel programming;
                 performance; profiling; program compilers; program
                 state; programming theory; semistatic branch
                 prediction; speculative execution; superscalar
                 processors",
  sponsororg =   "ACM",
  subject =      "{\bf D.3.4} Software, PROGRAMMING LANGUAGES,
                 Processors, Optimization. {\bf D.3.4} Software,
                 PROGRAMMING LANGUAGES, Processors, Compilers. {\bf
                 F.2.2} Theory of Computation, ANALYSIS OF ALGORITHMS
                 AND PROBLEM COMPLEXITY, Nonnumerical Algorithms and
                 Problems, Computations on discrete structures.",
  treatment =    "T Theoretical or Mathematical",
}

Related entries