CONFIDENTIAL CSIJUN 2016/CSC580 UNIVERSITI TEKNOLOGI! MARA FINAL EXAMINATION COURSE : PARALLEL PROCESSING COURSE CODE : CSC580 EXAMINATION : JUNE 2016 TIME : 3HOURS INSTRUCTIONS TO CANDIDATES 1 This question paper consists of seven (7) 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 i) the Question Paper ii) 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 6 printed pages (© Hak Cipta Universiti Teknologi MARA CONFIDENTIALCONFIDENTIAL, 2 CSIJUN 2016/CSC580 QUESTION 1 a) Describe why parallel computing technology is important in developing computer application (4 marks) b) List TWO (2) major problems requiring the use of supercomputing in the following domains: i) Engineering and design applications. ii) Scientific applications. ii) Commercial Applications. (6 marks) QUESTION 2 a) Implicit parallelism employs multiplicity to alleviate performance bottleneck in computer ‘system while hiding the process entirely from the programmer. ’) Describe how multiplicity can be achieved by using pipelining technique. (2 marks) ji) Briefly explain the technique that expands the execution rate of multiple pipelining. (2 marks) ili) Differentiate between vertical and horizontal waste that limits the performance of the above technique. (4 marks) b) Parallel random access machine (PRAM) models can be divided into four subclasses, out of four PRAM models, which model is the most powerful? Justify your answer. (4 marks) (© Hak Cipta Universiti Teknologi MARA, CONFIDENTIAL,CONFIDENTIAL, 3 CSIJUN 2016/¢SC580 ©) Consider the Flynn's architecture below: PE Gtova ———CF8 control unit “XMOAMLAN NOLLOANNOOUALNI PE i) Determine the type of the above architecture. (1 mark) ii) State TWO (2) advantages of c(i). (4 marks) QUESTION 3 Decomposition is a process of dividing a computation into smaller parts, some or all of which could be executed in parallel. a) Given the sequence of numbers: 10, 4,6, 11, 20, 18, 13, 9, 7, 22, 17,2 Draw task-dependency graph to sort the numbers in ascending order using Quicksort recursive decomposition. (10 marks) (© Hak Cipta Universiti Teknologi MARA CONFIDENTIAL,CONFIDENTIAL, 4 CSIJUN 2016/CSC580 b) Given the following diagram: 2/9) Fol lo} | Database Transactions |r|] n|z\0] iN) lojz[olJele]ofo]ol> <[2|I0} ‘<| Itemsets S}<|-<|5| i} <{c| N Itemset Frequency ola>|>|>|>[5]A [> olr|z|zlololm|r|o) im|Zlo| eCoanancoses D\o}-0) Palen|=4 Elo} Ic}-o} la lo} Draw the diagrams to show how the task can be decomposed into two by: i) Partitioning the output data. ( marks) li) Partitioning the input data. (5 marks) QUESTION 4 a) In planning a mapping scheme, describe the differences between static and dynamic task generation to construct a good parallel algorithm. (4 marks) b) Discuss THREE (3) techniques that can be used to reduce the interaction overheads incurred by parallel programs. (6 marks) ¢) Differentiate between data parallelism and task parallelism in parallel algorithm model. (4 marks) QUESTION 5 a) Blocking message passing operation is a simple solution to avoid issues during send and receive operations. Describe TWO (2) mechanisms in which blocking message passing can be achieved. Draw appropriate diagram to support your answer. (8 marks) b) Describe the usage of message passing function MpI_Barrier (4 marks) (© Hak Cipta Universiti Teknologl MARA CONFIDENTIALCONFIDENTIAL 5 SHUN 2016/CSC580 QUESTION 6 a) A computer program that counts the occurrence of words in a social networking website took a total of 120 seconds to complete when executed in sequential. However, the program took 65, 45, 38 seconds when executed in parallel using 2, 3, and 4 computers respectively. i) Calculate the speedup for the parallel program when employing 3 computers for execution. (2 marks) ii) Calculate the efficiency for the parallel program when employing 4 computers for execution. (2 marks) b) Consider the following adjacency lst diagram tL eeL RE Zum es Fa 3 +2 {4 4] bo i) Draw graph representation for the above diagram. (6 marks) ii) Determine whether itis either directed or undirected graph (1 mark) QUESTION 7 Given the following graph: (© Hak Cipta Universiti Teknologi MARA CONFIDENTIALCONFIDENTIAL, 6 CSIJUN 2016/CSC580 a) Find the weighted adjacency matrix for the above graph. (4 marks) b) Draw the minimum spanning tree (MST) using Prim’s algorithm. (8 marks) ©) Show the parallel formulation to parallelize the above algorithm, (4 marks) END OF QUESTION PAPER (© Hak Cipta Universiti Teknologi MARA CONFIDENTIAL,