摘要
Cache的最近最少访问替换算法是1种平均命中率高的常用的算法.给出了用实验的方式来仿真实现Cache的LRU算法的过程.
The lately least visiting substitution algorithm of Cache is a kind of commonly used algorithm, because this algorithm has high probability of hits. A method of realizing the LRU substitution algorithm of Cache through experimentation is given.
出处
《河北师范大学学报（自然科学版）》
CAS
2003年第1期30-33,共4页
Journal of Hebei Normal University：Natural Science
