Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!zaphod.mps.ohio-state.edu!wuarchive!udel!haven.umd.edu!uvaarpa!murdoch!astsun8.astro.Virginia.EDU!gsh7w From: gsh7w@astsun8.astro.Virginia.EDU (Greg Hennessy) Newsgroups: comp.lang.fortran Subject: Re: NAG Fortran 90 announcement Message-ID: <1991Jun25.214710.21152@murdoch.acc.Virginia.EDU> Date: 25 Jun 91 21:47:10 GMT References: <26334@lanl.gov> <26453@beta.gov> Sender: usenet@murdoch.acc.Virginia.EDU Organization: University of Virginia Lines: 19 In article <26453@beta.gov> jlg@cochiti.lanl.gov (Jim Giles) writes: #The fact that C turns _all_ arrays (regardless of dimensionality) #into pointers in the procedure call mechanism means that C must #always assume that array parameters are mutually aliased and can't #optimize operations on them. #The Fortran Journal published a benchmark on f2c a few issues back. #As I remember, the average slowdown was about 15%. The benchmark #was done on minis or micros and didn't show the enormous slowdown #you'd expect on a vector machine or a massively parallel machine. Why don't you take a benchmark of your choice, run it through f2c, then use one of the vectorizing C compilers on it, and measure the "enormous slowdown", that way we would have facts? -- -Greg Hennessy, University of Virginia USPS Mail: Astronomy Department, Charlottesville, VA 22903-2475 USA Internet: gsh7w@virginia.edu UUCP: ...!uunet!virginia!gsh7w