1 (a)
Draw and explain architecture of Uniform Memory Access (UMA) and Non-
Uniform Memory Access (NUMA).
7 M
1 (b)
Enlist various decomposition techniques. Explain exploratory decomposition
with suitable example.
7 M
2 (a)
With suitable diagram and example, explain All-to-All Broadcast and All-to-All
Reduction.
7 M
2 (b)
Enlist and explain in brief, the various PRAM models.
7 M
2 (c)
Enlist and discuss different parallel algorithm models in detail.
7 M
3 (a)
Explain: Performance metrics for parallel systems.
7 M
3 (b)
Discuss buffered non-blocking and non-buffered non-blocking send/receive
message passing operations with suitable diagram.
7 M
3 (c)
What is isoefficiency function? Derive equation of isoefficiency function.
7 M
3 (d)
Explain following MPI routines with arguments.
I. MPI_Send II. MPI_Recv III. MPI_Sendrecv.
I. MPI_Send II. MPI_Recv III. MPI_Sendrecv.
7 M
4 (a)
In context to Pthread, Explain normal, recursive and error check mutex.
7 M
4 (b)
Explain Cannon's algorithm for matrix multiplication.
7 M
4 (c)
Explain following functions with respect to Pthreads API.
I. pthread_create() II. pthread_join()
I. pthread_create() II. pthread_join()
7 M
4 (d)
Explain DNS algorithm.
7 M
5 (a)
Explain Bitonic sort with example.
7 M
5 (b)
Explain Prim's algorithm for minimum spanning tree.
7 M
5 (c)
Explain Odd-Even Transposition sort Algorithm.
7 M
5 (d)
Explain parallel formulations of Dijkstra's algorithm.
7 M
More question papers from Parallel Processing