Path: utzoo!utgpu!news-server.csri.toronto.edu!cs.utexas.edu!qt.cs.utexas.edu!yale.edu!cmcl2!beta!cochiti.lanl.gov!jlg
From: jlg@cochiti.lanl.gov (Jim Giles)
Newsgroups: comp.lang.fortran
Subject: Re: NAG Fortran 90 announcement
Message-ID: <26633@beta.gov>
Date: 27 Jun 91 22:59:01 GMT
References: <1991Jun25.214710.21152@murdoch.acc.Virginia.EDU> <26487@beta.gov> <1991Jun26.173409.443@weyrich.UUCP> <1991Jun27.180712.7293@murdoch.acc.Virginia.EDU> <26631@beta.gov>
Sender: news@beta.gov
Organization: Los Alamos National Laboratory
Lines: 7

PS. About the benchmark.  If the test case had been complicated enough
to lose vectorization, the slowdown would have been a factor of 35
on the n=10000 case.  Dependency analysis is hard enough when you
can do it statically, I suspect that real codes will lose vectorization
on many of their loops even with the standard C compiler's run-time
tests installed.  Of course, I don't have a _specific_ example of
this - it is only a suspicion.