CONFIDENTIAL, CSIJUN 2014/CSC580 UNIVERSITI TEKNOLOGI MARA FINAL EXAMINATION COURSE : PARALLEL PROCESSING COURSE CODE : CSC580 EXAMINATION JUNE 2014 TIME : 3HOURS 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 invigitator. 4, Please check to make sure that this examination pack consists of ‘) 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 5 printed pages ‘© Hak Cipta Universiti Teknolog! MARA CONFIDENTIALCONFIDENTIAL 2 CSIJUN 2014/¢SC580 QUESTION 4 Given the following diagrams: PE: Processing Element ar j Q Cre) 8 PB 2 E control unit Global g control 3 g unit Z : Z Z "E Zz Ss * Ss a control R PE Figure 4 Figure 2 a) Determine the type of parallel computer architectures for Figure 1 and Figure 2. (2 marks) b) Compare both architectures in terms of: i) Execution ii) Hardware iil) Memory (6 marks) QUESTION 2 a) Briefly explain FOUR (4) subclasses of parallel random access machine (PRAM) models. (8 marks) (© Hak Cipta Universiti Teknologi MARA, CONFIDENTIALCONFIDENTIAL, 3 CSIJUN 2014/CSC580 b) Consider the following diagram: ‘A mesh of trees is a network that imposes a tree interconnection on a grid of processing nodes. Ap x ,/p mesh of trees is constructed as follows. Starting with a Jp x J/p grid, a complete binary tree is imposed on each row of the grid. Then a complete binary tree is imposed on each column of the grid. The above diagram illustrates the construction of a 4x 4 mesh of trees. Assume that the nodes at intermediate levels are switching nodes. Determine and explain the bisection width, diameter and total number of switching nodes in a Jp x./p mesh. (6 marks) QUESTION 3 a) Briefly describe FOUR (4) categories of decomposition techniques. (12 marks) b) Differentiate between static and dynamic mapping techniques. (4 marks) QUESTION 4 a) Given send and receive operations as follows: send (void *sendbuf, int nelems, int dest) receive (void *recvbuf, int nelems, int source) Determine and explain the above operations functions. (10 marks) (© Hak Cipta Universiti Teknologi MARA CONFIDENTIALCONFIDENTIAL, 4 CSIJUN 2014/¢SC580 b) Define thread. Explain FOUR (4) advantages of threaded applications over message- passing programming models. (10 marks) QUESTION 5 a) Explain FIVE (5) performance metrics for parallel systems. (10 marks) b) Consider the search trees shown below. a ‘ + Solution Solution Figure 3: DFS with one processing Figure 4: DFS with two processing i) Ifa sequential search of the tree is performed using the standard depth-first search (OFS) algorithm, how much time does it take to find the solution if traversing each arc of the tree takes one unit (Figure 3) of time? Explain your answer. (5 marks) ii) Assume that the tree is partitioned between two processing elements that are assigned to do the search job (Figure 4). If both processing elements perform a DFS. ‘on their respective halves of the tree, how much time does it take for the solution to be found? Explain your answer. ( marks) (© Hak Cipta Universiti Teknologi MARA CONFIDENTIALCONFIDENTIAL, 5 CSIJUN 2014/CSC580 QUESTION 6 a) Differentiate between undirected and directed graphs. Explain and give example of each graph. (8 marks) b) Given the following diagram. i) Calculate the Minimum Spanning Tree (MST) using Prim’s and Kruskal Algorithms. (10 marks) ii) Identify which algorithm is efficient for the above solution. Justify your answer. (4 marks) END OF QUESTION PAPER (© Hak Cipta Universiti Teknologi MARA, CONFIDENTIAL