搜索资源列表
page-replacement-algorithm
- 使用c++语言设计一个基于MFC的程序，模拟页式存储管理中FIFO、LRU、LFU、OPT四页面置换算法运行的过程。-Use c++ language to design a process to run the algorithm based on the MFC, Analog page memory management FIFO, LRU, LFU, OPT four-page replacement.
Page-Scheduling-varellow
- 操作系统页面调度算法仿真，包括FIFO，LRU，OPT，LFU，MFU等-Operating system paging algorithm simulation, including FIFO, LRU, OPT, LFU, MFU, etc.
ComArch
- 可视化Cache模拟器，实现了多种功能，可选择写回/不写回、LRU/FIFO/RAND，直写/写缓存等方式-An visiable Cache simulator
OS
- 操作系统的银行家算法，随机产生页面，FIFO和LRU两种算法-Operating system bankers algorithm, randomly generated page, FIFO and LRU two algorithms
MemoryManagement
- java 模拟CPU系统调页，每个页面可存放10条指令，分配给一个作业的内存块为4。模拟一个作业的执行过程，该作业有320条指令，即它的地址空间为32页，采用FIFO、LRU算法，并计算缺页率-java simulation CPU system paging, each page can hold 10 instructions, the job is assigned to a memory block 4. Simulated execution of a job, the job has
LRU
- 操作系统实验课C语言实现的实验简单的最久未使用算法-The most-recently-used experimental simple algorithm operating systems experimental class C language
MemoryManagement
- 内存管野：请求调页处理方式，采用LRU和FIFO两种算法-Memory management field: demand paging approach, using two algorithms LRU and FIFO
LruCacheUnitTests
- Lru Cache Unit Tests Source Code for Linux.
LRUDemo
- 使用C#实现操作系统中页面置换算法中的LRU算法-Use C# to achieve the operating system page replacement algorithm LRU algorithm
OSTest
- 根据操作系统虚拟内存的分页请求管理过程编写的一个程序，包括了Optimal，FIFO，LRU三种算法的详细过程-Depending on the operating system virtual memory paging request management process of writing a program, including a detailed process of Optimal, FIFO, LRU three algorithms
system
- 页式存储管理模拟 描述：根据虚地址中的用户号和虚页号同时查快表和慢表，当快表中存在此虚页号，就读出实页号，并计算主存实地址。如果所需页面没有在快表当中，等待慢表的访问结果，如果慢表中也不存在（装入位=0）怎产生缺页中断，调入所需页面，如果主存有空闲页面，则直接调入，否则使用LRU替换算法淘汰主存中某一页，调入新的页面，并更新快表。-Page storage management simulation Descr iption: while the investigation fast and
OS_Memery_Management
- 操作系统内存管理的淘汰算法模拟(C语言描述，FIFO,LRU,OPT的算法实现及其它算法介绍)-Elimination algorithm simulation operating system memory management (C language descr iption, FIFO, LRU, OPT algorithm and other algorithms introduced)
LinkedHash
- LRU（近期最少使用算法）（双链表-Hash实现），有需要的朋友可以拿来使用（C#）-LRU (least recently used algorithm) (doubly linked list-Hash realized), a friend in need can use use (C#)
fifo
- 页面置换算法 支持:FIFO,LRU，clock算法，最佳置换算法-Page replacement algorithm supports: FIFO, LRU, clock algorithm, the optimal replacement algorithm
lru
- least recently used page replacement algorithm
LRU.C.tar
- least recently used page replacement algorithm
i915_gem_evict
- The goal is to evict objects and amalgamate space in LRU order.
segment-page
- 段页式虚拟设计管理 用于操作系统课程设计作业，可支持LRU和FIFO访问-Virtual Design Management section page
page
- 理解内存页面调度的机制，在模拟实现FIFO、LRU、OPT算法的基础上，比较各种置换算法的效率和优劣，从而了解虚拟储存的实现过程-Understanding of the mechanisms of memory paging, on the basis of the simulation to achieve FIFO, LRU, OPT algorithm, compare the pros and cons of replacement algorithm efficiency and t
os2
- 实现分页式存储地址转换过程，在此基础上实现请求分页的地址转换。实现请求页式地址转换中出现的缺页现象时，用到的先进先出FIFO、最近最久未使用LRU、最佳OPT置换算法。 -Implementation paged memory address translation process, on the basis of the implementation of demand paging address translation.Implement type in the address trans