Path: utzoo!utgpu!jarvis.csri.toronto.edu!cs.utexas.edu!samsung!think!snorkelwacker!apple!rutgers!deimos!ux1.cso.uiuc.edu!ux1.cso.uiuc.edu!hirchert
From: hirchert@ux1.cso.uiuc.edu
Newsgroups: comp.lang.misc
Subject: Re: NOT Educating FORTRAN programme
Message-ID: <7300002@ux1.cso.uiuc.edu>
Date: 23 Jan 90 21:33:00 GMT
References: <9738@stealth.acf.nyu.edu>
Lines: 12
Nf-ID: #R:stealth.acf.nyu.edu:9738:ux1.cso.uiuc.edu:7300002:000:503
Nf-From: ux1.cso.uiuc.edu!hirchert    Jan 23 15:33:00 1990


brnstnd@stealth.acf.nyu.edu writes:
>The only problem with aliasing is parallel optimization.

Not true.  There are many sequential, scalar optimizations that are inhibited
by aliasing, including common subexpression elimination, removal of loop
invariants, strength reduction, and some forms of peephole instruction
scheduling.  In fact, there are few forms of optimization that aren't
inhibited by aliasing.

Kurt W. Hirchert     hirchert@ncsa.uiuc.edu
National Center for Supercomputing Applications