Question Paper Code : 71694 B.E/B Tech. DEGREE EXAMINATION, APRIL/MAY 2017. Eighth Semester Computer Science and Engineering CS 6801 -- MULTI-CORE ARCHITECTURES AND PROGRAMMING (Regulations 2013) Time : Three hours ~~ Maximum : 100 marks Answer ALL questions. PART A— (10 x 2= 20 marks) Define Vector instructions. What do you snooping cache cian What is data sharing? Difference between deadlacks tad livelocks. Write a “hello,world” program iat uses OpenMP. Define Odd-even transposition sort. What isu wrappergbript? What are the possibilities for choosing a destination when sending requests for work with MPI? Define NP-complete problem. Writp a Pseudocode for a recursive solution to TSP using depth-first. search.ne 12, 13, 14. 15. @ ©) (@ ©) (a) o) @) &) @) PART B — (6x 16 = 80 marks) Explain in detail about interconnection networks. Or @) Write a short notes about MIMD system. ® (i) Explain parallel program design with an example. ® Explain the data races and scalability in parallel program. Or Explain in detail about the synchronization s in parallel program challenges. : Explain OpenMP directives. © Or How data and functional parallelis handled in shared memory programming with opénMP? ‘F @) Explain tree structured coi ea ®) (i) What are the diffe: oe point to point and collective - communication? @ Explain the aluation of MPI programs. ® Gi) What are the issues in multi core processors? ® @ Howto the basic solver using MPI? ® «@ lon-recursive depth-first search. ® plementation of tree search Using MPJ and dynamic 2 71694