GTU Computer Engineering (Semester 8)
Parallel Processing
May 2016
Total marks: --
Total time: --
INSTRUCTIONS
(1) Assume appropriate data and state your reasons
(2) Marks are given to the right of every question
(3) Draw neat diagrams wherever necessary


1 (a) Explain the physical organization of Parallel Platforms.
7 M
1 (b) Explain pipelining and superscalar execution with suitable examples.
7 M

2 (a) Explain One-to-all broadcast and all-to-one reduction communication with suitable examples.
7 M
Solve any one question from Q2(b) & Q2(c)
2 (b) Explain various data decomposition techniques used to achieve concurrency with examples.
7 M
2 (c) Discuss different parallel algorithm models in detail.
7 M

Solve any two question from Q3(a), Q3(b) & Q3(c), Q3(d)
3 (a) Explain the effect of granularity on performance for addition of n numbers using p processing element
7 M
3 (b) Discuss different performance metrics of parallel systems.
7 M
3 (c) Differentiate blocking and non-blocking message passing operations.
7 M
3 (d) Write a short note on Message Passing Interface.
7 M

Solve any two question from Q4(a), Q4(b) & Q4(c), Q4(d)
4 (a) Explain the various collective communication operations provided by MPI.
7 M
4 (b) Explain the concept of barriers and read-write locks.
7 M
4 (c) Explain following functions with respect to Pthreads API. Also discuss arguments of these functions.
i. pthread_create()
ii. pthread_join()
7 M
4 (d) Write a note on Synchronization primitives in POSIX.
7 M

Solve any two question from Q5(a), Q5(b) & Q5(c), Q5(d)
5 (a) Explain Cannon's Algorithm for Matrix-Matrix Multiplication.
7 M
5 (b) Explain bubble sort and its variants.
7 M
5 (c) Explain bitonic sort with example.
7 M
5 (d) Write an algorithm for Single-Source Shortest Paths.(Dijkstra's Algorithm).
7 M



More question papers from Parallel Processing
SPONSORED ADVERTISEMENTS