Re: static estimation of conditional branches?

iwm@doc.ic.ac.uk (Ian W Moor)
Mon, 14 Dec 1992 13:43:04 GMT

          From comp.compilers

Related articles
[11 earlier articles]
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)
| List of all articles for this month |

Newsgroups: comp.compilers
From: iwm@doc.ic.ac.uk (Ian W Moor)
Organization: Dept. of Computing, Imperial College, University of London, UK.
Date: Mon, 14 Dec 1992 13:43:04 GMT
Keywords: optimize, performance
References: 92-12-029 92-12-058

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*. ...
|>


To be worthwhile, any compiler which accepts user hints like frequency or
register has to have the following property:


A correct hint must make an improvement that is worth gathering the
information, and an incorrect hint must either be detectable or must not
reduce performance much.


This seems contradictory.. I'd rather rely on a profiler or register
allocator.
--
Ian W. Moor +44 71 589 5111 x 5039
iwm@doc.ic.ac.uk Department of Computing, Imperial College.
--


Post a followup to this message

Return to the comp.compilers page.
Search the comp.compilers archives again.