Welcome![Sign In][Sign Up]
Location:
Search - Virtual Memory Management LRU

Search list

[OtherOSkeshe

Description: 操作系统课社 1.理解内存页面调度的机理。 2.掌握几种理论页面置换算法的实现方法。 3.了解HASH表数据结构的使用。 4.通过课程设计比较各种调度算法的优劣。 5.熟悉页面置换算法及其实现,引入计算机系统性能评价方法的概念。页面置换算法是虚拟存储管理实现的关键,通过本次课程设计理解内存页面调度的机制,在模拟实现FIFO、LRU页面置换算法的基础上,比较两种置换算法的效率及优缺点,从而了解虚拟存储实现的过程。 -Operating System Division 1 clubs. To understand the mechanism of memory paging. 2. Have several theories page replacement algorithm method. 3. HASH table to understand the use of data structure. 4. Through the curriculum design to compare the merits of scheduling algorithm. 5. Familiar with the page replacement algorithm and its realization, the introduction of computer systems the concept of performance evaluation methods. Page replacement algorithm is the virtual storage management to achieve the key to the curriculum design through this understanding of memory paging mechanism to achieve in a simulated FIFO, LRU page replacement algorithm based on the comparison of the two replacement algorithm efficiency and the advantages and disadvantages to understand the virtual the realization of the process of storage.
Platform: | Size: 62464 | Author: dongguanghuai | Hits:

[Linux-UnixLinux_2_36060302_36060304_36060307_36060323

Description: 操作系统实验:模拟LINUX操作系统的虚存管理机制,采用多道程序控制方式、多级页表、FIFO请求方式完成对实存辅存的映射管理,处理访存请求。实现了FIFO、LRU、LFU等页表淘汰算法。-Experimental operating system: LINUX operating system simulation of virtual memory management mechanism, the use of multi-channel control mode, multi-level page table, FIFO request a way to keep the existence of the mapping Des management, dealing with the request to visit depositors. The realization of the FIFO, LRU, LFU algorithm, such as page table out.
Platform: | Size: 610304 | Author: 李毅 | Hits:

[Data structs12344

Description: 模拟银行家算法 页式存储管理如何实现地址转换;进一步认识页式虚拟存储管理中如何处理缺页中断。用C++实现LRU置换算法 -Bankers algorithm simulation storage management page addresses how to achieve the conversion a better understanding of virtual memory management page of how to handle page fault. Using C++ to achieve LRU replacement algorithm
Platform: | Size: 284672 | Author: 0 | Hits:

[CSharpxunicunchuqi

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:

[Data structsLRUsuanfamoni

Description: 1.通过本实验的模拟算法理解和加深页式存储管理的地址变换过程。 2.通过模拟LRU算法加强理解和掌握OS中实现虚拟存储器的关键技术。 -1. Through this experiment, the simulation algorithm and deepen understanding of storage management page address translation process. 2. LRU algorithm through simulation to enhance understanding and grasp of OS, the key technology of virtual memory.
Platform: | Size: 8192 | Author: LIULIU | Hits:

[OS DevelopLRU

Description: 关于操作系统的内存管理,如何节省利用容量不大的内存为最多的进程提供资源,一直是研究的重要方向。而内存的虚拟存储管理,是现在最通用,最成功的方式—— 在内存有限的情况下,扩展一部分外存作为虚拟内存,真正的内存只存储当前运行时所用得到信息。这无疑极大地扩充了内存的功能,极大地提高了计算机的并发度。虚拟页式存储管理,则是将进程所需空间划分为多个页面,内存中只存放当前所需页面,其余页面放入外存的管理方式。 -About operating system memory management, how to save use of memory capacity is the most process to provide resources, has been one of the important research direction. And the virtual memory storage management, is now the most versatile, the most successful way-in memory is limited, as part of expansion CRT virtual memory, the real memory storage used when the current operation only get information. This undoubtedly greatly expanded memory function, which has greatly enhanced the computer concurrent degree. Virtual page type storage management, is needed for the process is divided into many pages space, memory storage needed only the current page, the rest of the page into the management method of CRT.
Platform: | Size: 1024 | Author: 王成 | Hits:

[Linux driverxuni

Description: 编写一个程序,模拟一个页式虚拟存储管理系统。(不考虑地址转换) 其中,由系统随机产生进程; 进程大小、进程到达次序、时间、进程执行轨迹(页面访问顺序)也随机生成,但进程之间必须有并发存在,进程执行时间需有限,进程调度采用时间片轮转算法(以页面模拟); 物理块分配策略采取固定分配局部置换; 分配算法采用按比例分配算法; 调页采用请求调页方式; 置换采用LRU算法; 驻留集大小可调,观察驻留集大小对缺页率的影响。-Write a program that simulates a paged virtual memory management system. (Without regard to the address conversion) wherein the system generates a random process process size, the process order of arrival, time, the process execution trace (page access sequence) is randomly generated, but there must exist between concurrent processes, the process time required to perform a limited process scheduling algorithm using time slice (page-analog) physical block allocation strategy to take a fixed allocation of partial replacement allocation algorithm using a pro rata allocation algorithm paging using demand paging mode replacement using LRU algorithm resident set size adjustable observe the resident set size affect the rate of missing pages.
Platform: | Size: 2048 | Author: 冯妮 | Hits:

[OS programOSTest

Description: 根据操作系统虚拟内存的分页请求管理过程编写的一个程序,包括了Optimal,FIFO,LRU三种算法的详细过程-Depending on the operating system virtual memory paging request management process of writing a program, including a detailed process of Optimal, FIFO, LRU three algorithms
Platform: | Size: 533504 | Author: JChubby | Hits:

[OS Developsystem

Description: 页式存储管理模拟 描述:根据虚地址中的用户号和虚页号同时查快表和慢表,当快表中存在此虚页号,就读出实页号,并计算主存实地址。如果所需页面没有在快表当中,等待慢表的访问结果,如果慢表中也不存在(装入位=0)怎产生缺页中断,调入所需页面,如果主存有空闲页面,则直接调入,否则使用LRU替换算法淘汰主存中某一页,调入新的页面,并更新快表。-Page storage management simulation Description: while the investigation fast and slow table based on the virtual table address user number and the virtual page number, fast table when this virtual page number exists, attending a real page numbers, and calculate the real address of main memory. If the page does not watch them in fast, slow wait for a table to access the desired result, if the table does not exist slow (loading bit = 0) How to generate a page fault, transferred to the desired page, there are free if the main page, directly transferred, otherwise use LRU replacement algorithm eliminated a page in main memory, transferred to a new page, and update the table fast.
Platform: | Size: 1024 | Author: 高昊 | Hits:

CodeBus www.codebus.net