Map
Index
Random
Help
th

QuoteRef: ballT6_1993

topics > all references > ThesaHelp: references a-b



ThesaHelp:
ACM references a-e
ThesaHelp:
references a-b
Topic:
code optimization by instruction reordering or scheduling
Group:
program control

Reference

Ball, t., Larus, J.R., "Branch prediction for free", ACM SIGPLAN '93 Conference on Programming Language Design and Implementation, June 1993. Google

Other Reference

ACM SIGPLAN Notices, volume 28.6

Quotations
300 ;;Quote: developed heuristics for static branch prediction of loop and non-loop branches; average miss rate of 20%, best possible is about 10%
300+;;Quote: in many programs, more non-loop branches occur than loop branches

Related Topics up

ThesaHelp: ACM references a-e (259 items)
ThesaHelp: references a-b (396 items)
Topic: code optimization by instruction reordering or scheduling (16 items)
Group: program control   (27 topics, 547 quotes)

Collected barberCB 8/97
Copyright © 2002-2008 by C. Bradford Barber. All rights reserved.
Thesa is a trademark of C. Bradford Barber.