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=-0.0 required=3.0 tests=BAYES_40 autolearn=ham autolearn_force=no version=3.4.5-pre1 Date: 7 Aug 91 12:54:20 GMT From: convex!pelakh@uunet.uu.net (Boris Pelakh) Subject: Re: Ada in a C++ Interview Message-ID: <1991Aug07.125420.7791@convex.com> List-Id: In article <1991Aug7.121826.20660@batcomputer.tn.cornell.edu> lijewski@theory.T C.Cornell.EDU (Mike Lijewski) writes: > .... 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? > pragma BEGIN_COMPANY_SPEAK; The Convex Ada compiler will produce vector code that is alsmost as good as the one produced by our FORTRAN compiler. The main problem with vectorizing Ada code is the fact that the exception handling mechanism produces more branching possibilities within loops, thus inhibiting optimization. BTW, we also parallelize our programs either by spreading tasks across processors or parallelizing on the loop level. pragma END_COMPANY_SPEAK; I feel like a sales critter. *Cold Chill* -- Boris Pelakh "With a tough and smart lawyer, you can get Development Software Test two to three times the cash and benefits you pelakh@convex.com deserve !" - Personal Injury Att. Ad