Test One
MODULE : Parallel and Distributed Computing
COURSE CODE : CSC305
DUE DATE : 10 OCTOBER 2022
TOTAL MARKS : 100
DURATION : 2 Hours
NUMBER OF PAGES : 3 PAGES
INSTRUCTIONS TO CANDIDATES:
• Answer all Questions.
• Number your answers clearly.
• Write neatly and legibly
• Structure your answers by using appropriate headings and sub-headings.
• The general Africa University policies, procedures and rules pertaining to written
assessments apply to this assessment.
PARALLEL AND DISTRIBUTED COMPUTING
QUESTION 1 [5 Marks]
Define the following terms in the context of Parallel and Distributed Computing?
a) Computing
b) Distributed Computing
c) Parallel Computing
d) Grid Computing
e) Cluster Computing
QUESTION 2 [12 Marks]
With the aid of a block diagram illustrate the components of a Microcomputer?
QUESTION 3 [8 Marks]
Define Instruction Register and illustrate using a small diagram where it is positioned in the Control
Unit?
QUESTION 4 [8 Marks]
Briefly describe any Four Functions of the Control Unit
QUESTION 5 [16 Marks]
Based On Flynn's Taxonomy, Explain the differences among SISD, SIMD, MISD and MIMD? Give an
example for each type of Parallel Computer.
QUESTION 6 [20 Marks]
Explain the difference between UNIFORM MEMORY ACCESS (UMA) and NONUNIFORM
MEMORY ACCESS (NUMA). Illustrate these diagrammatically as well.
QUESTION 7 [8 Marks]
Message passing between a pair of processes can be supported by two message communication
operations, send and receive, defined in terms of destinations and messages. To communicate, one
Page 1
PARALLEL AND DISTRIBUTED COMPUTING
process sends a message (a sequence of bytes) to a destination and another process at the destination
receives the message. Describe Message Passing Model of Process Communication.
.
QUESTION 8 [4 Marks]
Explain the concept of an object reference in a distributed system. Why do remote objects need one and
who creates it?
QUESTION 9 [10 Marks]
Describe with the aid of a diagram the concept Distributed Shared Memory (DSM).
QUESTION 10 [9 Marks]
Differentiate the algorithms for implementing Distributed Shared Memory(The Central Server Algorithm,
The Migration Algorithm, The Read-Replication Algorithm)
************* Total 100 Marks ************
Page 2