Description: (1) 本实验要求使用C语言编程模拟一个拥有若干个虚页的进程在给定的若干个实页中运行、并在缺页中断发生时分别使用FIFO和LRU算法进行页面置换的情形。
(2) 虚页的个数可以事先给定（例如10个），对这些虚页访问的页地址流（其长度可以事先给定，例如20次虚页访问）可以由程序随机产生，也可以事先保存在文件中。
(3) 要求程序运行时屏幕能显示出置换过程中的状态信息并输出访问结束时的页面命中率。
-(1) This experiment requires the use of C language programming simulation of a virtual page number of the process in a given number of pages is running, and when the page fault occurred in, respectively, the use of FIFO and LRU page replacement algorithm of the situation. (2) the number of virtual pages can be given in advance (for example, 10), access to these virtual page address of the page flow (the length can be given in advance, for example, access to 20 virtual pages) can be randomly generated by the procedure can also be pre-stored in the file. (3) the requirements to run when the screen shows the process of replacement of the state information and the output end of the visit of the page hit rate. Platform: |
Size: 47104 |
Author:时间 |
Hits:
Description: 操作系统的课程设计，请求页式管理缺页中断模拟设计-- LRU、OPT， ⑴ 能够输入给作业分配的内存块数；
⑵ 能够输入给定的页面，并计算发生缺页的次数以及缺页率；
⑶ 缺页时，如果发生页面置换，输出淘汰的页号。-Operating system design, management request page page fault analog design- LRU, OPT, ⑴ input to the operation to the distribution of the number of memory blocks ⑵ to enter a given page, and calculate the frequency of occurrence of missing pages and missing pages rate ⑶ missing page, in case of any replacement page, the page out of its output. Platform: |
Size: 91136 |
Author:warmorange |
Hits:
Description: 使用C语言编程模拟一个拥有若干个虚页的进程在给定的若干个实页中运行、并在缺页中断发生时分别使用FIFO和LRU算法进行页面置换的情形。其中虚页的个数可以事先给定（例如10个），对这些虚页访问的页地址流（其长度可以事先给定，例如20次虚页访问）可以由程序随机产生，也可以事先保存在文件中。要求程序运行时屏幕能显示出置换过程中的状态信息并输出访问结束时的页面命中率。程序应允许通过为该进程分配不同的实页数，来比较两种置换算法的稳定性。-Simulated using the C programming language has a number of virtual pages of the process in a given number of real pages to run, and the page fault occurs, respectively, the use of FIFO and LRU algorithm for page replacement situation. The number of virtual pages which can be given in advance (for example, 10), access to these virtual pages page address stream (whose length can be given in advance, for example, 20 virtual pages to access) can be randomly generated by the program can also be saved in advance in the document. Require the program is running the screen can show a displacement in the process of status information and the output end of the visit of the page hit rate. Procedures should be allowed through the process of distribution of the different real number of pages to compare the two kinds of replacement algorithm stability. Platform: |
Size: 1024 |
Author:fujiao |
Hits:
Description: 用C语言编程模拟一个拥有若干个虚页的进程在给定的若干个实页中运行、并在缺页中断发生时使用LRU算法进行页面置换的情形-With C language programming simulate a virtual page has a number of processes in a given number of real pages to run, and the page fault occurs, using the LRU algorithm for page replacement case Platform: |
Size: 33792 |
Author:棉花糖 |
Hits:
Description: 置换策略：也称淘汰策略，涉及的是当内存可用空间不能装下需要调入的信息时，决定调出已占用内存某个区域的那一块信息以便腾出空间。
OPT该算法的基本思想是：发生缺页时，有些页面在内存中，其中有一页将很快被访问(包含紧接着的下一条指令的那页)，而其他页则可能要到10、100、或1000条指令之后才被访问，每个页都可以用在该页面首次被访问前所要执行的指令数进行标记
-Replacement Policy: also known as the phase-out strategy, involving the memory space available when required under can not be installed transferred the information, decided to transfer out of an area has been occupied by the memory of that piece of information in order to make room. The basic idea of the algorithm OPT are: page fault occurs, some pages in memory, of which one will soon be visited (including followed by an instruction that the next page), while other pages have to move to 10,100 , or 1000 instructions only after visit, every page can be used for the first time to visit the page number of instructions to be executed before tagging Platform: |
Size: 172032 |
Author:曾华 |
Hits:
Description: ＦＩＦＯ页面置换算法，用Ｃ语言写的，可以缺页率和缺页次数，同时也可以看到内存分配状态！-FIFO page replacement algorithm, written using C language, and can page fault rate and the number of missing pages, but also can see the memory allocation status! Platform: |
Size: 1024 |
Author:刘蒙 |
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）置换算法，设计要求如下：
⑴ 能够输入给作业分配的内存块数；
⑵ 能够输入给定的页面，并计算发生缺页的次数以及缺页率；
⑶ 缺页时，如果发生页面置换，输出淘汰的页号。-A computer with high-level language to implement demand paging memory management FIFO (FIFO) replacement algorithm, the design requirements are as follows: ⑴ to enter a block of memory allocated to the number of jobs ⑵ to enter a given page, and calculate the occurrence of missing the number of pages and page fault rate ⑶ missing pages, if page replacement occurs, the output out of the page number. Platform: |
Size: 1024 |
Author:张城 |
Hits:
Description: 本课题的目的是要实现缺页处理程序，这需要在适当的时候将某些页面替换出/入。为了减少缺页和将页面从内存淘汰到磁盘的次数，要求你实现五种页面替换算算法。NRU（Not Recently Used）算法SC（Second Chance）算法Clock算法Working Set算法Aging算法
-The purpose of this project is to achieve the page fault handler, this need at the appropriate time to replace some of the pages with entry/exit. Eliminated from memory to the disk number of times in order to reduce the missing pages and page asking you to five kinds of page replacement operator algorithm. NRU (Not Recently Used) algorithm SC Second Chance algorithm Clock algorithm Aging Working Set algorithm algorithm Platform: |
Size: 538624 |
Author:nanyi5452 |
Hits:
Description: 页式存储管理模拟
描述：根据虚地址中的用户号和虚页号同时查快表和慢表，当快表中存在此虚页号，就读出实页号，并计算主存实地址。如果所需页面没有在快表当中，等待慢表的访问结果，如果慢表中也不存在（装入位=0）怎产生缺页中断，调入所需页面，如果主存有空闲页面，则直接调入，否则使用LRU替换算法淘汰主存中某一页，调入新的页面，并更新快表。-Page storage management simulation Description: while the investigation fast and slow table based on the virtual table address user number and the virtual page number, fast table when this virtual page number exists, attending a real page numbers, and calculate the real address of main memory. If the page does not watch them in fast, slow wait for a table to access the desired result, if the table does not exist slow (loading bit = 0) How to generate a page fault, transferred to the desired page, there are free if the main page, directly transferred, otherwise use LRU replacement algorithm eliminated a page in main memory, transferred to a new page, and update the table fast. Platform: |
Size: 1024 |
Author:高昊 |
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 - page replacement number page fault