I have the need to parallelize as much as I can (in order to make it run fast) the following part of an algorithm:

```
do i=1, n
  do j=1, n
    A[i, j] = A[i-4, j-4] + A[i-3, j-3] + B[i, j]
  end do
end do

```

I was thinking that the best i could do here is a loop skewing (but with what factor?) and loop interchange that would allow me to finally have a DOALL on the inner loop. Any feedack and help regarding those thoughts?