CodeBus
www.codebus.net
Search
Sign in
Sign up
Hot Search :
Source
embeded
web
remote control
p2p
game
More...
Location :
Home
Search - replacement page
Main Category
SourceCode
Documents
Books
WEB Code
Develop Tools
Other resource
Sub Category
Compress-Decompress algrithms
STL
Data structs
Algorithm
AI-NN-PR
matlab
Bio-Recognize
Crypt_Decrypt algrithms
mathematica
Maple
DataMining
Big Data
comsol
physical calculation
chemical calculation
simulation modeling
Search - replacement page - List
[
Data structs
]
FIFOandLRUarithmetic
DL : 0
最佳页面置换算法,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 length of string can be artificial interactive input.
Date
: 2025-12-16
Size
: 233kb
User
:
刘利辉
[
Data structs
]
yemianzhihuan
DL : 0
页面置换算法,包括先进先出置换算法,最近最久未使用置换算法-Page replacement algorithms, including FIFO replacement algorithm, long the most recent use of replacement algorithm
Date
: 2025-12-16
Size
: 1kb
User
:
张三
[
Data structs
]
Pagereplacementalgorithm
DL : 0
页面置换算法设计和实现最佳置换算法、随机置换算法、先进先出置换算法、最近最久未使用置换算法、简单Clock置换算法及改进型Clock置换算法;通过支持页面访问序列随机发生实现有关算法的测试及性能比较。-Page replacement algorithm design and realization of the best replacement algorithm, random permutation algorithm, FIFO replacement algorithm, the most recently used replacement algorithm for long, simple Clock replacement algorithm and improved Clock replacement algorithm page views by supporting the realization of random sequences of the algorithm testing and performance comparison.
Date
: 2025-12-16
Size
: 335kb
User
:
张帅
[
Data structs
]
yemianzhihuan
DL : 0
在段式虚拟存储器中,虚拟空间中能容纳的程序段数要比主存空间中能存放的相同长度的程序段数要多得多。因此,必然会出现当主存中所有页面都被占用,或者所有主存空间都被占用,而又要从磁盘存储器重调入新页(或新段)的情况。这时,必须从主存储器中淘汰一个不常用的页面(或程序段),以腾出主存空间来存放新调入的页面(或程序段),那么,按照什么样的规则替换主存储器中的页面(或程序段)呢?这就是页面替换算法要解决的问题。 -Piece of virtual memory in the virtual space of the program segment can accommodate a few more main memory space to store the same program segment length of a few to many more. Therefore, when bound to all the pages in main memory are occupied, or all of main memory space occupied, and re-transferred from the disk storage a new page (or above) the situation. At this time, must be eliminated from the main memory in a common page (or procedures) to free up main memory space to store the new page transferred (or program segment), then what kind of rules in accordance with the replacement of the main memory page (or program segment) it? This is the page replacement algorithm to solve the problem.
Date
: 2025-12-16
Size
: 240kb
User
:
小江
[
Data structs
]
12344
DL : 0
模拟银行家算法 页式存储管理如何实现地址转换;进一步认识页式虚拟存储管理中如何处理缺页中断。用C++实现LRU置换算法 -Bankers algorithm simulation storage management page addresses how to achieve the conversion a better understanding of virtual memory management page of how to handle page fault. Using C++ to achieve LRU replacement algorithm
Date
: 2025-12-16
Size
: 278kb
User
:
0
[
Data structs
]
FIFOLRUOPT
DL : 0
页式管理缺页中断优化FIFO LRU OPT.rar 三种算法-Page-style management page fault FIFO LRU OPT.rar three kinds of optimization algorithms
Date
: 2025-12-16
Size
: 428kb
User
:
璐
[
Data structs
]
pagechange
DL : 0
该文件是用来描述页面置换算法的,是经过验证的正确的代码,希望有所帮助。-This file is used to describe the page replacement algorithm is proven correct code, I hope help.
Date
: 2025-12-16
Size
: 5kb
User
:
caoying
[
Data structs
]
LRU-update-Cache-
DL : 0
LRU置换算法是选择最近最久未使用的页面予以置换。该算法赋予每个页面一个访问字段,用来记录一个页面自上次被访问以来经历的时间T,当须淘汰一个页面时,选择现有页面中T值最大的,即最近最久没有访问的页面。这是一个比较合理的置换算法。-LRU replacement algorithm is to select the page from lack of use the most recent to be replaced. The algorithm gives an access field in each page to record a page being accessed has experienced since the last time T, when required to phase out a page, select an existing page, the maximum value of T, that is not a recent visit to the oldest page. This is a reasonable replacement algorithm.
Date
: 2025-12-16
Size
: 1kb
User
:
shen6041
[
Data structs
]
page
DL : 0
操作系统原理,实现页面置换的几个基本算法,包括OPT,FIFO,LRU置换算法。-Operating System Principles, page replacement to achieve a few basic algorithms, including OPT, FIFO, LRU replacement algorithm.
Date
: 2025-12-16
Size
: 1kb
User
:
li
[
Data structs
]
1
DL : 0
:(1)从置换算法中任选2种;(2)建立页表;(3)设计的输入数据要能体现算法的思想(4)事先假定分配的物理块是空闲的;(5)求出各置换算法中的缺页次数和置换次数 -: (1) Choose from two kinds of replacement algorithm (2) building the page tables (3) design of the input data to reflect the thinking of the algorithm (4) presupposes that the distribution of the physical block is free (5) Find the replacement algorithm of the missing page number and the number of replacement
Date
: 2025-12-16
Size
: 2kb
User
:
张凯强
[
Data structs
]
1
DL : 0
最佳替换算法、先进先出页面替换算法没、最近最少用页面替换算法-Best replacement algorithm, FIFO page replacement algorithm did not, least recently used page replacement algorithm
Date
: 2025-12-16
Size
: 4kb
User
:
ACCELERATOR
[
Data structs
]
6
DL : 0
页面置换算法理解页面置换算法,实现先进先出(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 stream, calculate the number of replacement.
Date
: 2025-12-16
Size
: 1kb
User
:
瓜哥
[
Data structs
]
pagereplace
DL : 0
页面置换算法演示,程序中含有一些对控制台输出和事件进行控制的API函数.-Demo page replacement algorithm, the program contains some of the console output and the control of the incident API function.
Date
: 2025-12-16
Size
: 15kb
User
:
陈小东
[
Data structs
]
PageProcedure-
DL : 0
模拟页式存储器管理程序(包含最佳置换、先进先出置换、最近最少使用置换算法)-Analog page memory management procedures (including the best replacement FIFO replacement, the least recently used replacement algorithm)
Date
: 2025-12-16
Size
: 3.78mb
User
:
vivian
[
Data structs
]
1
DL : 0
一个操作系统课程设计,用于实现页面置换算法。-An operating system curriculum design, used to implement page replacement algorithms.
Date
: 2025-12-16
Size
: 2kb
User
:
程逸群
[
Data structs
]
yemiandiaodusuanfa
DL : 0
3种页面置换调度算法 先进先出(FIFO) 最近久未使用(LRU) 最佳(OPT)置换算法-Three kinds FIFO page replacement scheduling algorithms (FIFO) recent lack of use (LRU) Best (OPT) replacement algorithm
Date
: 2025-12-16
Size
: 1kb
User
:
颜灏澜
[
Data structs
]
4zhongyemiandiaodusuanfa
DL : 0
基于一个虚拟存储区和内存工作区,设计下述算法并计算访问命中率。 1、最佳淘汰算法(OPT) 2、先进先出的算法(FIFO) 3、最近最久未使用算法(LRU) 4、简单时钟(钟表)算法(CLOCK) 命中率=1-页面失效次数/页地址流(序列)长度 -Based on a virtual memory storage area and work area, the following algorithm design and calculate the hit rate. 1, the best replacement algorithm (OPT) 2, FIFO method (FIFO) 3, the most recent time the use of the algorithm (LRU) 4, simple clock (clock) algorithm (CLOCK) hit rate = 1- the number of page faults/page address stream (sequence) length
Date
: 2025-12-16
Size
: 3kb
User
:
颜灏澜
[
Data structs
]
LRUDemo
DL : 0
使用C#实现操作系统中页面置换算法中的LRU算法-Use C# to achieve the operating system page replacement algorithm LRU algorithm
Date
: 2025-12-16
Size
: 25kb
User
:
杨竹
CodeBus
is one of the largest source code repositories on the Internet!
Contact us :
1999-2046
CodeBus
All Rights Reserved.