Description: 功能介绍：
l 输入进程P总共有的页面数，l 并输入系统已经在内存中分配的页面数。当所分配的页面数大于进程P的页面数时，l 则不l 需要进行页面调度工作。
l 由进程P的页面数目，l 程序随机生成一些访问内存的页面号，l 为简化程序，l 这些页面号的数目同l 进程P的进程数目一致（这个缺陷也有待改进）。
l 由用户选择FIFO算法还是LRU算法对进程P的页面访问内存分配的页面进行分配，l 并输出具体的页面访问过程。
原理介绍：
请求页式管理中的置换算法：置换算法在内存中没有空闲页面时调用。它的目的是选出一个被淘汰的页面。如果内存中有足够的空闲页面存放所调入的页，则不必使用置换算法。
先进先出算法FIFO：该算法总是选择在内存驻留时间最长的一页将其淘汰。其认为先调入内存的页不再被访问的可能性要比其他页大，因而选择最先调入内存的页换出。
最近最久没使用页面淘汰算法LRU-functional presentations : 1 P process imported a total of some pages. l and enter the system has been allocated in memory of a few pages. When the distribution of more than a few pages of the process P pages, l l not need pages scheduling work. L P process by the number of pages, l procedures for random number generation to the memory pages, l To simplify procedures, l these pages, with the number of P l process consistent number of processes (the defect has yet to be improved). L chosen by the user FIFO or LRU algorithm algorithm to process P pages allocated to the memory pages for distribution, l and output specific pages course of the visit. Principle introduced : request for the page-style management of replacement algorithm : Replacement Algorithms in memory when no spare pages call. Platform: |
Size: 82885 |
Author:角斗士 |
Hits:
Description: 程序功能主要分为3个部分，分别是对OPT、FIFO、LRU三种页面置换算法的实现。要求3部分的设计应该尽可能使用近似的实现方法。-procedures main function is divided into three parts, namely the OPT, FIFO, three pages replacement LRU algorithm implementation. Part of the three requirements should be designed as far as possible to use similar methods to achieve. Platform: |
Size: 10103 |
Author:gjb |
Hits:
Description: 基本算法思想 OPT：该算法的基本思想是用二维数组page2[40][2] 的第一列存储装入内存的页面，而第二列用作标记位计数器。每当发生缺页时，就从内存中调出一页，首先将内存中的页面一一与要调入内存中的页面之后的页面比较，如果两个页面不相等，则内存中相应的页面的标记位计数器加一，直至到有相等的页面，则该页面的比较停止，再重复以上操作，直至内存中的页面全部比较完。然后找出内存中页面的标记位最大的页面，而该页就是要置换出来的页。 FIFO: 该算法的基本思想是用队列queue存储内存中的页面，队列的特点是先进先出，与该算法是一致的，所以每当发生缺页时，就从队头删除一页，即队头指针加一，而从队尾加入缺页，队尾指针加一。 LRU: 该算法的基本思想是用二维数组page2[40][2] 的第一列存储装入内存的页面，而第二列用作标记位计数器。每当使用页面时，该页面的标记位计数器加一。发生缺页时，就从内存中页面标记最小的一页，调出该页，并且该页后面的页面在数组中的位置前移，而缺页就放在数组后面。-basic algorithm thinking OPT : The basic idea of the algorithm is a two-dimensional array page2 [40] [2], the first storage pages loaded into memory, and the second for the markers out counter. Whenever there are missing pages, from memory a redeployment, the first memory pages on January 1 and transferred to the memory page after page, two pages, if not equal, then the corresponding memory pages marked increase a bit counter, until the equivalent of a page, the page more stop and then to repeat the operation, until the memory of all the pages compared End. Then find memory pages marking the largest-page, the page is to the replacement page. FIFO : The basic idea of the algorithm is used queue queue storage memory pages, and the queue is FIFO features, and the algorithm is the same, so whe Platform: |
Size: 26423 |
Author:何泽荣 |
Hits:
Description: 一个简单的在可变大小对话框或属性页中重置控件的程序！ 作者Marc Richarme -a simple variable size in the dialog box or replacement page attribute controls the procedure! Author Marc Richarme Platform: |
Size: 14582 |
Author:zmin |
Hits:
Description: 程序功能主要分为3个部分，分别是对OPT、FIFO、LRU三种页面置换算法的实现。要求3部分的设计应该尽可能使用近似的实现方法。-procedures main function is divided into three parts, namely the OPT, FIFO, three pages replacement LRU algorithm implementation. Part of the three requirements should be designed as far as possible to use similar methods to achieve. Platform: |
Size: 10240 |
Author:gjb |
Hits:
Description: 这是一个页面置换算法的实现，功能描述：输入可用内存页面数和一个作业访问逻辑页号的序列 *给出FIFO、LRU、OPT算法的缺页中断率 *本程序中设初始页框里的页号与实际页号都不同-This is a page replacement algorithm to achieve functional description : Importation of a few pages available memory and a logic operation visit, the page is given sequence* FIFO, the LRU, OPT algorithm vacancy rate* Page interrupted the proceedings set up the initial page listing page, and the actual page numbers are different Platform: |
Size: 3072 |
Author:齐大永 |
Hits:
Description: 基本算法思想 OPT：该算法的基本思想是用二维数组page2[40][2] 的第一列存储装入内存的页面，而第二列用作标记位计数器。每当发生缺页时，就从内存中调出一页，首先将内存中的页面一一与要调入内存中的页面之后的页面比较，如果两个页面不相等，则内存中相应的页面的标记位计数器加一，直至到有相等的页面，则该页面的比较停止，再重复以上操作，直至内存中的页面全部比较完。然后找出内存中页面的标记位最大的页面，而该页就是要置换出来的页。 FIFO: 该算法的基本思想是用队列queue存储内存中的页面，队列的特点是先进先出，与该算法是一致的，所以每当发生缺页时，就从队头删除一页，即队头指针加一，而从队尾加入缺页，队尾指针加一。 LRU: 该算法的基本思想是用二维数组page2[40][2] 的第一列存储装入内存的页面，而第二列用作标记位计数器。每当使用页面时，该页面的标记位计数器加一。发生缺页时，就从内存中页面标记最小的一页，调出该页，并且该页后面的页面在数组中的位置前移，而缺页就放在数组后面。-basic algorithm thinking OPT : The basic idea of the algorithm is a two-dimensional array page2 [40] [2], the first storage pages loaded into memory, and the second for the markers out counter. Whenever there are missing pages, from memory a redeployment, the first memory pages on January 1 and transferred to the memory page after page, two pages, if not equal, then the corresponding memory pages marked increase a bit counter, until the equivalent of a page, the page more stop and then to repeat the operation, until the memory of all the pages compared End. Then find memory pages marking the largest-page, the page is to the replacement page. FIFO : The basic idea of the algorithm is used queue queue storage memory pages, and the queue is FIFO features, and the algorithm is the same, so whe Platform: |
Size: 26624 |
Author:何泽荣 |
Hits:
Description: 演示了linux下的常用页面置换算法（FIFO,LRU,OPT,LFU,NUR），并计算了相应的命中率。程序用随机函数产生指令序列，然后变换成相应的页地址流。-demonstration of the commonly used algorithm replacement pages (FIFO, the LRU, OPT, LFU, NUR), and calculated the corresponding hit rate. Procedures used functions to generate random instruction sequences, and then converted into the corresponding page addresses flow. Platform: |
Size: 2048 |
Author:衣明玉 |
Hits:
Description: 分别实现最佳置换算法(optimal)、先进先出(FIFO)页面置换算法和最近最久未使用（LRU）置换算法，并给出各算法缺页次数和缺页率。-respectively optimal replacement algorithm (optimal), FIFO (FIFO) page replacement algorithm and the most recent time on the use (LRU) replacement algorithm, the algorithm is given na na page number and page rate. Platform: |
Size: 3072 |
Author:asdf |
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: 模拟分页式虚拟存储管理中硬件的地址转换和缺页中断，以及选择页面调度算法处理缺页中断。
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: 分别实现最佳置换算法(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 algorithm, and gives the algorithm the number of missing pages and missing page rate. Platform: |
Size: 84992 |
Author:唐艰苦 |
Hits:
Search - replacement page