0% found this document useful (0 votes)
50 views2 pages

HPC May

Uploaded by

Prathamesh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
50 views2 pages

HPC May

Uploaded by

Prathamesh
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Total No. of Questions : 8] SEAT No.

8
23
P-558 [Total No. of Pages : 2

ic-
[6004]-493

tat
7s
B.E. (Computer Engineering)

9:2
02 91
High Performance Computing

4:2
0
(2019 Pattern) (Semester - VIII) (410250)

31
7/0 13
0
Time : 2½ Hours] [Max. Marks : 70
6/2
.23 GP

Instructions to the candidates:


1) Answer Q.1 or Q.2, Q.3 or Q.4, Q.5 or Q.6, Q.7 or Q.8.
E
80

8
2) Neat diagrams must be drawn wherever necessary.
C

23
3) Figures to the right indicate full marks.

ic-
16

tat
8.2

7s
Q1) a) Explain with diagram One-to-all broadcast on an eight-node ring with
.24

9:2
91
recursive doubling technique. Node 0 is the source of the broadcast.
49

4:2
Also Explain all to one reduction with node 0 as destination. [7]
30
31

b) Explain in detail Blocking and Non-Blocking Communication Using


01
02

MPI. [6]
6/2
GP

c) Write a short note on prefix-sum operation. [4]


7/0
CE

OR
80

8
23
.23

Q2) a) What is all to all broadcast communication operation? Explain all to


all broadcast on an eight node ring with step wise diagrams. (Show ic-
16

tat
first two steps and last communication step). [7]
8.2

7s
.24

9:2

b) Explain scatter and gather communication operation with diagram. [6]


91
49

4:2

c) Explain circular shift operation? [4]


30
31
01
02

Q3) a) Explain parallel Matrix —Matrix multiplication algorithm with


6/2
GP

example? [7]
7/0

b) Explain different performance Metrics for Parallel Systems. [6]


CE
80

c) Explain Minimum Execution Time and Minimum Cost Optimal


.23

Execution Time. [4]


16
8.2

OR
.24
49

P.T.O.
Q4) a) What is granularity? What are effects of granularity on performance of

8
parallel systems? [7]

23
ic-
b) Explain various sources of overhead in parallel systems? [6]

tat
c) Explain “Scaling Down (downsizing)” a parallel system with example.

7s
[4]

9:2
02 91
4:2
0
Q5) a) What is CUDA? Explain different programming languages support in

31
7/0 13
CUDA. Discuss any three applications of CUDA. [8]
0
b) Describe processing flow of CUDA-C program with diagram. [6]
6/2
.23 GP

c) Explain the following terms in CUDA: device, host, device code,


E

Kernel. [4]
80

8
C

23
OR

ic-
16

Q6) a) Explain CUDA memory model. Discuss thread hierarchy. [8]

tat
8.2

7s
b) What is block dimension and grid dimension in CUDA? Write a CUDA
.24

9:2
kernel for addition of two vectors and explain how it will calculate addition
91
using threads. [6]
49

4:2
30

c) What is a Kernel in CUDA? What is kernel launch? Explain arguments


31

that can be specified in a Kernel launch. [4]


01
02
6/2
GP
7/0

Q7) a) Explain odd-even transportation in bubble sort using parallel


CE

formulation. Give one stepwise example solution using odd-even


80

8
23
transportation. [8]
.23

b) Explain Parallel Depth First Search algorithm in detail? ic-


[6]
16

tat
8.2

7s

c) What is Kubernets? Explain its features and applications. [4]


.24

9:2

OR
91
49

4:2

Q8) a) Write short notes on : [8]


30
31

i) Parallel Merge sort


01
02

ii) GPU applications


6/2
GP
7/0

b) What are the issues in sorting on parallel computers? Explain with


CE

appropriate example? [6]


80

c) Explain parallel BFS algorithm in brief.


.23

[4]
16
8.2


.24
49

[6004]-493 2

You might also like