文件名称:Online_RandMarkingAlgorithm
-
所属分类:
- 标签属性:
- 上传时间:2012-11-16
-
文件大小:55.49kb
-
已下载:0次
-
提 供 者:
-
相关连接:无下载说明:别用迅雷下载,失败请重下,重下不扣分!
介绍说明--下载内容来自于网络,使用问题请自行百度
本程序解决的是:模拟类似计算机主、缓存的存储结构,当用户请求某个页面时,若某个页面已在缓存中,则直接从缓存中去取,不会产生失误(即未在缓存中命中),否则,就到主存中去取,代价变大。
本程序采用随机标记算法,即在在线标记算法的基础上,对于替换页面时,采用随机从未标记的缓存项中选出一项进行替换。
代码、文档详尽-Addressed in this program are: analog computer-like main, cache storage structure, when the user requests a page, a page in the cache directly from the cache to fetch, does not produce errors (that is, not in the cache in the hit), otherwise, to the main memory to fetch a consideration of larger. This program uses a random marking algorithm, online marking algorithm based on random never mark the cache entry selected a replacement for the replacement page. Code, documentation detailed
本程序采用随机标记算法,即在在线标记算法的基础上,对于替换页面时,采用随机从未标记的缓存项中选出一项进行替换。
代码、文档详尽-Addressed in this program are: analog computer-like main, cache storage structure, when the user requests a page, a page in the cache directly from the cache to fetch, does not produce errors (that is, not in the cache in the hit), otherwise, to the main memory to fetch a consideration of larger. This program uses a random marking algorithm, online marking algorithm based on random never mark the cache entry selected a replacement for the replacement page. Code, documentation detailed
(系统自动生成,下载前可以参看下载内容)
下载文件列表
实验15/Online_RandMarkingAlgorithm/main.cpp
实验15/Online_RandMarkingAlgorithm/Online_RandMarkingAlgorithm.vcxproj
实验15/Online_RandMarkingAlgorithm/Online_RandMarkingAlgorithm.vcxproj.filters
实验15/Online_RandMarkingAlgorithm/Online_RandMarkingAlgorithm.vcxproj.user
实验15/实验15算法说明.docx
实验15/Online_RandMarkingAlgorithm
实验15
实验15/Online_RandMarkingAlgorithm/Online_RandMarkingAlgorithm.vcxproj
实验15/Online_RandMarkingAlgorithm/Online_RandMarkingAlgorithm.vcxproj.filters
实验15/Online_RandMarkingAlgorithm/Online_RandMarkingAlgorithm.vcxproj.user
实验15/实验15算法说明.docx
实验15/Online_RandMarkingAlgorithm
实验15
本网站为编程资源及源代码搜集、介绍的搜索网站,版权归原作者所有! 粤ICP备11031372号
1999-2046 搜珍网 All Rights Reserved.