On July 16, 2015 8:03:03 PM GMT+02:00, Toon Moene wrote:
>On 07/16/2015 12:53 PM, Richard Biener wrote:
>
>> On Sun, Jul 5, 2015 at 1:57 PM, Ajit Kumar Agarwal
>
>>> For the following code
>>> For(j = 0; j <= N;j++)
>>> {
>>> y = d[j];
>>> For( I = 0 ; I <8 ; i++)
>>> X(a[i]) =
On 07/16/2015 12:53 PM, Richard Biener wrote:
On Sun, Jul 5, 2015 at 1:57 PM, Ajit Kumar Agarwal
For the following code
For(j = 0; j <= N;j++)
{
y = d[j];
For( I = 0 ; I <8 ; i++)
X(a[i]) = X(a[i]) + c[i] * y;
}
Fig(1).
I think the issue here is dependences of X(A[i]) a
On Sun, Jul 5, 2015 at 1:57 PM, Ajit Kumar Agarwal
wrote:
> All:
>
> The scalar and array reduction patterns can be identified if the result of
> commutative updates
> Is applied to the same scalar or array variables on the LHS with +, *, Min or
> Max. Thus the reduction pattern identified with
