Difference: CS255Assign1 (1 vs. 6)

Revision 62008-04-02 - XiaomingGu

Line: 1 to 1
 

Assignment 1

Added:
>
>
  • Deadline: April 16. Please put your answer into Xiaoming's mailbox (tagged by X.GU) in CS department mailroom.
 

1. Give the distance vectors in the following two loop nests.

Revision 52008-04-02 - ChenDing

Line: 1 to 1
 

Assignment 1



Line: 34 to 34
 
3. Define may and must problems, flow-sensitive and flow-insensitive problems in interprocedural analysis. Define and classify the problems of MOD, USE and KILL.
Changed:
<
<
4. Build up control dependence graph for the following control flow graph.
>
>
4. Build the control dependence graph for the following control flow graph.
 
                                                          1
                                                        /   \

Revision 42008-04-02 - XiaomingGu

Line: 1 to 1
 

Assignment 1



Line: 33 to 33
 
3. Define may and must problems, flow-sensitive and flow-insensitive problems in interprocedural analysis. Define and classify the problems of MOD, USE and KILL.
Changed:
<
<
>
>

4. Build up control dependence graph for the following control flow graph.
                                                          1
                                                        /   \
                                                       /     \
                                                      2       3
                                                     /  \    /  \
                                                    /    \  /    \
                                                   4       5      6
                                                    \       \    /
                                                     \       \  /
                                                      7       8
                                                        \    /
                                                         \  /
                                                          9

Revision 32008-04-02 - ChenDing

Line: 1 to 1
 

Assignment 1



Changed:
<
<
1. Please show the distance vectors in the following two loop nests.
>
>
1. Give the distance vectors in the following two loop nests.
 
do i = 2, n
    do j = 1, n-1
Line: 17 to 17
 end do
Changed:
<
<
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.
>
>
2. Write down the basic vectorization algorithm and the basic condition for a loop to be parallelizable (Hint: use direction vectors). Apply the basic vectorization for the following two loop nests. In addition, for each loop check whether it is parallelizable, that is, whether its iterations can be executed in parallel.
 
do i = 1, n
    do j = 2, n
Line: 32 to 32
 end do
Changed:
<
<
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.
>
>
3. Define may and must problems, flow-sensitive and flow-insensitive problems in interprocedural analysis. Define and classify the problems of MOD, USE and KILL.
 
Deleted:
<
<
-- XiaomingGu - 02 Apr 2008

Revision 22008-04-02 - XiaomingGu

Line: 1 to 1
Deleted:
<
<
 

Assignment 1



Line: 18 to 17
 end do
Changed:
<
<
2. Please give the principle on direction vector to parallelize loop nests, then apply it to the following two loop nests and discuss the difference.
>
>
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
Line: 33 to 32
 end do
Changed:
<
<
3.
>
>
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

Revision 12008-04-02 - XiaomingGu

Line: 1 to 1
Added:
>
>

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 vector to parallelize loop nests, then apply it to the following two loop nests and discuss the difference.
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.

-- XiaomingGu - 02 Apr 2008

 
This site is powered by the TWiki collaboration platform Powered by PerlCopyright © 2008-2017 by the contributing authors. All material on this collaboration platform is the property of the contributing authors.
Ideas, requests, problems regarding URCS? Send feedback