So reasonable Cache replacement policy can reduce the waiting time of CPU and improve system performance. Many typical Cache replacement policies arebased on the accessing frequency or time of the page and some policiesdo both.This article will describe a Cache replacement strategy which is based on Prefetch. We mainly make the following two optimization: (1) eliminate multiple pages in one Cache page replacement; (2)change the distribution model of the first batch of tasks from the pull model to the push model. Simulation experiment shows that this method can effectively improve the hit rate of Cache.
关键词
Keywords
references
唐朔飞. 计算机组成原理[M]. 北京: 高等教育出版社, 2008.
谌卫军, 王浩娟. 操作系统[M]. 北京: 清华大学出版社, 2012.
Ding J, Yang B Y. Multivariates polynomials for hashing[J]. Lecture Notes in Computer Science, 2007, 4990: 358-371. DOI: 358
Bodik R, Gupta R, Soffa M. Interprocedural conditional branch elimination[C]//Proceedings of the SIGPLAN' 97 Conference on Programming Language Design and Implementation. ACM, 1997: 146-158.
Barriga L, Ayani R. Lazy Update: An Efficient Implementation of LRU Stacks[J]. Information Processing Letters, 1995, 54(2): 81-84. DOI: 81