-
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
-
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
-
现代操作系统(中文第三版)_扫描版_24.8M
说明: 现代操作系统第三版中文,带目录,觉得好请点赞(Modern operating system third edition Chinese, with directory, feel good, please comment)
- 2020-06-23 23:40:01下载
- 积分:1
-
页面调度算法
页式虚拟存储器的页面置换算法一般有: 最佳置换算法(OPT),先进先出置换算法(FIFO),最近最久未使用置换算法(LRU),Clock置换算法,最少使用置换算法(LFU),页面缓存算法(PBA)等。 先进先出(FIFO)置换算法是最直观的置换算法,由于它可能是性能最差的算法,故实际应用极少。在这里我只使用前面三种算法来进行页面调度(Page replacement algorithms for page virtual memory generally include the best permutation algorithm (OPT), advanced first out permutation (FIFO), the most recent unused replacement algorithm (LRU), Clock permutation algorithm, minimum use of permutation (LFU), and page caching algorithm (PBA). The first in first out (FIFO) replacement algorithm is the most intuitive replacement algorithm, because it may be the worst performing algorithm, so there are few practical applications. Here I only use the first three algorithms for page scheduling.)
- 2018-05-22 13:02:20下载
- 积分:1
-
OSLab-
操作系统课程设计。visual studio 2010,2008上的模拟UNIX文件系统的c++源码,附加实验报告和readmefile(1.Simulate a Unix file system on your Windows Platform
2.Understand the file system on Unix system, and the usage of i-nodes
3.Implement the function of sub-directory
4.The task needs to be completed using C++ or C
5.Allocate 16MB space in memory as the storage for your file system, the space is divided as blocks with block size 1KB
6.The i-node should support up to 10 direct block addresses, and should support at least one indirect block address
)
- 2020-10-12 22:37:33下载
- 积分:1
-
Linux0.11-V2
linux 0.11内核源代码分析V2.0版
为V1.0版的修正版 (linux 0.11 kernel source code analysis V2.0 version V1.0 version of the amended version of)
- 2008-01-12 22:19:22下载
- 积分:1
-
QNXPprogrammersPguide
QNX操作系统下程序开发的详细说明指南,包括微内核架构分析、进线程开发介绍及进程间通讯等。(QNX operation system programmer s guide )
- 2014-06-12 12:38:19下载
- 积分:1
-
msdos-master
source code for ms-dos 1.1 and ms-dos 2.1
- 2017-12-24 09:06:03下载
- 积分:1
-
模拟进程调度
模拟操作系统进程调度的算法采用时间片轮转法和优先权法(operating system simulation process scheduling algorithm-time Web-law and law priority)
- 2005-05-15 19:51:27下载
- 积分:1
-
xiancheng
线程的调度模拟ok(thread scheduling simulation ok)
- 2004-09-15 09:54:24下载
- 积分:1