Description: 课程实验,自己做的一个关于请求分布的程序,
采用先进先出算法(FIFO)和最近最久未使用算法(LRU)进行页面的置换-courses experiments done on the request of a distribution procedures, FIFO-algorithm (FIFO) and the most recent time on the use of algorithms (LRU) page replacement Platform: |
Size: 360272 |
Author:陈任全 |
Hits:
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: 课程实验,自己做的一个关于请求分布的程序,
采用先进先出算法(FIFO)和最近最久未使用算法(LRU)进行页面的置换-courses experiments done on the request of a distribution procedures, FIFO-algorithm (FIFO) and the most recent time on the use of algorithms (LRU) page replacement Platform: |
Size: 360448 |
Author:陈任全 |
Hits:
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: 82944 |
Author: |
Hits:
Description: 根据请求调页存储管理方式的相关原理，编程模拟实现一个请求调页存储管理系统，该系统的页面置换算法必须包括先进先出页面淘汰算法（FIFO）、最近最少使用LRU页面淘汰算法和最佳淘汰算法。同时系统可以随意设置当前分配给作业的物理块数。
系统运行时，任意输入一个页面访问序列，设定不同的页面置换算法和物理块数，输出其页面淘汰的情况，计算其缺页次数和页面置换次数。
系统结束后，要求比较同一个页面访问序列，在不同的页面置换算法和物理块数的情况下，其产生的缺页次数和页面置换次数，并分析其原因。
-Paging, on request of the related storage management principle, the realization of a programmable analog paging request storage management system, the system s page replacement algorithm must include the page-out algorithm FIFO (FIFO), least recently used LRU algorithm for page-out and the most Jia-out algorithm. At the same time, the current system settings can be allocated to the operation of the physical block number.
Run-time system, a page arbitrarily input sequence set different page replacement algorithms and a number of physical blocks, the output of the circumstances out of its pages to calculate the number of missing pages and the number of page replacement.
System after the request for comparison with the sequence of a page, the page in different physical block replacement algorithm and the number of cases, the resulting lack of page number and the number of page replacement, and to analyze its causes. Platform: |
Size: 7168 |
Author:yangyang |
Hits:
Description: 根据请求调页存储管理方式的相关原理，编程模拟实现一个请求调页存储管理系统，该系统的页面置换算法必须包括先进先出页面淘汰算法（FIFO）、最近最少使用LRU页面淘汰算法和最佳淘汰算法。同时系统可以随意设置当前分配给作业的物理块数。
系统运行时，任意输入一个页面访问序列，设定不同的页面置换算法和物理块数，输出其页面淘汰的情况，计算其缺页次数和页面置换次数。
系统结束后，要求比较同一个页面访问序列，在不同的页面置换算法和物理块数的情况下，其产生的缺页次数和页面置换次数，并分析其原因
-Paging, on request of the related storage management principle, the realization of a programmable analog paging request storage management system, the system s page replacement algorithm must include the page-out algorithm FIFO (FIFO), least recently used LRU algorithm for page-out and the most Jia-out algorithm. At the same time, the current system settings can be allocated to the operation of the physical block number.
Run-time system, a page arbitrarily input sequence set different page replacement algorithms and a number of physical blocks, the output of the circumstances out of its pages to calculate the number of missing pages and the number of page replacement.
System after the request for comparison with the sequence of a page, the page in different physical block replacement algorithm and the number of cases, the resulting lack of page number and the number of page replacement, and analysis of its causes Platform: |
Size: 181248 |
Author:hlhi |
Hits:
Description: 操作系统WIndows页面置换算法、先进先出算法、以及FIFO和LRU算法（最新最少使用算法）-OS WIndows page replacement algorithm, FIFO algorithm, and FIFO and LRU algorithms (at least using the latest algorithm) Platform: |
Size: 135168 |
Author:青青 |
Hits:
Description: 采用页式分配存储方案，通过分别计算不同算法的命中率来比较算法的优劣，同时也考虑页面大小及内存实际容量对命中率的影响；
实现OPT 算法 (最优置换算法) 、LRU 算法 (Least Recently) 、 FIFO 算法 (First IN First Out)的模拟；
-By page type allocation of storage solutions, were calculated by the hit rate of different algorithms to compare the merits of algorithms, taking into account the actual page size and memory capacity of the hit rate achieve OPT algorithm (the optimal replacement algorithm), LRU algorithm ( Least Recently), FIFO algorithm (First IN First Out) of the simulation Platform: |
Size: 4096 |
Author:kkk |
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: 编程模拟一个作业的执行过程，用户输入系统分配给该作业的物理块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）置换算法。给出任意的输入流，计算置换次数。-Page replacement algorithms understand page replacement algorithm, first in first out (FIFO) replacement algorithm and least-recently used (LRU) replacement algorithm. Any given input stream, calculate the number of replacement. Platform: |
Size: 1024 |
Author:瓜哥 |
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: 页面置换算法的实现。里面包含了 LRU ,FIFO, 简单CLOCK，改进的CLOCK,OPT，随机算法这几种算法，然后根据情况选择算法。 -Page replacement algorithm. Which contains the LRU, FIFO, simple and CLOCK to improved CLOCK, OPT, random selection algorithm algorithm for these types of algorithms, and then depending on the circumstances. Platform: |
Size: 2048 |
Author:王心 |
Hits:
Description: c 语言实现页面置换的四种算法，包括FIFO算法，LRU算法，LFU算法和NUR算法-c language four page replacement algorithms, including FIFO algorithm, LRU algorithm, LFU algorithm and NUR algorithm Platform: |
Size: 2048 |
Author:凉茶 |
Hits:
Description: 模拟页式存储系统，模拟内存的页式管理中FIFO、LRU、LFU、OPT置换算法的实现。-The realization of FIFO, LRU, LFU and OPT replacement algorithms in the page management of analog memory is simulated by the page type storage system. Platform: |
Size: 2535424 |
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 - FIFO and LRU page-replacement algorithms