CONFIDENTIAL al CSIJUN 2018/6SC580 UNIVERSITI TEKNOLOGI MARA FINAL EXAMINATION COURSE : PARALLEL PROCESSING COURSE CODE : CSC580 EXAMINATION : JUNE 2018 TIME : 3HOURS INSTRUCTIONS TO CANDIDATES 1 This question paper consists of five (5) questions, 2 ‘Answer ALL questions in the Answer Booklet. Start each answer on a new page. 3. Do not bring any material into the examination room unless permission is given by the invigilator. 4 Please check to make sure that this examination pack consists of: |) the Question Paper il) an Answer Booklet ~ provided by the Faculty 5 ‘Answer ALL Questions in English. DO NOT TURN THIS PAGE UNTIL YOU ARE TOLD TO DO SO This examination paper consists of 4 printed pages (© Hak Cipta Universiti Teknologi MARA CONFIDENTIAL,CONFIDENTIAL 2 CSIJUN 2018/CSC580 QUESTION 1 a) Compare between serial computing and parallel computing. (2 marks) b) Explain TWO (2) major problems requiring the use of parallel computing in scientific applications. (4 marks) ©) List FOUR (4) main reasons for using parallel computing. (4 marks) QUESTION 2 a) Explain TWO (2) advantages of super scalar execution in parallel computing, (4 marks) b) List TWO (2) examples of static interconnection networks and TWO (2) examples of dynamic interconnection networks. (4 marks) ©) Differentiate between the programming models of SIMD and MIMD. Explain how the programming models operate on NUMA and UMA architectures by illustrating the two architectures using a diagram. (8 marks) QUESTION 3 a) In parallel computing, granularity of a task is a measure of the amount of computation which is performed by that task. Describe TWO (2) types of granularity for tasks decompositions in parallel computing, (4 marks) b) Distinguish between speculative and exploratory decomposition techniques. (4 marks) (© Hak Cipta Universiti Teknolog! MARA, CONFIDENTIALCONFIDENTIAL 3 CSIJUN 2018/CSC580 ©) Given the following task dependency graph Task Task2 —Task3 Tasks Discuss THREE (3) mapping strategies to assign the tasks above to processors so that the parallel execution time can be minimized, (6 marks) d) Reducing the interaction overhead among concurrent tasks is important for an efficient parallel algorithm, Define interaction overhead and explain THREE (3) techniques that can be used to reduce the interaction overheads incurred by parallel programs. (8 marks) QUESTION 4 a) Define a thread and list TWO (2) characteristics of a thread. (4 marks) b) Differentiate between asynchronous and synchronous messaging in a message passing system. (4 marks) ©) Scatter and broadcast are examples of MPI collective communication methods. Compare between scatter and broadcast by illustrating them using the appropriate diagrams. (4 marks) (© Hak Cipta Universiti Teknologi MARA CONFIDENTIALCONFIDENTIAL 4 CSIJUN 2018/CSC580 4) Explain THREE (3) advantages of threaded applications over message passing programming models. (6 marks) ) Two types of message passing methods are blocking and non-blocking. Explain the differences between the two methods. Draw appropriate diagram to support your answer. (8 marks) QUESTION 5 a) Analytical modeling is a common issue in performance evaluation of parallel systems. Explain TWO (2) elements used in modeling the performance of parallel programs. (4 marks) b) Consider the problem of sorting numbers using parallel bubble sort algorithm. Assume that the serial time for bubble sort is 160 seconds and the parallel time for parallelization of bubble sort on 4 processors is 40 seconds. Calculate the speed up and efficiency of the parallel system. Based on the results, determine the type of the parallel system and explain your answer. (6 marks) ©) Given the following weighted undirected graph: i) Draw the weighted adjacency matrix for the graph. (4 marks) ji) Find the shortest paths from vertex A to vertex F using Dijkstra’s algorithm. Draw and determine the minimum-weight of the paths. (8 marks) iil) Show the parallel formulation to parallelize the algorithm above. (4 marks) END OF QUESTION PAPER (© Hak Cipta Universiti Teknologi MARA CONFIDENTIAL