Subject: Computer Science Time Allowed: 3 Hours University of Sargodha MS. 1" Term Examination 2014
Discussion
Ask a question about this paper, or help someone else with theirs. Answers are emailed to whoever asked.
No questions yet — be the first to ask.
More Advance Computer Interaction papers
See all
Paper text
Subject: Computer Science
Time Allowed: 3 Hours
University of Sargodha
MS. 1" Term Examination 2014
Paper: Advance Computer Architecture (CS-5240)
Session: 2013-15
Maximum Marks: 80
Note:
Objective part is compulsory. Attempt any four questions from subjective part.
ustadni.ci
Objective Part
dini. cCompulsory
Q.1.
Write short answers of the following questions.
Amdahl's Law
Grosch's Law
iü.
iv.
V.
vi.
vi.
VIl:
Write down the name of switching mechanisms
What are the Routing Potential Problems
Explain FlashMob 1
Write down the name of the two of the early successful Beowulf clusters.
Barriers and precedence relations
Virtual topologies
ustadni.
(8*ZE16)
Q.2.
Explain the following
a.
Omega network
b. Banyan Network
4 marks
4 marks
8 marks
c. Reduction Operation
Q.3.
Explain the following
a. Centralized Directory Invalidate
5 marks
b. Scalable Coherent Interface
5 marks
c. Stanford Distributed Directory
6 marks
QA.
Explain the Improved Leader Election Algorithm with the complexity analysis
(10+6)
Q.8.
Explain the Flynn's Taxonomy Of Computer Architecture
16 marks
Q.6.
Explains the One sided Communication.
16 marks
Q.7Explain/the Scheduling in-förests/out-forests on two processors with communication).
By using this algorithm illustrate how to schedule the in-forest task graph shown in the figure on
two processor. Assume that each of the tasks in the task graph takes one unit of time on either one
US
of the two processor and model C of communication is followed. The communication delay
between two communication task Done unit of time if allocated to two different processor,
otherwise the delay is ignored.
8+8 marks
ustadni.co
visit website: ustadni.com