Download JNTUA B.Tech 4-2 R13 2018 April 13A05805 High Performance Computing Question Paper

FirstRanker's choice

Code: 13A05805

FirstRanker.com

--- Content provided by​ FirstRanker.com ---

B.Tech IV Year II Semester (R13) Regular & Supplementary Examinations April 2018

HIGH PERFORMANCE COMPUTING

(Common to CSE and IT)

Time: 3 hours

Max. Marks: 70

--- Content provided by‍ FirstRanker.com ---

PART - A

(Compulsory Question)

1. Answer the following: (10 X 02 = 20 Marks)

1. What is bisection width?
2. Explain the need for parallel computing.

--- Content provided by‌ FirstRanker.com ---

3. Write about scatter and gather operations.
4. Write about improving the speed of communication operators.
5. Write about MPI send() and MPI_recv() functions.
6. Write about condition variables in Pthreads.
7. Write about external sorting.

--- Content provided by⁠ FirstRanker.com ---

8. Can shell sort be parallelized? Explain.
9. Define minimum spanning tree.
10. Define 0/1 integer-linear-programming problem.

PART - B

(Answer all five units, 5 X 10 = 50 Marks)

--- Content provided by FirstRanker.com ---

UNIT - I

2. Explain dichotomy of parallel computing platforms.

OR

3. Explain in detail about achieving cache coherence in multiprocessor systems.

UNIT - II

--- Content provided by‍ FirstRanker.com ---

4. Explain in detail about decomposition techniques.

OR

5. Write about improving the speed of communication operators.

UNIT - III

6. Write a program to implement matrix multiplication using Pthreads.

--- Content provided by‌ FirstRanker.com ---

OR

7. Describe a message-transfer protocol for buffered sends and receives in which the buffering is performed only by the sending process. What kind of additional hardware support is needed to make these types of protocols practical?

UNIT - IV

8. Explain the DNS algorithm in detail.

OR

--- Content provided by⁠ FirstRanker.com ---

9. Explain parallel implementation of odd-even transposition sort on an n-process ring.

UNIT - V

10. Describe the algorithms for sparse graphs.

OR

11. Write about the anomalies in parallel search algorithms.

--- Content provided by⁠ FirstRanker.com ---

FirstRanker.com