Description: c语言实现的页面调度算法,用三种算法实现调度1.先进先出2.OPT3.LRU 2.页面序列从指定的文本文件(TXT文件)中取出3.输出:第一行:每次淘汰的页面号 第二行:显示缺页的总次数(上机已经运行通过!!)-pages scheduling algorithm, a three-Scheduling Algorithm 1. FIFO 2.OPT3.LRU 2. Pages from the designated sequence of text files (TXT) out of three. Output : the first line : each of the pages out of the second line : show na the total number of pages (on the plane had run through! !) Platform: |
Size: 2048 |
Author:zbing0203 |
Hits:
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: 题目:设计一个请求页式存储管理方案,并编写模拟程序实现
具体要求:
1、产生一个需要访问的指令地址流,为不失一般性,可以适当地(用人工指定地方法或用随机数产生器)生成这个序列,使得 50%的指令是顺序执行的。25%的指令均匀地散布在前地址部分,25%的地址是均匀地散布在后地址部分
2、 页面淘汰算法采用 FIFO页面淘汰算法,并且在淘汰一页时,只将该页在页表中抹去。而不再判断它是否被改写过,也不将它写回到辅存
3、产生一个需要访问的指令地址流;指定合适的页面尺寸(例如以1K或2K为1页;指定内存页表的最大长度,并对页表进行初始化
4、每访问一个地址时,首先要计算该地址所在的页的页号,然后查页表,判断该页是否在主存。如果该页已在主存,则打印页表情况;如果该页不在主存且页表未满,则调入一页并打印页表情况;如果该页不在主存且页表已满,则按 FIFO页面淘汰算法淘汰一页后调入所需的页,打印页表情况 。逐个地址访问,直到所有地址访问完毕
-topics : design a request page memory management program, and the simulation program specific requirements : 1. have a need to visit the directive addresses flow, without loss of generality. be appropriate (to use artificial methods specified or random number generator) to form the sequence, makes 50% of the order was the order of implementation. 25% of orders evenly spread address some of the former and 25% of the addresses are evenly spread in the latter part two addresses. The algorithm uses pages out pages out of FIFO algorithm, and eliminate one, the only page in the page table to erase. No longer judge whether it be redrafted, it was not to return to the three auxiliary depositors, have a need to visit the directive addresses flow; designate the appropriate size of the page (for exam Platform: |
Size: 3072 |
Author:周子藤 |
Hits:
Description: 设计一个请求页式存储管理方案。并编写模拟程序实现之。产生一个需要访问的指令地址流。它是一系列需要访问的指令的地址。为不失一般性,你可以适当地(用人工指定地方法或用随机数产生器)生成这个序列,使得 50 %的指令是顺序执行的。 25 %的指令均匀地散布在前地址部分, 25 %的地址是均匀地散布在后地址部分。页面替换算法采用 Fifo 页面替换算法,在发生页替换时,不仅需要更改页表,还需将被替换的页回到辅存。-Page request to design a storage management program. And to prepare the realization of simulation program. A need to access the instruction address stream. It is a series of instructions need to access the address. For losing the general, you can use an appropriate (designated land use of artificial methods or random number generator) to generate this sequence, making 50 of orders are the order of execution. 25 of the command to spread evenly in the former address of 25 percent of the addresses are evenly spread in the latter part of the address. Page replacement algorithm using Fifo page replacement algorithm, page replacement in the event of not only need to change the page tables, will be needed to replace the page to return to Des depositors. Platform: |
Size: 313344 |
Author:小明 |
Hits:
Description: 请求页式存储管理 操作系统课程设计
设计一个请求页式存储管理方案。并编写模拟程序实现之。页面淘汰算法采用 FIFO页面淘汰算法,并且在淘汰一页时,只将该页在页表中抹去。而不再判断它是否被改写过,也不将它写回到辅存-Request page storage management operating system, curriculum design to design a request page storage management programs. And to prepare the realization of simulation program. Page-out algorithm uses FIFO page-out algorithm, and in one out of only the page in the page table to erase. Rather than to judge whether it had been rewritten, not to write it back to Des depositors Platform: |
Size: 261120 |
Author:asfd |
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: 大学生计算机操作系统课程设计,实现页面置换,利用fifo(先进先出)算法-Students of computer operating systems curriculum design, the realization of the page replacement, the use of fifo (FIFO) algorithm Platform: |
Size: 284672 |
Author:王明 |
Hits:
Description: 在c环境下模拟操作系统中的先来先服务算法.-C simulation environment in the operating system of first come first serve algorithm. Platform: |
Size: 3072 |
Author:bgl |
Hits:
Description: 用JAVA实现操作系统的页面置换
其中包括 最佳置换算法(Optimal)、先进先出算法(First-in, First-out) 、最近最久不用的页面置换算法(LeastRecently Used Replacement)三种算法的实现-JAVA realization of the operating system with replacement pages including the best replacement algorithm (Optimal), FIFO algorithm (First-in, First-out), the most recent long-unused page replacement algorithm (LeastRecently Used Replacement) three algorithm Platform: |
Size: 21504 |
Author:王晓 |
Hits:
Description: 实现分页式存储地址转换过程,在此基础上实现请求分页的地址转换。实现请求页式地址转换中出现的缺页现象时,用到的先进先出FIFO、最近最久未使用LRU、最佳OPT置换算法。 -The realization of paging memory address translation process, in this based on the address translation request page. The realization of Page Address Translation request appeared in the phenomenon of missing pages, the use of FIFO FIFO, long the most recent use of LRU, the best replacement algorithm OPT. Platform: |
Size: 1024 |
Author:bartok |
Hits:
Description: 产生一个需要访问的指令地址流。它是一系列需要访问的指令的地址。为不失一般性,你可以适当地(用人工指定地方法或用随机数产生器)生成这个序列。为简单起见,页面淘汰算法采用FIFO页面淘汰算法,并且在淘汰一页时,只将该页在页表中抹去。而不再判断它是否被改写过,也不将它写回到辅存-Generate a need to access the instruction address stream. It is a series of instructions need to access the address. Is without loss of generality, you can properly (using manual methods or the designated land use random number generator) to generate this sequence. For simplicity, the page-out algorithm uses FIFO page-out algorithm, and eliminated one, only to be wiped off the page in the page table. Rather than to determine whether it had been rewritten, not to write it back to secondary memory Platform: |
Size: 3072 |
Author:郭小小 |
Hits: