CONFIDENTIAL CS/DEC 2019/CSC580
UNIVERSITI TEKNOLOGI MARA
FINAL EXAMINATION
COURSE PARALLEL PROCESSING
COURSE CODE CSC580
EXAMINATION DECEMBER 2019
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
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 5 printed pages
© Hak Cipta Universiti Teknologi MARA CONFIDENTIAL
CONFIDENTIAL CS/DEC 2019/CSC580
QUESTION 1
a) Describe the reason parallel processing is traditionally being thought as time and effort
intensive.
(4 marks)
b) List FOUR (4) scope of parallel processing.
(4 marks)
c) Explain Moore's Law regarding the central processing unit (CPU).
(2 marks)
QUESTION 2
a) Figure 1 shows the TWO (2) network topologies that can be employed in interconnection
network.
Address
Processor 0 Processor 1
(b)
Figure 1
i) State the network topology of both interconnection network above.
(2 marks)
ii) Discuss the advantage of network topology (a) over (b).
(4 marks)
iii) Draw the network topology that can be combined with network topology (b) to
produce (a).
(6 marks)
b) Describe TWO (2) primary form of data exchange between parallel tasks.
(4 marks)
c) Explain the difference between shared address space and shared memory.
(4 marks)
© Hak Cipta Universiti Teknologi MARA CONFIDENTIAL
CONFIDENTIAL CS/DEC 2019/CSC580
QUESTION 3
a) Table 1 shows a relational database of vehicles made in Malaysia.
Table 1
ID Brand Model Type Price
101 Proton X70 SUV 99,800
102 Proton Persona Sedan 42,600
103 Proton Saga Sedan 32,800
104 Perodua Aruz SUV 72,900
105 Perodua MyVi Hatchback 41,800
106 Perodua Bezza Sedan 33,500
i) Draw the data dependency graph for the following query:
BRAND="Proton" AND PRICE>90,000 AND (TYPE="SUV" OR TYPE="Sedan")
(8 marks)
ii) Draw the abstraction of data dependency graph in (i) if the processing is carried out
by four tasks and the total amount of work is 60.
(4 marks)
iii) Show the mapping of the task graph in (ii) using four different processes.
(4 marks)
b) Given the following sequence of number:
{12,14,7,9,22,8,24,3}
Draw the task dependency graph for finding the minimum number within the sequence.
(7 marks)
c) Figure 2 shows the task-interaction diagram for a sparse matrix multiplication problem.
Figure 2
Draw the task decomposition matrix that corresponds to the figure above.
(10 marks)
© Hak Cipta Universiti Teknologi MARA CONFIDENTIAL
CONFIDENTIAL CS/DEC 2019/CSC580
QUESTION 4
a) Explain the usage of the following message passing function:
i) MPI_Send
ii) MPI_Barrier
iii) MPi_Bcast
iv) MPI_Reduce
(4 marks)
b) Briefly explain the difference between threaded programming and message-passing
interface.
(4 marks)
c) Figure 3 shows the execution time of a program using different number of processes in a
processor with six processing cores.
Process
8 1735
7 1720
6 1700
5 I 1800
4 Has 2000
3 i 2500
2 3500
i m I 6000
o soo looo 1500 2000 2S00 3000 3500 4000 4S00 5000 5500 6000 6S00 Execution Time
Figure 3
i) Calculate the speedup and efficiency for every execution.
(4 marks)
ii) Discuss the reason behind the decline in terms of speedup when the program is
executed using more than six processes.
(2 marks)
i Hak Cipta Universiti Teknologi MARA CONFIDENTIAL
CONFIDENTIAL CS/DEC 2019/CSC580
QUESTION 5
a) Consider the following undirected graph in Figure 4.
Figure 4
Find and draw the minimum spanning tree (MST) of the graph by using Prim's algorithm.
(8 marks)
b) Consider the following directed graph in Figure 5.
Figure 5
i) Identify the all-pairs-shortest path for the graph by using Floyd's algorithm.
(10 marks)
ii) Show the parallel formulation for the above algorithm.
(5 marks)
END OF QUESTION PAPER
) Hak Cipta Universiti Teknologi MARA CONFIDENTIAL
