BCD: to Achieve the Theoretical Optimum of Spatial Locality Based Cache Replacement Algorithm

To achieve theoretical optimum of spatial locality based replacement algorithms, this paper proposes a block correlations directed cache replacement policy (BCD) which uses both of history and runtime access information to predict spatial locality, designs a replacement policy to use prediction results to improve the utilization of the cache and reduces the penalty incurred by incorrect predications. For most of real system workloads, BCD can reduce the cache miss ratio by 11%~38% compared with LRU and the miss ratio is only high than the theoretical optimum by 0%-7.9%.