Related articles |
---|
Possible data allocation and instruction scheduling algo... ollanes@prodigy.net (Orlando Llanes) (2002-01-24) |
Re: Possible data allocation and instruction scheduling algo... bryan.hayes@hayestechnologies.com (2002-01-30) |
Re: Possible data allocation and instruction scheduling algo... bear@sonic.net (Ray Dillinger) (2002-02-06) |
Re: Possible data allocation and instruction scheduling algo... ollanes@pobox.com (2002-02-16) |
Re: Possible data allocation and instruction scheduling algo... ollanes@pobox.com (2002-02-16) |
From: | ollanes@pobox.com (Orlando Llanes) |
Newsgroups: | comp.compilers |
Date: | 16 Feb 2002 01:16:48 -0500 |
Organization: | http://groups.google.com/ |
References: | 02-01-118 02-01-161 02-02-031 |
Keywords: | architecture |
Posted-Date: | 16 Feb 2002 01:16:48 EST |
Ray Dillinger <bear@sonic.net> wrote in message news:02-02-031...
> It's getting seriously hard for a compiler to really know what the
> hell its target is on the local machine, and even if you know what the
> target is, sometimes the tradeoffs are hard to predict when deciding
When in doubt, optimize for the Pentium I. Obviously if you're
programming for multimedia (ie: libraries bundled with the compiler),
you'll want to take advantage of the latest MMX/etc instructions. BTW,
I've made optimizations for the Pentium that actually ran faster than
the supposedly optimal equivalent.
> how to optimize something. Lately I've been toying with the idea of
> ...
> along in a config file.
That's a good idea in theory. One problem is that most programs
have functions that are weaved together with other functions, so you
might end up profiling an entire program several times. Another
problem is that you'll have to "simulate" data; such as dynamic
memory, modifying x bytes in y buffer, etc.
See ya!
Orlando
Return to the
comp.compilers page.
Search the
comp.compilers archives again.