Return to the
comp.compilers page.
Search the
comp.compilers archives again.
| Related articles |
|---|
| [10 earlier articles] |
| Re: static estimation of conditional branches? jfisher@hplabsz.hpl.hp.com (1992-12-11) |
| Re: static estimation of conditional branches? chased@rbbb.Eng.Sun.COM (1992-12-12) |
| Re: static estimation of conditional branches? glew@pdx007.intel.com (1992-12-12) |
| Re: static estimation of conditional branches? henry@zoo.toronto.edu (1992-12-13) |
| Re: static estimation of conditional branches? hrubin@pop.stat.purdue.edu (1992-12-13) |
| Re: static estimation of conditional branches? drw@euclid.mit.edu (1992-12-14) |
| Re: static estimation of conditional branches? idacrd!desj@uunet.UU.NET (1992-12-14) |
| Re: static estimation of conditional branches? iwm@doc.ic.ac.uk (1992-12-14) |
| Re: static estimation of conditional branches? pcg@aber.ac.uk (1992-12-15) |
| Newsgroups: | comp.compilers |
| From: | idacrd!desj@uunet.UU.NET (David desJardins) |
| Organization: | IDA Center for Communications Research, Princeton |
| Date: | Mon, 14 Dec 1992 04:36:24 GMT |
| Keywords: | optimize, performance |
| References: | 92-12-029 92-12-054 |
Henry Spencer <henry@zoo.toronto.edu> writes:
> When people first started implementing profilers and the like, they found
> one striking result: human intuition about the locations of the hot spots
> in a complex program was *consistently wrong*. ...
We were talking about branch prediction. It is *much* easier for a
programmer to say how often a particular conditional branch is going to be
taken than it is for the programmer to say how much time is going to be
spent in a particular region of code. Among several reasons for this is
that the former is independent of the machine, compiler, or optimizer,
while the latter is not.
David desJardins
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.