|
|
 |
| |
|
|
|
A Cache Model of the Block Correlations Directed Cache Replacement Algorithm |
|
|
|
PP: 79S-88S |
|
|
|
Author(s) |
|
|
|
Zhu Xudong,
|
|
|
|
Abstract |
|
|
| This paper proposes a cache model of the Block Correlations Directed cache replacement algorithm (BCD). Since the predication success rate of accesses decides the BCD’s hit ratio, the cache model analysis the utilization of the cache space improved by the correct predications and the penalty incurred by incorrect predications to estimate the hit rate of BCD. The model can also optimize the parameters of BCD to achieve theoretical optimum of such spatial locality based likely replacement algorithms. For most workloads of real systems the model of BCD can reduce deviation by 2.1%-21.8%. |
|
|
|
|
|
|
|
