Description: 模拟分页式虚拟存储管理中硬件的地址转换和缺页中断，以及选择页面调度算法处理缺页中断。
1．模拟分页式存储管理中硬件的地址转换和产生缺页中断。
2．用先进先出（FIFO）页面调度算法处理缺页中断。
3．用最近最少用（LRU）页面调度算法处理缺页中断。
-Analog paging virtual memory management hardware address translation and page fault, and choose a paging algorithm processing a page fault. 1. Analog paging storage management and production of hardware address translation page fault. 2. With FIFO (FIFO) scheduling algorithm page a page fault handling. 3. At least with the recent use (LRU) paging algorithm for processing a page fault. Platform: |
Size: 2048 |
Author:aihao |
Hits:
Description: 编程模拟一个作业的执行过程，用户输入系统分配给该作业的物理块N和该作业要访问的逻辑页号序列长度L，采用下面不同的页面置换算法：FIFO,LRU,OPT,LFR,NUR,给出不同算法下的页面置换情况及其对应的缺页率-Programmed to simulate a job execution, the user input system assigned to the job and the job of physical block N logical page number to access the sequence length L, use the following different page replacement algorithm: FIFO, LRU, OPT, LFR, NUR, given under different page replacement algorithms and their corresponding page fault rate Platform: |
Size: 1024 |
Author:erevus |
Hits:
Description: 操作系统页面置换模拟系统
本软件模拟操作系统的页面置换，共有FIFO、LRU、OPT三种算法可供选择。用户可自行选择随机或手动输入指令序列的地址，本系统将自动显示各种算法的缺页率，以及那一条指令导致缺页-Analog system operating system page replacement operating system, the software simulate page replacement, total FIFO, LRU, OPT three algorithms to choose from. Users can choose a random sequence of instructions or manually enter the address, the system will automatically display the page fault rate of the algorithm, and the instructions which lead to missing pages Platform: |
Size: 62464 |
Author:xuzekun |
Hits:
Description: 编写一个请求页式存储管理模拟程序，通过对页面置换过程的模拟，加深对请求页式存储管理方式基本原理及实现过程的理解。
要求：
1. 从键盘输入页面访问序列及分配给进程的内存块数；
2. 分别采用OPT、FIFO和LRU算法进行页面置换（说明：对于OPT算法，在有多个页面可选的情况下，先淘汰较早进入的页面）。
3. 计算缺页次数及缺页率。
测试用例格式如下：
输入：
算法（1 OPT，2 FIFO，3 LRU）
内存块数
页面序列（页面1,页面2,页面3,...)
输出：
页面变化时内存块装入页面列表1-是否命中/页面变化时内存块装入页面列表2-是否命中/...
缺页次数
其中：
页面变化时内存块装入页面列表：内存块1装入页面,内存块2装入页面,内存块3装入页面...，未装入任何页面时由 -”表示
是否命中：1-命中，0-缺页-Write a request page storage management simulation program, through the page replacement process simulation, to deepen understanding of the requested page storage management basic principles and processes. Requirements: 1. Memory blocks the keyboard to access the page sequence and allocated to the process 2. respectively OPT, FIFO and LRU page replacement algorithm (Note: For OPT algorithm, in case there are multiple pages optional, elimination of early entry into the first page). 3. Calculate the number of page faults and page fault rate. Test format is as follows: Input: Algorithms (1- OPT, 2- FIFO, 3- LRU) memory block sequence number of pages (page 1, page 2, page 3, ...) Output: change the page memory block load page loaded memory block list list of pages that have been hit 1-/2- page changes if hit/... number of page faults wherein: when the page is loaded into memory block change list page: 1 load the page memory block, memory block 2 load the page, the page is loaded ... memo Platform: |
Size: 1024 |
Author:刘先生 |
Hits:
Search - FIFO page-replacement page fault algorithms