16

17

18

19

a)
b)

a)
b)
a)

b)

a)
b)

10000CS405122101

3. List all the simple and greedy cycles from the state diagram.
4. Determine the minimal average latency (MAL).
Explain Write —invalidate Snoopy Bus Protocol using write-through cache.
Consider a 16-node hypercube network. Based on the E-cube routing
algorithm, show how to route a message from node (0100) to node (1101). All
intermediate nodes must be identified on the routing path.
PART D

Answer any two full questions, each carries 12 marks.
Explain the mechanisms for instruction pipelining.
Illustrate multiply pipeline design.
Explain the latency hiding techniques used in distributed shared memory
multicomputers.
Distinguish between static dataflow computers and dynamic dataflow
computers.
Explain the Tomasulo’s algorithm for the dynamic instruction scheduling.
What are the problems of asynchrony and their solutions in massively parallel

processors?

പി

Page 3 of 3

(2)
(2)
(4)
(5)

(7)
(5)
(8)

(4)

(5)
(7)