< previous page page_388 next page >

Page 388
(b) Simple processor with ideal (write-through) cache.
d87111c01013bcda00bb8640fdff6754.gif
Assume we have the same processor as in (a), but now we have an idealno misses at allwrite-through cache. Only writes go to the memory system. We assume that the writes have only limited buffering and that processor performance is directly affected by memory write contention. (We will consider more complete cache models later in this chapter.)
d87111c01013bcda00bb8640fdff6754.gif
Assume m = 2.
d87111c01013bcda00bb8640fdff6754.gif
Compute n:
n
=
DS/cycle ´ cycles per Tc
n
=
(0.2)3.0
=
0.6.

Compute d:
0388-01.gif
Compute B(m, n, d):
d87111c01013bcda00bb8640fdff6754.gif
B(2,0.6,0.2) = 0.54,
so that write traffic is affected by
0388-02.gif
and write traffic is slowed down by 10%. Of course, overall processor performance is affected by a lesser amount. For IF and DF, there is no performance slowdown. Thus, the overall performance estimate is:
0388-03.gif
and
d87111c01013bcda00bb8640fdff6754.gif
Perfachieved = .983(25) = 24.6 MIPS.
Notes: Part (a) illustrates that for many situations there may not be a great difference between the simple binomial model B(4,3.6,d = 1) = 2.45, and the d-binomial model (a 6% error). Part (b) of this study illustrates the case where n < 1 and d is small. Using the simple binomial model under such conditions produces significant error (> 20%).

 
< previous page page_388 next page >