STUPIDSID
1(a)
Explain message passing and shared-address-space computers with neat sketches. Differentiate between these two computers.
7 M
1(b)
Draw and explain architecture of Uniform Memory Access (UMA) and Non- Uniform Memory Access (NUMA) shared-address-space computers with applicable caches and memories.
7 M
2(a)
Explain mutual exclusion for shared variable in Pthreads.
7 M
Solve any one question from Q.2(b) & Q.2(c)
2(b)
Explain scatter and gather communication operation.
7 M
2(c)
Enlist and discuss different parallel algorithm models in detail.
7 M
Solve any one question from Q.3 & Q.4
3(a)
Explain Dijkstra's Algorithm for Single-Source Shortest Paths
7 M
3(b)
Discuss Different performance metrics for parallel systems.
7 M
4(a)
Explain sending and receiving messages using MPI.
7 M
4(b)
Explain invalidate protocol used for cache coherence in multiprocessor system.
7 M
Solve any one question from Q.5 & Q.6
5(a)
Discuss buffered non-blocking and non-buffered non-blocking send/receive message passing operations with neat sketches.
7 M
5(b)
What is sorting network? Explain bitonic sort.
7 M
6(a)
Explain thread creation, termination and cancellation in detail in shared- address-space supported parallel systems.
7 M
6(b)
Define Isoefficiency function and derive equation of it.
7 M
Solve any one question from Q.7 & Q.8
7(a)
Explain various decomposition techniques. Explain data decomposition with suitable example.
7 M
7(b)
Explain odd-even sort in parallel environment and comment on its limitation.
7 M
8(a)
Discuss the parallel algorithm for Prim's algorithm and compare its complexity
with the sequential algorithm for the same.
7 M
8(b)
Explain multistage network topology.
7 M
More question papers from Parallel Processing