搜索资源列表
FIFO与LRU 算法实现（java）
- java编的两种算法，word写的，看不懂，大家帮忙-java series of the two algorithms, write the word, fail to understand, we look at the help
FIFOandLRUarithmetic
- 最佳页面置换算法，FIFO，LRU的仿真。页面调用和置换过程有动态显示。内存分配页面数目和页面引用串的长度可以进行人工交互输入。 -best pages replacement algorithm, FIFO, the LRU simulation. Page calls and replacement process is dynamic display. Memory allocation of the number of pages and pages cited the lengt
pagec++
- 页面置换算法代码，语言采用c++。实现了FIFO算法，LRU算法，其中，LRU采用经典的LRU算法，由于该算法占用资源较大，多数OS采用改进的LRU算法.-pages replacement algorithm code language used c. To achieve the FIFO algorithm, the LRU algorithm, which, the LRU is a classical LRU algorithm, the algorithm occupy larger
页面置换算法fiof_lru
- fifo和lru页面置换算法-fifo and LRU algorithm replacement pages
FIFOLRUOPT
- 页式管理缺页中断优化FIFO LRU OPT.rar 三种算法-Page-style management page fault FIFO LRU OPT.rar three kinds of optimization algorithms
jyc
- 请求页式管理中的置换算法,页面置换算法FIFO算法,LRU算法-Style management in the requested page replacement algorithm, page replacement algorithm FIFO algorithm, LRU algorithm
page_replacement1
- visual c++描述的页面时换算法，此程序提供三个算法，分别是LRU,CLOCK,FIFO算法-visual c++ conversion method described in the page, this program provides three algorithms, namely LRU, CLOCK, FIFO algorithm
shiyan5
- 解决lru算法和fifo算法，并比较它们的缺页率和命中率-Fifo lru algorithm and solving algorithms, and compare them with the missing page rate and hit rate
fifo-lru-opt
- c语言写的页面转换算法，有助于大家学习操作系统。-pages written in c language conversion algorithm to help them to learn the operating system.
yemian
- 页面置换算法包括：最佳(Optimal)置换算法、先进先出(FIFO)算法、最近最久未使用(LRU)算法 -Page replacement algorithm, including: Best (Optimal) replacement algorithm, first in first out (FIFO) algorithm, most recently from lack of use (LRU) algorithm
page
- 操作系统原理，实现页面置换的几个基本算法，包括OPT，FIFO，LRU置换算法。-Operating System Principles, page replacement to achieve a few basic algorithms, including OPT, FIFO, LRU replacement algorithm.
xunicunchuqi
- ① 实现三种算法：1、先进先出；2、OPT；3、LRU-① achieve three algorithms: 1, FIFO 2, OPT 3, LRU
6
- 页面置换算法理解页面置换算法,实现先进先出（FIFO）置换算法和最久未使用（LRU）置换算法。给出任意的输入流，计算置换次数。-Page replacement algorithms understand page replacement algorithm, first in first out (FIFO) replacement algorithm and least-recently used (LRU) replacement algorithm. Any given input st
ymzhf
- 页面置换算法要实现FIFO、LRU两种不同的置换,定义所需的各种参数，对算法执行的结果,表格方式进行显示 -Page replacement algorithm to achieve the FIFO, LRU two different replacement, needed to define the parameters of the algorithm execution results, table shows the way
Page-replacement-algorithm
- 分别实现最佳置换算法(optimal)、先进先出(FIFO)页面置换算法和最近最久未使用（LRU）置换算法，并给出各算法缺页次数和缺页率。 -Respectively, to achieve optimal replacement algorithm (optimal), First In First Out (FIFO) page replacement algorithm and the most-recently-used recently (LRU) replacement algo
yemiandiaodusuanfa
- 3种页面置换调度算法 先进先出(FIFO) 最近久未使用(LRU) 最佳（OPT）置换算法-Three kinds FIFO page replacement scheduling algorithms (FIFO) recent lack of use (LRU) Best (OPT) replacement algorithm
4zhongyemiandiaodusuanfa
- 基于一个虚拟存储区和内存工作区，设计下述算法并计算访问命中率。 1、最佳淘汰算法（OPT） 2、先进先出的算法（FIFO） 3、最近最久未使用算法（LRU） 4、简单时钟(钟表)算法（CLOCK） 命中率＝１－页面失效次数／页地址流(序列)长度 -Based on a virtual memory storage area and work area, the following algorithm design and calculate the h
rqndom
- 页面置换算法代码,语言采用c++,实现了FIFO算法,LRU算法,其中,LRU采用经典的LRU算法,由于该算法占用资源较大()