From mboxrd@z Thu Jan  1 00:00:00 1970
X-Spam-Checker-Version: SpamAssassin 3.4.5-pre1 (2020-06-20) on
	ip-172-31-74-118.ec2.internal
X-Spam-Level: 
X-Spam-Status: No, score=-1.9 required=3.0 tests=BAYES_00,MSGID_SHORT
	autolearn=no autolearn_force=no version=3.4.5-pre1
Date: 7 Aug 91 14:30:42 GMT
From: lib!cshotton%oac.hsc.uth.tmc.edu@tmc.edu  (Chuck Shotton)
Subject: Re: Ada in a C++ Interview
Message-ID: <5283@lib.tmc.edu>
List-Id: <comp.lang.ada>

In article <1991Aug7.121826.20660@batcomputer.tn.cornell.edu>, lijewski@theory.
TC.Cornell.EDU (Mike Lijewski) writes:

[Stuff deleted]

> plenty of code.  The first rule is always to make the code as highly
> vectorized as possible.  Only then do you worry about parallelizing the
> code.  The rationale being that parallelization always introduces overhead
> of its own, so you want the code to run as fast as possible before taking
> that step.  My experience is that well vectorized code is both more
> efficient and maintainable, even on scalar machines.  So the question is,
> are there any Ada compilers which produce highly vectorized code, on say
> Crays, IBM 3090s or any of the other vector machines?
> 
I feel that I'm significantly ignorant of parallel processing to ask the
following FAQ:

Exactly what is involved in "vectorizing" code? Particularly, Ada code.