For the following code sequences and the timing parameters for the two implementations in Figure 4.38, compute

Question:

For the following code sequences and the timing parameters for the two implementations in Figure 4.38, compute the total stall cycles for the base MSI protocol and the optimized MOSI protocol in Exercise 4.3. Assume state transitions that do not require bus transactions incur no additional stall cycles.
a. P1: read 110
P15: read 110
P0: read 110
b. P1: read 120
P15: read 120
P0: read 120
c. P0: write 120 <-- 80
P15: read 120
P0: read 120
d. P0: write 108 <-- 88
P15: read 108
P0: write 108 <-- 98
Fantastic news! We've Found the answer you've been seeking!

Step by Step Answer:

Related Book For  book-img-for-question

Computer Architecture A Quantitative Approach

ISBN: 978-0123704900

4th edition

Authors: John L. Hennessy, David A. Patterson

Question Posted: