Search - replacement page

Search - replacement page - List

[Linux driver] xuni DL : 0: 编写一个程序，模拟一个页式虚拟存储管理系统。（不考虑地址转换）其中，由系统随机产生进程；进程大小、进程到达次序、时间、进程执行轨迹（页面访问顺序）也随机生成，但进程之间必须有并发存在，进程执行时间需有限，进程调度采用时间片轮转算法（以页面模拟）；物理块分配策略采取固定分配局部置换；分配算法采用按比例分配算法；调页采用请求调页方式；置换采用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.
Date : 2025-12-16 Size : 2kb User : 冯妮
[Linux driver] work4 DL : 0: 随机给出一个页面执行序列，如：1,5,3,4,2,1,3,4,5,7,9,……。要求计算以下几种置换算法的缺页数、缺页率和命中率。   最佳置换算法OPT（Optimal）   先进先出算法FIFO（First In First Out）  最近最少使用算法LRU（Least Recently Used）-Random page gives an execution sequence, such as: 1,5,3,4,2,1,3,4,5,7,9, ....... Require replacement algorithm for computing several missing pages, missing pages rate and hit rate.   optimal replacement algorithm OPT (Optimal)   FIFO algorithm FIFO (First In First Out)  least recently used algorithm LRU (Least Recently Used)
Date : 2025-12-16 Size : 3kb User : 谢韵垚
[Linux driver] Bin DL : 0: 对请求页式管理中页面置换算法的模拟设计，了解虚拟存储技术的特点。-Implement LRU page replacement algorithm
Date : 2025-12-16 Size : 6kb User : 张某某