Scribd
Upload
28 views4 pages

Universiti Teknologi Mara Final Examination: Confidential CS/JAN 2012/CSC580

Uploaded by

ain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
28 views4 pages

Universiti Teknologi Mara Final Examination: Confidential CS/JAN 2012/CSC580

Uploaded by

ain
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 4

CONFIDENTIAL CS/JAN 2012/CSC580

UNIVERSITI TEKNOLOGI MARA


FINAL EXAMINATION

COURSE PARALLEL PROCESSING


COURSE CODE CSC580
EXAMINATION JANUARY 2012
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 2012/CSC580

QUESTION 1

a) Describe TWO (2) advantages of parallel computing over serial computing.


(4 marks)

b) MIMD machines can be divided into TWO (2) categories. With diagram, give a brief
explanation of each category.
(8 marks)

c) Define the following classification of parallel computers:

i) SISD
ii) SIMD
iii) MISD
iv) MIMD
(8 marks)

QUESTION 2

a) List and describe THREE (3) goodness measures of interconnection networks.


(6 marks)

b) Given the following number of processors, draw the perfect shuffle interconnection
networks for each:

i) 8 processors
ii) 16 processors

(14 marks)

QUESTION 3

a) What does the following sample represent?


s e n d ( & p , 3 , 7)
r e c v ( & q , 1, 7)
(4 marks)

b) What is the difference between blocking and non-blocking message passing operations?
(4 marks)

c) There are two mechanisms by which blocking message passing operations can be
achieved. State the mechanisms and give a brief explanation for each. Provide diagrams
in your explanation.
(12 marks)

© Hak Cipta Universiti Teknologi MARA CONFIDENTIAL


CONFIDENTIAL 3 CS/JAN 2012/CSC580

QUESTION 4

a) Define each of the following phases of designing a parallel algorithm.

i) Partitioning
ii) Communication
iii) Agglomeration
iv) Mapping

(8 marks)

b) List TWO (2) approaches that can be used in partitioning.


(2 marks)

c) The processors in a multiprocessor system can communicate with each other through
shared variables in a common memory. Briefly explain THREE (3) shared memory
organization of a multiprocessor.
(10 marks)

QUESTION 5

a) Given graph G as below:

Produce the following:

i) Adjacency matrix of graph G


(3 marks)
ii) Adjacency list of graph G
(3 marks)

© Hak Cipta Universiti Teknologi MARA CONFIDENTIAL


CONFIDENTIAL 4 CS/JAN 2012/CSC580

b) Find the shortest route from origin O to destination T using Djikstra's Algorithm.

(7 marks)

c) Find the minimum spanning tree of graph G, where E is the origin.

(7 marks)

END OF QUESTION PAPER

© Hak Cipta Universiti Teknologi MARA CONFIDENTIAL

You might also like