Xref: utzoo comp.arch:16994 comp.lang.misc:5113
Path: utzoo!attcan!uunet!uvm-gen!cavrak
From: cavrak@uvm-gen.UUCP (Steve Cavrak,113 Waterman,6561483,)
Newsgroups: comp.arch,comp.lang.misc
Subject: Re: Compiler Costs
Message-ID: <1565@uvm-gen.UUCP>
Date: 8 Jul 90 15:30:47 GMT
References: <1797@apctrc.UUCP>
Sender: nobody@uvm-gen.UUCP
Organization: EMBA Computer Facility, Univ. of Vermont, Burlington.
Lines: 18

From article <1797@apctrc.UUCP>, by zrra07@backus (Randall R. Appleton):
> 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?
> 

An example with VS-FORTRAN on an IBM-3090 with a vector processor.

a.  plain fortran matrix		1.0
b.  full optimized fortran		0.3
c.  IBM's ESSL hand coded library	0.1 or better

As another example, you could track down the standard LINPACK
benchmarks from net-lib@ornl.gov.  The report there gives a good
summary of how the LINPACK performs under different conditions.

Steve