Path: utzoo!attcan!utgpu!news-server.csri.toronto.edu!rutgers!uwm.edu!ogicse!plains!hennebry
From: hennebry@plains.NoDak.edu (Michael J. Hennebry)
Newsgroups: comp.unix.cray
Subject: Re: vectorization of array maximum
Message-ID: <6161@plains.NoDak.edu>
Date: 6 Oct 90 16:22:35 GMT
References: <16279@thorin.cs.unc.edu>
Distribution: usa
Organization: North Dakota State University, Fargo
Lines: 46


Try something like this:

float
findmax(a, size) float a[]; int size; {

int j, inc, inc2;

for(inc=1, inc2=2; inc<size; inc=inc2, inc2<<=1) {
   for(j=0; j<size; j+=inc2) {
      if(a[j] < a[j+inc]) a[j]=a[j+inc];
   }
}

return a[0];
}

this works if size is a power of two and you don't mind destroying a.
whether it is efficient depends on whether the compiler can
tell that the inner loop is vectorizable. This depends on inc, inc2 > 0

another possibility is

float 
findmax(a, work, size) float[], work[]; int size; {

int j, inc, inc2;
float *to, *from, *temp;

from=a; to=work;

for(inc=1, inc2=2; inc<size; inc=inc2, inc2<<=1, temp=from, from=to, to=temp) {
   for(j=0; j<size; j+=inc2) {
      if(from[j] < from[j+inc]) to[j]=from[j+inc];
      else                      to[j]=from[j];
   }
}
return from[0];
}

Having two 'arrays' may cause the compiler to infer that the inner
loop is vectorizable.

-- 
Mike    hennebry@plains.NoDak.edu
"Megalomania is such a *wonderful* illness." -- Asmodeus Mogart