ESA
2001
Springer
14 years 3 months ago
2001
Springer
Suppose that a program makes a sequence of m accesses (references) to data blocks, the cache can hold k < m blocks, an access to a block in the cache incurs one time unit, and ...