Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!sun-barr!newstop!texsun!digi!blee
From: blee@digi.lonestar.org (Benjamin W. Lee)
Newsgroups: comp.benchmarks
Subject: Re: benchmarks and interprocedural optimization
Message-ID: <1991Mar26.175137.6706@digi.lonestar.org>
Date: 26 Mar 91 17:51:37 GMT
References: <1991Mar21.184428.8226@convex.com>
Organization: DSC Communications, Plano Tx.
Lines: 12

In article <1991Mar21.184428.8226@convex.com> metzger@convex.com (Robert Metzger) writes:
>
>I will give you one data point.  One of the larger applications we have
>compiled had 214,500 lines of FORTRAN source in 971 source files.  It took
>a total of 5 hours and 26 minutes wall clock time to compile and link on
[...]

I am very much interested on which portion of the optimization is most
time consuming? The data-gathering stage I suppose? Any good paper available
on interprocedural optimization? Thanks!

>Robert Metzger		CONVEX Computer Corp.  		Richardson, Texas