CONFIDENTIAL CSIJUN 2015/CSC580 UNIVERSITI TEKNOLOGI MARA FINAL EXAMINATION COURSE : PARALLEL PROCESSING COURSE CODE : CSC580 EXAMINATION JUNE 2015 TIME 3 HOURS 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 invigitator. 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 D0 SO This examination paper consists of 4 printed pages (© Hak Cipta Universiti Teknologl MARA. CONFIDENTIALCONFIDENTIAL 2 CSIJUN 2018/CSC580 QUESTION 1 a) Define parallel computing (2 marks) b) Describe why parallel computing technology is important in designing today computer application. (6 marks) ©) Identify FOUR (4) examples on how parallel computing used in real world application. (4 marks) QUESTION 2 a) Define latency in interconnection networking. (2 marks) b) Explain THREE (3) types of latency for parallel processing. (6 marks) ©) Flynn's taxonomy distinguishes multi-processor computer architecture according to how they can be classified along two independent dimensions (instruction and data). Describe the parallel architecture proposed by Flynn's classification by showing the suitable example. (8 marks) QUESTION 3 a) Explain TWO (2) types of mapping techniques latency in interconnection networking, (4 marks) b) Draw the representation for perfect-shuffle topology using 8 processors. (8 marks) ©) Compare between recursive decomposition and speculative decomposition. Provide an example for each of the decomposition. (6 marks) (© Hak Cipta Universiti Teknologi MARA CONFIDENTIALCONFIDENTIAL 3 CSIJUN 2015/CSC580 d) Construct the following decomposition of sparse matrix-vector multiplication to the corresponding task-interaction graph. Task 0 4 a Task 11 (6 marks) QUESTION 4 a) Illustrate the following communication features with appropriate diagram. i) scatter ii) gather (6 marks) b) Synchronous message passing ensure messages are successfully passed from the source process to the destination process. Explain how the synchronous send and receive routines work in a pair of processes. Compose appropriate diagram to support your answer. (10 marks) ©) The execution time of a parallel algorithm depends not only on the input size of the problem but also on the architecture and number of available processing elements. Discuss on how speedup factor being used as performance measurement to evaluate parallel algorithms. (8 marks) (© Hak Cipta Universiti Teknologi MARA CONFIDENTIAL‘ CONFIDENTIAL, 4 CSIJUN 2015/CSC580 QUESTION 5 a) Explain minimum spanning tree (MST) for weighted undirected graph? (4 marks) b) Determine FOUR (4) algorithms that can be used to construct MST? (8 marks) ©) Generate MST for the following diagram using Prim’s algorithm. (12 marks) END OF QUESTION PAPER (© Hak Cipta Universit Teknologi MARA CONFIDENTIAL