-
subject_3
对于OPT算法,在有多个页面可选的情况下,先淘汰较早进入的页面)。
3. 计算缺页次数及缺页率。
测试用例格式如下:
输入:
算法(1 OPT,2 FIFO,3 LRU)
内存块数
页面序列(页面1,页面2,页面3,...)
输出:
页面变化时内存块装入页面列表1-是否命中/页面变化时内存块装入页面列表2-是否命中/...
缺页次数
其中:
页面变化时内存块装入页面列表:内存块1装入页面,内存块2装入页面,内存块3装入页面...,未装入任何页面时由 -”表示
是否命中:1-命中,0-缺页">
- 2021-04-27 00:48:45下载
- 积分:1
-
process-and-thread-Technology
进程和线程技术 Linux和windows进程创建 进程和线程通信 文档+实例分析(process and thread Technology Text and examples)
- 2012-01-05 10:51:28下载
- 积分:1
-
reply_1_646228
银行家算法,希望大家喜欢(bankers algorithm, hope you like)
- 2004-11-10 19:41:05下载
- 积分:1
-
FIFOLRU
1.虚拟存储器的引入
局部性原理:程序在执行时在一较短时间内仅限于某个部分;相应的,它所访问的存储空间也局限于某个区域,它主要表现在以下两个方面:时间局限性和空间局限性。
2.虚拟存储器的定义
虚拟存储器是只具有请求调入功能和置换功能,能从逻辑上对内存容量进行扩充的一种存储器系统
(1. The introduction of virtual memory locality principle: program execution in a relatively short period of time limited to a particular part of it Accordingly, it has access to the storage space is also limited to a particular region, it is mainly manifested in the following two aspects: the time limitations and space limitations. 2. The definition of virtual memory Virtual memory is just a request for redeployment of functions and displacement functions, from the logical to expand the memory capacity of a memory system)
- 2010-01-08 15:10:19下载
- 积分:1
-
txNFlFCf
说明: 消费代码.用于操作系统中的课程设计使用.愿大家提供建议我也好改进算法(Consumer code. For the operating system to use the curriculum design. I would like to provide recommendations to improve the algorithm or)
- 2008-11-21 17:27:31下载
- 积分:1
-
4
说明: 这是一个操作系统中关于调度问题中的先来先服务调度算法。(This is an operating system on the scheduling of a first-come first-served scheduling.)
- 2011-06-19 22:42:58下载
- 积分:1
-
fifo
页面置换先进先出算法,请大家试试,本人鉴定没问题(FIFO page replacement algorithm, please try, I did not identify the problem)
- 2021-01-13 14:18:47下载
- 积分:1
-
five
FIFO和LRU页面置换算法,使用c++写的,有功能号,可以选择功能,进行相应的操作!(FIFO and LRU page replacement algorithm, using c++ written in the functional number, you can choose functions to carry out the appropriate action!)
- 2010-01-14 16:39:34下载
- 积分:1
-
hpa48
HPA就是host protect area(HPA is the host protect area)
- 2007-09-17 09:10:12下载
- 积分:1
-
fptree
FP-growth算法的改进C++程序,具有较好的扩展性和应用性,本程序改成用行读取,然后在内存中解析。更有效的方式是采用块读取方式(本人在以前项目中验证过,速度大为提高。)(FP-growth algorithm C++ Procedures, have good scalability and application, the procedure changed to use line to read, and then resolve in memory. More effective approach is the use of block-read mode (I tested before the project, speed greatly improved.))
- 2008-02-23 11:36:19下载
- 积分:1