CONFIDENTIAL CS/JAN 2013/CSC580

UNIVERSITI TEKNOLOGI MARA

FINAL EXAMINATION

COURSE PARALLEL PROCESSING

COURSE CODE CSC580
EXAMINATION JANUARY 2013
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.

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 4 printed pages
© Hak Cipta Universiti Teknologi MARA CONFIDENTIAL
CONFIDENTIAL 2 CS/JAN 2013/CSC580

QUESTION 1

The machines in this category may execute several different programs which require distinct
processing units that would receive distinct instructions to be performed on the same data
item. This class of machines executes the data flows through a series of processing
elements and the pipelined architectures perform vector processing through a series of
stages, which performs a particular function and produces an intermediate result.

a) Determine the classification of the above mentioned computer architecture.

(1 mark)

b) Draw appropriate diagram for (a) computer model architecture.

(4 marks)

c) Explain THREE (3) general principles of pipelining levels of (a) model architecture.
(6 marks)

d) Describe TWO (2) major classes of parallel computers.

(4 marks)

QUESTION 2

a) Describe THREE (3) characterizations of concurrent write (CW) instructions.

(6 marks)

b) Briefly explain THREE (3) categories of shared memory multiprocessor system.

(9 marks)

c) Describe and draw appropriate diagram that show the processing element address of a
4-cube can be arranged in a 4 x 4 array whose adjacent elements differ exactly by one
bit position as below.

"0000 0001 0011 0010"

0100 0101 0111 0110
1100 1101 1111 1110
1000 1001 1011 1010
(10 marks)

© Hak Cipta Universiti Teknologi MARA CONFIDENTIAL

CONFIDENTIAL 3 CS/JAN 2013/CSC580

QUESTION 3

a) Determine and compare TWO (2) categories of MIMD parallel programming.

(6 marks)

b) Differentiate between broadcast and scatter communication techniques.

(6 marks)

c) Briefly explain the effects of synchronous message passing in send() and r e c v ( )

operations.
(8 marks)

QUESTION 4

a) Describe THREE (3) principles of parallel algorithms design.

(6 marks)

b) Compare between module granularity and data granularity in mapping phase of parallel
algorithm design.
(4 marks)

c) Draw graph representation of adjacency matrix and adjacency list of the following
Kinabalu mountain climbing diagram.

(10 marks)

© Hak Cipta Universiti Teknologi MARA CONFIDENTIAL

CONFIDENTIAL 4 CS/JAN 2013/CSC580

QUESTION 5

a) Find the minimum spanning tree of the following tree by using Prim's and Kruskal
algorithms.

(10 marks)

b) Explain how to calculate a factorial number N\ using the parallel divide-and-conquer

method. The number, N, may be odd or even but is a positive constant.
(5 marks)

c) Describe the best-first search (BFS) method and state the main drawback of this
algorithm.
(5 marks)

END OF QUESTION PAPER

© Hak Cipta Universiti Teknologi MARA CONFIDENTIAL