Entry Calder:1994:RBC 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{Calder:1994:RBC,
  author =       "Brad Calder and Dirk Grunwald",
  title =        "Reducing branch costs via branch alignment",
  journal =      j-SIGPLAN,
  volume =       "29",
  number =       "11",
  pages =        "242--251",
  month =        nov,
  year =         "1994",
  CODEN =        "SINODQ",
  ISSN =         "0362-1340 (print), 1523-2867 (print), 1558-1160 (electronic)",
  ISSN-L =       "0362-1340",
  bibdate =      "Sun Dec 14 09:16:57 MST 2003",
  bibsource =    "http://portal.acm.org/; http://www.acm.org/pubs/toc/",
  URL =          "http://www.acm.org:80/pubs/citations/proceedings/asplos/195473/p242-calder/",
  abstract =     "Several researchers have proposed algorithms for basic
                 block reordering. We call these {\em branch
                 alignment\/} algorithms. The primary emphasis of these
                 algorithms has been on improving instruction cache
                 locality, and the few studies concerned with branch
                 prediction reported small or minimal improvements. As
                 wide-issue architectures become increasingly popular
                 the importance of reducing branch costs will increase,
                 and branch alignment is one mechanism which can
                 effectively reduce these costs. In this paper, we
                 propose an improved branch alignment algorithm that
                 takes into consideration the architectural cost model
                 and the branch prediction architecture when performing
                 the basic block reordering. We show that branch
                 alignment algorithms can improve a broad range of
                 static and dynamic branch prediction architectures. We
                 also show that a program performance can be improved by
                 approximately 5\% even when using recently proposed,
                 highly accurate branch prediction architectures. The
                 programs are compiled by any existing compiler and then
                 transformed via binary transformations. When
                 implementing these algorithms on a Alpha AXP 21604 up
                 to a 16\% reduction in total execution time is
                 achieved.",
  acknowledgement = ack-nhfb,
  classification = "C5220P (Parallel architecture)C6150C (Compilers,
                 interpreters and other processors); C5440
                 (Multiprocessing systems); C6110P (Parallel
                 programming)",
  conflocation = "San Jose, CA, USA; 4-7 Oct. 1994",
  conftitle =    "Sixth International Conference on Architectural
                 Support for Programming Languages and Operating Systems
                 (ASPLOS-VI)",
  corpsource =   "Dept. of Comput. Sci., Colorado Univ., Boulder, CO,
                 USA",
  keywords =     "algorithms; Alpha AXP 21604; Alpha AXP 21604
                 transformations; architectural cost model; basic block
                 reordering; binary transformations; branch alignment
                 algorithms; branch costs; branch prediction
                 architecture; compiler; design; experimentation;
                 instruction cache locality; measurement; parallel
                 architectures; parallel programming; performance;
                 pipeline processing; program compilers; program
                 performance; theory; wide-issue architectures",
  sponsororg =   "ACM; IEEE Comput. Soc",
  subject =      "{\bf C.1.2} Computer Systems Organization, PROCESSOR
                 ARCHITECTURES, Multiple Data Stream Architectures
                 (Multiprocessors). {\bf C.4} Computer Systems
                 Organization, PERFORMANCE OF SYSTEMS.",
  treatment =    "P Practical",
}

Related entries