From: | cdg@nullstone.com (Christopher Glaeser) |
Newsgroups: | comp.compilers |
Date: | 8 Mar 1996 19:20:02 -0500 |
Organization: | Compilers Central |
References: | 96-03-006 96-03-025 96-03-049 |
Keywords: | optimize |
> [On small kernels, a skilled assembler programmer can certainly do better.
> On large programs, I'm not so sure. Compilers don't get bored as easily
> as we do, so they avoid making dumb mistakes. -John]
And, superoptimizers can do better than skilled assembler programmers
on short instruction sequences, where considerable computing resources
can be applied to an exhaustive search. So, perhaps skilled assembly
programmers do better on programs with enough complexity to preclude
an exhaustive search, but small enough to avoid boredom and dumb
mistakes. If so, can it be said that optimization research and
development is devoted, in part, to reducing the distance between
these two end points?
Regards,
Christopher Glaeser cdg@nullstone.com
Nullstone Corporation http://www.nullstone.com
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.