CONFIDENTIAL | CSIDEC 2014/CSC580 UNIVERSITI TEKNOLOGI MARA FINAL EXAMINATION ‘COURSE : PARALLEL PROCESSING COURSE CODE : CSC580 EXAMINATION : DECEMBER 2014 TIME 3 HOURS INSTRUCTIONS TO CANDIDATES 1 This question paper consists of six (6) 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 DO NOT TURN THIS PAGE UNTIL YOU ARE TOLD TO DO SO This examination paper consists of 6 printed pages ‘© Hak Cipta Universit Teknolog! MARA CONFIDENTIALCONFIDENTIAL 2 CSIDEC 2014/¢SC580 QUESTION 1 a) Define instruction stream and data stream in parallel processing. (4 marks) b) Explain FOUR (4) machine organizations listed by Flynn's. (8 marks) QUESTION 2 a) State the difference between the following terminologies associated with pipeline computers: i) Static pipeline vs. Dynamic pipeline ii) Unifunctional pipeline vs. Multifunctional pipeline iii) Instruction pipeline vs. Vector pipeline (@ marks) b) Consider the following diagram. > P -;-—_ ar M c : M P : F Zz € M k¥——~ § k++ ‘ a |i 3 a z i M Y c (a) (b) i) Identify diagram (a) and diagram (b) of shared-address-space architectures. (2 marks) ji) Describe diagram (a) and diagram (b). (4 marks) (© Hak Cipta Universiti Teknologi MARA CONFIDENTIALCONFIDENTIAL 3 CSIDEC 2014/¢SC580 QUESTION 3 a) Describe static and dynamic interconnection networks. (4 marks) b) Draw a simple static network of four processing nodes which each processing node is connected via a network interface to two other nodes in a mesh configuration. (6 marks) QUESTION 4 a) 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. Draw appropriate diagram to support your answer. (12 marks) b) What does each of the following sample routines represent? n D (4 marks) ©) Define the following communication features: ’) broadeast ji) scatter (4 marks) QUESTION 5 a) Consider the following code segment that computes the product of two dense matrices of sizen x n. for (row = 0; row < nj row++) for (column = 0; column < nj column++) efrow] [column] = dot_product (get_row(a, row), get_col (b, col)); Transform the above code segment into thread instructions. (5 marks) (© Hak Cipta Universiti Teknologi MARA CONFIDENTIALCONFIDENTIAL 4 CSIDEC 2014/¢SC580 b) Describe FOUR (4) advantages of threaded programming over message-passing programming models. (8 marks) ©) Assume you have three processes running computation of (pi) value on different three data sets. Suggest an implementation of barrier in a parallel algorithm for the above computation. (6 marks) QUESTION 6 Consider the following graph. () Q—@) @—_®) a) Find the adjacency matrix and adjacency list for the above graph. (6 marks) b) Draw and explain the following terms: i) Simple graph ii) Acyclic graph ii) Complete graph (6 marks) (© Hak Cipta Universiti Teknologi MARA CONFIDENTIAL,CONFIDENTIAL 5 CSIDEC 2014/CSC580 ©) Given the following minimum spanning tree. i) Define Prim's algorithm. (2 marks) ii) Explain Prim's algorithm steps to calculate the Minimum Spanning Tree (MST). (4 marks) ili) Calculate the above MST using Prim’s algorithm. (6 marks) END OF QUESTION PAPER (© Hak Cipta Universiti Teknologi MARA CONFIDENTIAL