Discuss the concept of computational granularity and communication latency. Further, discuss how the two concepts are related at various levels, e.g., instruction level, loop level, procedure level etc.
Q2:
Using Bernstein’s conditions, detect maximum parallelism between
the instructions of the following code:
P1: X = Y * Z
P2: P = Q + X
P3: R = T + X
P4: X = S + P
P5: V = Q / Z
Q3:
(i) Obtain Perfect Shuffle Permutation network of 32 nodes
(ii) Discuss, along with diagrams, clos network with 4x4 cross point switches.
Q4:
Discuss, along with diagram, an arithmetic pipeline for Multiplication
of two 8-digit fixed numbers.
Q5:
Define Bitonic sequence. Discuss a Bitonic sorting algorithm. Further,
using the algorithm, sort the following sequence: (8 Marks)
15,17,19,20,25,27,29,34,37,18,16,13,10,8,7,6,2
Q6:
Discuss the following with respect to a parallel virtual machine:
(i) Compiling and running of a PVM program
(ii) Message passing
(iii) Creating and managing Dynamic process groups
Q7:
Discuss important environment features for parallel programming.
Q8:
Discuss relative merits and demerits of various laws for measuring
speed up performance vis-à-vis to a parallel computer algorithm
system