# Assignment 1

1. Please show the distance vectors in the following two loop nests.
```do i = 2, n
do j = 1, n-1
a[i,j] = a[i,j] + a[i-1,j+1]
end do
end do

do i = 1, n
do j = 2, n-1
a[j] = (a[j] + a[j-1] + a[j+1])/3
end do
end do
```

2. Please give the principle on direction vectors to parallelize loop nests, then apply it to the following two loop nests and discuss the differences.
```do i = 1, n
do j = 2, n
a[i,j] = a[i,j-1] + c
end do
end do

do i = 1, n
do j = 1, n
a[i,j] = a[i-1,j] + a[i-1,j+1]
end do
end do
```

3. Please use MOD, USE and KILL to discuss the differences between may problems and must problems, and the differences between flow-sensitive problems and flow-insensitive problems.

-- XiaomingGu - 02 Apr 2008

Edit | Attach | Watch | Print version |  | Backlinks | Raw View | Raw edit | More topic actions...
Topic revision: r2 - 2008-04-02 - XiaomingGu

 Home Main Web View Edit Account
 Edit Attach
Copyright © 2008-2018 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding URCS? Send feedback