You are on page 1of 2
G 980 : (Pages : 2) Time : see ee Sere 10. uu. B.TECH. DEGREE EXAMINATION, MAY 2014 Eighth Semester Branch ; Computer Science and Engineering CS 010 801 - HIGH PERFORMANCE COMPUTING (CS) (New Scheme-2010 Admissions) [Regular] Three Hours Maximum : 100 Marks Part A Answer all questions. Each question carries 3 marks. Explain Amdahl’s law. What is array processor? ‘What is dynamic pipelining? Distinguish Loosely coupled and Tightly coupled multiprocessors. Write a note on dataflow graphs. (6 x3 = 15 marks) Part B Answer all questions. Each question carries 5 marks. Explain the various challenges of parallel processing. Explain pipeline hazards. Explain SIMD matrix multiplication. Discuss any two inter process communication mechanisms. Explain the basic primitives of the dataflow graph. (6 x 5 = 25 marks) Part C Answer all questions. Each full question carries 12 marks. What is parallel processing? Discuss Indian contribution to parallel processing. Or Turn over 2 G 980 12, (a) Explain parallelism in uniprocessor systems. (b) Discuss the application of parallel processing. (6 +6 = 12 marks) 13. Explain in detail dynamic pipelines and reconfigurability. Or 14. a) Write a note on: (Vector processing. (ii) Linear pipelining. (b) Discuss instruction prefetch and branch handling concern to pipelining. (6 +6 = 12 marks) 15. (a) Explain the concept of parallel sorting on array processors. (b) Explain the architectural configuration of SIMD array processors. (6 +6 = 12 marks) Or 16. Write a rote on : (a) Associative array processing. (b) Cube interconnection networks. (6 +6= 12 marks) 17. With the help of neat diagrams, explain various interconnection networks used in multiprocessor systems. Or 18. (a) Discuss the language features to exploit parallelism in multiprocessor systems. (b) Explain process synchronization using semaphore. (6 +6 = 12 marks) 19. Briefly explain static and dynamic dataflow computers. Or 20. Explain the design alternatives to the dataflow approach. (5 x 12 = 60 marks}

You might also like