Xref: utzoo comp.arch:16956 comp.lang.misc:5097
Path: utzoo!utgpu!watserv1!watmath!att!rutgers!uwm.edu!cs.utexas.edu!uunet!apctrc!backus!zrra07
From: zrra07@backus (Randall R. Appleton)
Newsgroups: comp.arch,comp.lang.misc
Subject: Compiler Costs
Message-ID: <1797@apctrc.UUCP>
Date: 5 Jul 90 14:36:56 GMT
Sender: news@trc.amoco.com
Organization: Amoco Production Company, Tulsa Research Center
Lines: 11
X-Checksum-Snefru: 121c9339 79b7ea15 a2284af8 c8b740ba

I have a simple question:  Does anyone know what sort of speed-up
on gets by going from a good implementation of some algorithm in a
third generation language (C, Fortran) and a good optimizing compiler
to hand-coded assembly?

In other words, if I take my average well written program, compiled
with a good optimizing compiler, and re-write it in assembler, what sort
of speedup should I expect to see?

Thanks,
Randy