Parallel Processing

Time: 30 min Test#02 Marks:12

Q1. Let the mask register of a SIMD machine has value 11010110. How many PEs are there in this SIMD machine?[1]
Q2. Vectorize following code [3]
for i:=0 step 1 until N-1
for j:=0 step 1 until M-1
if(a[i,j]=b[i,j]) then
a[i,j]=a[i,j]+1;
Q3. In most practical cases speedup is subliner speedup. Why?[1]
Q4. Transform expression a*b+c*d*e/f+g+h using commutative, associate and distributive properties of + &*. Hence find
minimum number of processor to evaluate expression in minimum time.[4]
Q5. Draw data dependence graph and apply Bernstein’s conditions to find set of statements that can be executed in parallel.[3]
S1: B=C*D S3: Y= C+D
S2: X=B+C S4: X=Y*2

Parallel Processing
Time: 30 min Test#02 Marks:12
Q1 Let the mask register of a SIMD machine has value 11010100. Which of the PEs will execute following instruction?(Assume
PE numbering starts from 0) [1] a[i]=a[i]*2 (0≤ I ≤N/mask[i])
Q2. Vectorize following code [3]
for k:=0 step 1 until N-1
if( a[k]=b[k]) then
a[k]:=1
else
a[k]:=b[k]
Q3. Why MIPS is not a good performance measure?[1]
Q4. Transform expression a+c/b+(d*e)/f+g using commutative, associate and distributive properties of + &*. Hence fine
minimum number of processor to evaluate expression in minimum time.[4]
Q5. Draw data dependence graph and apply Bernstein’s conditions to find set of statements that can be executed in parallel.[3]
S1: A=B*B S3: X=Y+B
S2:A=A+1 S4: B=Y+Z

Parallel Processing
Time: 30 min Test#02 Marks:12
Q1. Let Len register for SIMD machine has value 101 2. How many PEs are there in this SIMD machine?[1]
Q2. Find storage layout for following vector code[3]
Sum[j]:=0;
for i:=0 step 1 until N-1
sum[i]:=sum[i]+ x[i,j]+y[j,i]; ( 0≤ j ≤ N-1 )
Q3. Apply Upper-Lower prefix Algorithm to find prefix sum of 6 numbers (i.e n=6). Also find depth.[4]
Q4. Is it possible to achieve a superliner speed up? How?[2]
Q5. Calculate efficiency of a multi processor system having 50 processors and running a program containing 15% sequential
code. Use Amdhal’s law [2]

Parallel Processing
Time: 30 min Test#02 Marks:12
Q1. Let Len register for SIMD machine has value 100 2.. How many PEs are enabled to execute some instruction?[1]
Q2. . Find storage layout for following vector code[3]
for k:=0 step1 until 4
x[k,j]:=a[j,k]+ b[j,k]; ( 0≤ j ≤ N )
Q3. Apply Odd-Even prefix Algorithm to find prefix sum of 7 numbers (i.e n=7).Also find depth[4]
Q4. What are the situations in which a super liner speedup is achieved?[2]
Q5.How many processors are required to achieve a speedup of 20, if serial fraction is 10%. Use Gustafson-Barsis law.[2]
 Parallel Processing
Time: 30 min Test#03 Marks:12
Q1. Differentiate direct & indirect n/w. Give example of each.(2)
Q2. Diameter of a fully connected network is ______ (1, 2, n) (1)
Q3. Draw a 3-ary 3-fly network. (6)
Q4. Suppose you need to route a message from source=11011 to dest=10101 on a 5D hypercube. Apply necessary algo and find
out the route (3)
_________________________________________
Parallel Processing
Time: 30 min Test#03 Marks:12
Q1. Why study of interconnection n/w is important?(2)
Q2. Butterfly network is a direct network. (T/F) (1)
Q3. Draw a 16x16 Omega network (6)
Q4. Suppose you need to route a message from source=10011 to dest=01010 on a 5D hypercube. Apply necessary algo and find
out the route(3)

Parallel Processing
Time: 30 min Test#03 Marks:12
Q1. What do you understand by the characteristic ‘Recursive Structure’ of hypercube?(1)
Q2. In ICN , channel delay is ____ dependent (HW,SW)(1)
Q3. Draw a 2-ary 4- fly network(5)
Q4.Calculate Havg & diameter for the following network.(5)

_________________________________
Parallel Processing
Time: 30 min Test#03 Marks:12
Q1. Classify following into direct & indirect n/w.(2)
Mesh, Omega, Crossbar, Ring
Q2. In an indirect network, every node is a combined node(T/F) (1)
Q3. Suppose you need to route a message from source=1101 to dest=10001 on a binary tree. Apply necessary algo and find out
the route (4)
Q4. Draw a 6,4-ary 2-cube network (2)
Q4.Calculate Havg for the following network.(3)

_________________________________________