Solution for 2.

12a (last 4 slides)

http://www.scribd.com/doc/6677221/Parallel-Processing-PART-4new

(Ignore 2.12c, not part of your syllabus)

Solution for 2.4c:

Only any two adjacent iterations asked, hence assume first two iterations.

Iterations  I=1 I=2

Statements

S1 A(2)=B(0)+C(1)

S2 B(1)=A(1) X K

S3 C(1)=B(1) - 1

S1(i+1) A(3)=B(1)+C(2)

S2 (i+1) B(2)=A(2) X K

S3 (i+1) C(2)=B(2) - 1

1. Flow dependency:

S1  S2 (i+1)

S2  S3

S2  S1 (i+1)

S2 (i+1)  S3 (i+1)

2. Anti dependency:

S1 S3

S3(i+1) S1(i+1)

3. O/p dep: None

4. I/o dep: None

5. Unknown dep: None (DRAW THE DIAGRAM ACCORDINGLY)