From: | creedy@mitretek.org (Chris Reedy) |
Newsgroups: | comp.compilers,comp.lang.asm.x86 |
Date: | 30 Jun 1997 23:09:27 -0400 |
Organization: | Mitretek Systems |
References: | 97-06-071 97-06-078 97-06-108 |
Keywords: | assembler, optimize |
bromage@cs.mu.oz.au (Andrew Bromage) wrote:
>
> Most programs that I write are not CPU-bound anyway. Either they are
> structure-crunching programs for which main memory is the bottleneck,
> disk-crunching programs for which I/O is the bottleneck, or interactive
> programs where most time is spent waiting for the human even with
> optimisation turned off. ...
I know of one interesting example - AI based game players (e.g. chess,
checkers, go, ...) - CPU intensive due to the searching. Also, as
someone who experiments with these in my spare time, I want the
compiler to generate good code since I change algorithms too often to
engage in hot spot improvements in assembly language.
Chris
Dr. Christopher L. Reedy, Mail Stop Z667
Mitretek Systems, 7525 Colshire Drive, McLean, VA 22102-7400
Email: creedy@mitretek.org Phone: (703) 610-1615 FAX: (703) 610-1603
--
Return to the
comp.compilers page.
Search the
comp.compilers archives again.