SPPU Computer Engineering (Semester 8)
High Performance Computing
May 2017
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


Solve any one question from Q.1(a,b) &Q.2(a,b)
1(a) What are applications of Parallel Computing?
4 M
1(b) Explain Granularity, Concurrency, and Dependency Graph
6 M

2(a) What are principles of Message Passing Programming
6 M
2(b) Explain Non-Blocking communications using MPI.
4 M

Solve any one question from Q.3(a,b) &Q.4(a,b)
3(a) Describe Logical Memory Model of a thread?
7 M
3(b) Why synchronization in important? Enlist Thread APIs for Mutex Synchronization.
8 M

4(a) Implement Merge sort using synchronization primitives in Pthreads.
7 M
4(b) IIIustrate importance of read- write lock of Shared address space Model.
8 M

Solve any one question from Q.5(a,b) &Q.6(a,b)
5(a) What are different partitioning techniques used in Matrix-Vector Multiplication.
7 M
5(b) Dexcribe Cannon's Algorithm for Matrix multiplication with suitable example.
8 M

6(a) Describe different techniques for Latency Hiding.
7 M
6(b) How Latency Hiding is different than Latency Reduction?
8 M

Write short note any two question from Q.7(a)(i,ii,iii) Solve any one question from Q.7(a,b) &Q.8(a,
7(a)(i) Parallel Depth-First-Search.
8 M
7(a)(ii) Search Overhead Factor.
8 M
7(a)(iii) Power Aware Processing.
8 M
7(b) Elucidate Thread Organization in detail.
5 M

Write short note any two question from Q.8(a) (i,ii, iii)
8(a)(i) Distributed Memory.
8 M
8(a)(ii) Optical Computing.
8 M
8(a)(iii) Green Computing.
8 M
8(b) Intricate sorting issues in parallel computers.
5 M



More question papers from High Performance Computing
SPONSORED ADVERTISEMENTS