Temporal and Spatial Locality - Department of Computer Science
Temporal and Spatial Locality - Department of Computer Science
Temporal and Spatial Locality - Department of Computer Science
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Marc Snir<br />
Informal Pro<strong>of</strong><br />
A sequence <strong>of</strong> accesses <strong>of</strong> the form<br />
(a 1 1 …am1 +1 1 ) n1 …(a 1 i …ami +1 i ) ni…<br />
will have m i(n i -1) accesses that miss for cache<br />
<strong>of</strong> size m i but do not miss for larger cache.<br />
Theorem follows by choosing n i so that (n i-1)<br />
≈ λ (p i-1 –p i), for suitable constant λ.<br />
14 Nov-05
Change language