Relay-Version: version B 2.10 5/3/83; site utzoo.UUCP
Path: utzoo!mnetor!uunet!seismo!husc6!cmcl2!phri!cooper!gene
From: gene@cooper.UUCP (Gene from EK Enterprises)
Newsgroups: comp.arch
Subject: Re: What with these Vector's anyways?
Message-ID: <980@cooper.UUCP>
Date: Thu, 23-Jul-87 14:07:19 EDT
Article-I.D.: cooper.980
Posted: Thu Jul 23 14:07:19 1987
Date-Received: Sat, 25-Jul-87 09:16:21 EDT
References: <2806@phri.UUCP>
Organization: The Cooper Union (NY, NY)
Lines: 33

in article <2806@phri.UUCP>, roy@phri.UUCP (Roy Smith) says:
> [ ... ]
> elements in x and y.  On a scalar processor (i.e. Vax, Sun, etc) you would
> write:
> 
> 	for i goes from 1 to upper-limit-of-x,y,z
> 	do
> 		z[i] = x[i] * y[i]
> 	end
> [ ... ]
> 	Some problems vectorize easily, some don't.  If you have the type
> of problem that does, running it on a vector machine is a big win.  If you
> have the type of problem that doesn't, running it on a vector machine is
> just a good way to waste expensive hardware.

Ditto for some machines like the Convex C1 series. All you need is a nice
set of rather expensive compilers (C, FORTRAN, etc.) that automatically
optimize the _source_ code to make use of the vector hardware, and then
compile, making full use of the {improved|optimized} source.


					Gene

					...!ihnp4!philabs!phri!cooper!gene


	"If you think I'll sit around as the world goes by,
	 You're thinkin' like a fool 'cause it's case of do or die.
	 Out there is a fortune waitin' to be had.
	 You think I'll let it go? You're mad!
	 You got another thing comin'!"

			- Robert John Aurthur Halford