Search - replacement page

Search - replacement page - List

[OS Develop] page.change DL : 0: 功能介绍： 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.
Date : 2008-10-13 Size : 80.94kb User : 角斗士
[OS Develop] gjb-page DL : 0: 程序功能主要分为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.
Date : 2008-10-13 Size : 9.87kb User : gjb
[OS Develop] 页面置换算法的模拟实现和计算命中率 DL : 0: 基本算法思想 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
Date : 2008-10-13 Size : 25.8kb User : 何泽荣
[OS Develop] gjb-page DL : 0: 程序功能主要分为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.
Date : 2025-12-16 Size : 10kb User : gjb
[OS Develop] 页面置换算法的模拟实现和计算命中率 DL : 0: 基本算法思想 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
Date : 2025-12-16 Size : 26kb User : 何泽荣
[OS Develop] page.change DL : 0: 功能介绍： 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.
Date : 2025-12-16 Size : 81kb User :
[OS Develop] new DL : 0: 页面置换算法模拟的简单实现,及相关过程.-page replacement algorithm simulation of a simple realization, and the related process.
Date : 2025-12-16 Size : 1kb User : 许
[OS Develop] pagechange DL : 0: 操作系统-页面置换算法（包括OPT、LRU、FIFO三种算法）-Operating system- page replacement algorithms (including OPT, LRU, FIFO three algorithms)
Date : 2025-12-16 Size : 10kb User : fish
[OS Develop] fifo DL : 0: 操作系统中内存页面的先进先出的替换算法fifo-Operating system memory page replacement algorithm FIFO fifo
Date : 2025-12-16 Size : 3kb User : gll
[OS Develop] ymzh DL : 0: 页面置换算法设计一个虚拟存储区和内存工作区,编程序演示FIFO、LRU、OPT算法的具体实现过程,并计算访问命中率.-Page replacement algorithm for the design of a virtual memory storage area and work area, programmed demo FIFO, LRU, OPT algorithm concrete realization of the process and calculate the percentage of hits of the visit.
Date : 2025-12-16 Size : 184kb User : 井
[OS Develop] pm DL : 0: 操作系统请求页式管理置换算法的FIFO、LRU、OPT算法实验源代码-Operating system management request page replacement algorithm for FIFO, LRU, OPT algorithm experimental source code
Date : 2025-12-16 Size : 2kb User : 江彪
[OS Develop] Clock DL : 0: 大学计算机操作系统课程设计，完成页面置换功能，利用clock算法-University computer operating system curriculum design, complete page replacement function, the use of clock algorithm
Date : 2025-12-16 Size : 221kb User : 王明
[OS Develop] qqfy DL : 0: 操作系统的页面置换算法,FIFO,LRU-Operating system page replacement algorithm, FIFO, LRU
Date : 2025-12-16 Size : 3kb User : 叶相延
[OS Develop] clock DL : 0: 操作系统中改进型clock页面置换算法的演示算法-Improved version of the operating system clock page replacement algorithm demonstration algorithm
Date : 2025-12-16 Size : 1kb User :
[OS Develop] FIFO DL : 0: 操作系统实践课程实验，页面置换的4种方法，FIFO等-Practice Course experimental operating system, page replacement of the four kinds of methods, FIFO, etc.
Date : 2025-12-16 Size : 1kb User : gf
[OS Develop] Clock DL : 0: 改进型CLOCK 页面置换算法实现在进程运行过程中，若其要访问的页面不在内存而需要调入内存，但分配该进程的内存空间已经用完时，为了保证该进程能继续执行，需要从内存中把该进程的一些页调入外存中的对换区，但调出那个页面，可以采用不同的算法。-Improved CLOCK page replacement algorithm in the process of running the course, if its trying to access pages of memory need not be transferred to memory, but the distribution of the process had run out of memory space, in order to ensure that the process can continue execution from memory in the process of redeployment of a number of pages for Out-of-Core of the area, but out of that page, you can use different algorithms.
Date : 2025-12-16 Size : 983kb User : 李方
[OS Develop] workplace DL : 0: 是关于页面替换算法的代码模拟，用了三种算法，先进先出，第二次机会，时钟算法-Is on the page replacement algorithm code simulation, using the three algorithms, FIFO, a second chance, the clock algorithm
Date : 2025-12-16 Size : 497kb User : lzh
[OS Develop] page DL : 0: 页面置换算法的模拟实现和计算命中率操作系统必要-Page replacement algorithm simulation and calculation of the percentage of hits to achieve the necessary operating system
Date : 2025-12-16 Size : 26kb User : liuguo
[OS Develop] OperatingSystem DL : 0: 该程序涉及进程创建和撤销相关理论；涉及信号量相关理论；涉及进程调度相关理论；涉及死锁相关理论；涉及页面置换相关理论；涉及磁盘调度相关理论；涉及内存管理相关理论；是一个真实的内核实验，它涉及了可执行文件的装载与重定位。 -The program involves the process of creation and revocation of the relevant theory related Semaphore related theory involved in the process of scheduling theory involving deadlock theory theory involves replacement page involved Disk Scheduling theory involved in memory management theory is a real core experiment, which involves the loading of the executable file and re-positioning.
Date : 2025-12-16 Size : 31kb User : 李方
[OS Develop] FIFO DL : 0: 操作系统WIndows页面置换算法、先进先出算法、以及FIFO和LRU算法（最新最少使用算法）-OS WIndows page replacement algorithm, FIFO algorithm, and FIFO and LRU algorithms (at least using the latest algorithm)
Date : 2025-12-16 Size : 132kb User : 青青

« 12 3 4 5 6 7 8 9 10 »