University of Sargodha MS 1" Term Examination 2015 Subject: Computer Science Paper: Advance Computer Architecture (CS-5240) Time Allowed: 3 Hours

University of Sargodha

MS 1" Term Examination 2015

Subject: Computer Science Paper: Advance Computer Architecture (CS-5240)

Time Allowed: 3 Hours

.No.1 Answer the following the following question

Objective Part Compulsory

1) Define WISt Architecture

2) Daffe the Bus arbitration logic

3) Define Single stage network

1L. Define Snooping Protocol /83

St-Explain ERCW PRAM

ustadni.com

Define channel dependency graph

Define MPI

8) Explain the Equal Duration Model

Maximum Marks: 80

2x8=16 marks

ustadni.com

Subjective Part

Note:

Attempt any four out of six questions.

4x16=64

Q.No.2 Explaithe following

Berkeley Network of Workstations 115

Task Creation in PVM.

27,185

Q.No.3 Explain the following in Multiprocessors Interconnection with diagram.

6 marks

10 marks

8+8 marks

The Omega Network

b. Cube Connected Networks: Static Interconnection

Qi no.4 Explains the following

8+8 marks

At Amdahl's Law

56

B) Discuss the interconnection network performance issues for the Bandwidth of a Multistage Interconnection

Network(MIN)

Q.no.5. Consider a bus-based shared memory system consisting of three processors. The shared memory is divided 16 marks

into four blocks x, y, z, w. Each processor has a cache that can fit only one block at any given time. Each block can be in one

of two states: valid (V) or invalid

(I). Assume that caches are initially flushed (empty) and that the contents of the memory

are as follows:

Memory block

Consider, the following sequence of memory access events given in order:

1) P1: Read(x),

2) P2: Read(x),

3) P3: Read(x),

4) P1: x = x + 25,

5) P1: Read(z),

6) P2: Read(x).

7) P3: x =

15. 8) P1: z = 2 + 1

multicomputer message passing system. Suggest ways to avoid the occurrence of such problems. Provide some

examples to support your suggestions.

Q. No.7. Explain the scheduling in-forests/Ous grees on two processor with communication). Device a Grantt Charts

showing schedule for the in-forest taoR graph on two processors, when communication is conside Assume

visit website: ustadni.com