Description: 先进先出置换页面算法的程序实现
进程执行程序时要访问的...先进先出置换算法FIFO 最近最少使用置换算法LRU 最近未使用置换算法NUR 工作集. ...例:某进程分配页架数为3,其运行期间页面访问序列:A,B,C,D,A,B,E,A,B,C,D,E,分析其按照OPT算法进行页面置换时的缺... -FIFO replacement pages algorithm program implementation process procedures ... to visit the FIFO replacement algorithm using FIFO recently, at least recently LRU algorithm replacement unused replacement algorithm sets NUR work. Cases ... : a page-allocation process at 3, p. during its operation visit face sequence : A, B, C, D, A, B, E, A, B, C, D, E, in accordance with the analysis of its OPT algorithm replacement of pages missing ... Platform: |
Size: 5120 |
Author:asdf |
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: C++写的操作系统原理及实现,模拟页面置换算法FIFO的源码-C++ Write the operating system and realize the principle of simulated FIFO page replacement algorithm for the source Platform: |
Size: 226304 |
Author:woaic |
Hits:
Description: C++代码写的有关页面置换算法的程序 实现OPT 算法 (最优置换算法) 、LRU 算法 (Least Recently) 、 FIFO 算法 (First IN First Out)的模拟-C++ code written on the page replacement algorithm OPT program algorithm (the optimal replacement algorithm), LRU algorithm (Least Recently), FIFO algorithm (First IN First Out) of the simulation Platform: |
Size: 1911808 |
Author:lee |
Hits:
Description: 页面置换算法代码，语言采用c++。实现了FIFO算法，LRU算法，其中，LRU采用经典的LRU算法，由于该算法占用资源较大，多数OS采用改进的LRU算法.-Page replacement algorithm code, the language used c++. The realization of the FIFO algorithm, LRU algorithm, which, LRU classical LRU algorithm, the algorithm is occupied as a result of greater resources, the majority of OS improved LRU algorithm. Platform: |
Size: 238592 |
Author:lee |
Hits:
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: 内存页面置换 用C语言模拟LINUX操作系统中的内存页式管理的FIFO算法和LRU算法-Memory page replacement using C language simulation of LINUX operating system management of memory pages the FIFO algorithm and LRU algorithm Platform: |
Size: 2048 |
Author:love暖色 |
Hits:
Description: 模拟操作系统虚拟存储中的页面置换算法采用FIFO算法,使用的是C语言编程
-Simulate the operating system virtual memory page replacement algorithms used in the FIFO algorithm, using a C language programming Platform: |
Size: 1024 |
Author:麽鱼的谁 |
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: ＦＩＦＯ页面置换算法，用Ｃ语言写的，可以缺页率和缺页次数，同时也可以看到内存分配状态！-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: c语言编写的FIFO页面淘汰算法，对页面访问序列进行处理，显示出换页的过程，并求出缺页率。-c language FIFO page replacement algorithm for page access sequence is processed, showing the paging process and seek vacancy rates page. Platform: |
Size: 1024 |
Author:较傻的瓜 |
Hits:
Description: 使用c++语言设计一个基于MFC的程序，模拟页式存储管理中FIFO、LRU、LFU、OPT四页面置换算法运行的过程。-Use c++ language to design a process to run the algorithm based on the MFC, Analog page memory management FIFO, LRU, LFU, OPT four-page replacement. Platform: |
Size: 6800384 |
Author:杨婧伟 |
Hits:
Description: 模拟操作系统采用OPT、FIFO和LRU算法进行页面置换的过程。
设程序中地址范围为0到32767，采用随机数生成256个指令地址，满足50 的地址是顺序执行，25 向前跳，25 向后跳。为满足上述条件，可采取下列方法：
设d0 10000，第 n个指令地址为dn，第 n+1 个指令地址为dn+1 ，n的取值范围为0 到255。每次生成一个 1 到1024范围内的随机数a，如果a落在1 到512 范围内，则dn+1 dn+1。如果a落在513 到768范围内，则设置dn+1 为1 到dn范围内一个随机数。如果a落在769 到1024范围内，则设置dn+1 为dn到32767范围内一个随机数。
页面大小的取值范围为1K，2K，4K，8K，16K 。按照页面大小将指令地址转化为页号。对于相邻相同的页号，合并为一个。
分配给程序的内存块数取值范围为1 块，2 块，直到程序的页面数。
6、 分别采用OPT、FIFO 和LRU算法对页号序列进行调度，计算出对应的缺页中断率。
打印出页面大小、分配给程序的内存块数、算法名、对应的缺页中断率。
操作系统页面置换算法通过c++实现
-Simulation operating system uses OPT, FIFO and LRU page replacement algorithm process. Let the program addresses the range of 0 to 32767, using a random number generator 256 instruction address, the address is to meet 50 of the order, a 25 jump forward, jump back 25 . To meet the above conditions, you can take the following methods: Let d0 10000, n-th instruction address is dn, the first n+1 instruction address dn+1, n the range of 0-255. 1-1024 each generate a random number within a range, if a falls within the range of 1-512, the dn+1 dn+1. If a falls within the range of 513-768, set dn+1 within the range of 1 to dn a random number. If a falls within the range of 769-1024, is set to dn dn+1 to a random number within the range of 32767. Page size in the range of 1K, 2K, 4K, 8K, 16K. Follow the page size of the instruction address into the page number. For the same adjacent page numbers, into one. Memory blocks allocated to the program in the range of 1, 2, until the page number Platform: |
Size: 2643968 |
Author:黄keke |
Hits:
Description: 最近最少使用页面(FIFO)置换算法，是最简单的页面置换算法。这种算法的基本思想是：当需要淘汰一个页面时，总是选择驻留主存时间最长的页面进行淘汰，即先进入主存的页面先淘汰。其理由是：最早调入主存的页面不再被使用的可能性最大。(Recently, the least use of page (FIFO) replacement algorithm) Platform: |
Size: 1024 |
Author:白茶
|
Hits:
Description: 最简单的分页替换算法就是先进先出算法，当每次有新的分页需要调入时，会选择调入内存时间最久的分页换出。有两种实现的方法：第一种是记录每个分页被调入到页框的时间，当每次需要换出分页时，会找到调入时间最早的一页，也就是在主存储器中存在最久的分页。另外一种方式就是利用FIFO队列来实现，当要进行分页替换时，就把队列最前端的分页换出，再把要调入的分页放到队列的末端。(The simplest paging replacement algorithm is the first in first out algorithm. Each time a new page needs to be transferred in, it will select the page swapping out with the longest time in memory. There are two ways to achieve this: the first is to record the time when each page is called into the page box. When each page needs to be changed out, the earliest page will be found, that is, the longest page in main memory. Another way is to use FIFO queue to achieve, when the page replacement, the front-end of the queue page out, and then put the page to be transferred to the end of the queue.) Platform: |
Size: 1047552 |
Author:91z先生 |
Hits:
Search - page replacement c fifo