Total No. of Questions : 4] SEAT No.

:
PD-265 [Total No. of Pages : 2

2
24
[6411]-40

:22
:39
B.E. (Computer Engineering) (Insem.)

1
13
HIGH PERFORMANCE COMPUTING

/03 87
25
(2019 Pattern) (Semester - VIII) (410250)
3
/20
01
Time : 1 Hour] [Max. Marks : 30
2.2 GP

Instructions to the candidates :

10

1) Answer Q. 1 or Q. 2, Q. 3 or Q. 4
.22 CE

42

2) Neat diagrams must be drawn wherever necessary.

3) Figures to the right indicate full marks.

2
8.7

24
4) Assume suitable data, if necessary.

:22
43

:39
Q1) a) What are types of dataflow execution models? [6]
71
13
b) Explain SIMD, MIMD and SIMT architectures. [5]
38
25
/20
01

c) Write a short note on Level of Parallelism. [4]

/03
GP

OR
10
CE
42

Q2) a) Explain N-wide Superscalar Architectures. [6]

2.2

2
8.7

b) Explain Cache coherence in multiprocessor system. 24 [5]

.22

:22

c) What are the application of parallel computing? [4]

43

:39
71
13
38
25

Q3) a) Explain any three-decomposition technique with example. [6]

/20
01
/03

b) Explain classification of Dynamic mapping techniques. [5]

GP
10

c) What are characteristics of task and interaction? [4]

CE
42
2.2

OR
8.7
.22

P.T.O.
43
Q4) a) Explain with example (any two) : [6]
i) Recursive decomposition

2
24
ii) Data decomposition

:22
iii) Exploratory decomposition

:39
b) Explain different schemes for Static Mapping. [5]

1
13
/03 87
c) Give the characteristics of task. [4]

25
3
/20
01
♦♦♦
2.2 GP
10
.22 CE

42

2
8.7

24
:22
43

:39
71
13
38
25
/20
01
/03
GP
10
CE
42
2.2

2
8.7

24
.22

:22
43

:39
71
13
38
25
/20
01
/03
GP
10
CE
42
2.2
8.7
.22
43

[6411]-40 2