Newsgroups: comp.benchmarks
Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!batcomputer!cornell!uw-beaver!rice!ariel.rice.edu!preston
From: preston@ariel.rice.edu (Preston Briggs)
Subject: Re: A benchmark
Message-ID: <1991May3.154251.8142@rice.edu>
Keywords: snake performance
Sender: news@rice.edu (News)
Organization: Rice University, Houston
References: <1991May3.023705.5616@marlin.jcu.edu.au> <1991May3.053053.29174@rice.edu> <1991May3.124937.17144@marlin.jcu.edu.au>
Date: Fri, 3 May 91 15:42:51 GMT

csrdh@marlin.jcu.edu.au (Rowan Hughes) writes:

>Any sensible vector compiler would do a loop inversion for the second
>example, or possibly a chain with A(I) treated as a scalar. 

>Philosophical note:
>I really hate the idea of butchering code to suite some particular
>machine; computer scientists were invented to write compilers that
>took care of that!

Well, some computer scientists might disagree; however, I don't.
The vector machines typically have sensible compilers; I believe scalar
machines need them too.

HP's newest compilers (unreleased?) supposedly incorporate a front-end
from Kuck and Associates.  Hopefully, they'll handle this sort of
problem.  I expect it'll raise the stakes considerably among
workstation compilers.

Preston Briggs
