Search - FIFO LFU

Search - FIFO LFU - List

[GUI Develop] pusula DL : 0: 对页面置换算法的模拟分析，包括FIFO,LRU,OPT,LFU,NUR-right pages replacement algorithm simulation analysis, including FIFO, the LRU, OPT, LFU, NUR
Update : 2025-02-17 Size : 7kb Publisher : 王晓萍
[Linux-Unix] linuxag DL : 0: 演示了linux下的常用页面置换算法（FIFO,LRU,OPT,LFU,NUR），并计算了相应的命中率。程序用随机函数产生指令序列，然后变换成相应的页地址流。-demonstration of the commonly used algorithm replacement pages (FIFO, the LRU, OPT, LFU, NUR), and calculated the corresponding hit rate. Procedures used functions to generate random instruction sequences, and then converted into the corresponding page addresses flow.
Update : 2025-02-17 Size : 2kb Publisher : 衣明玉
[CSharp] OS课题设计 DL : 0: 任务设计一个虚拟存储区和内存工作区，并使用下述算法计算访问命中率。（1）先进先出的算法（FIFO）（2）最近最少使用算法（LRU）（3）最佳淘汰算法（OPT）（4）最少访问页面算法（LFU）（5）最近最不经常使用算法（NUR）命中率=（1 – 页面失效次数）/页地址流长度-mission design a virtual memory storage area and the work area and to use the following algorithm to visit the hit rate. (1) FIFO algorithm (FIFO) (2) at least recently used algorithm (LRU) (3) eliminated the best algorithm (OPT) (4) at least visit pages algorithm (LFU) (5) most recently used algorithm (NUR) life China rate = (1-pages failure number)/page-length addre
Update : 2025-02-17 Size : 2kb Publisher : 东方少秋
[OS program] ymdd DL : 0: 页面调度算法主要有：FIFO，最近最少使用调度算法（LRU），最近最不常用调度算法（LFU），最佳算法（OPT）题目要求： ① 实现三种算法：1、先进先出；2、OPT；3、LRU ② 页面序列从指定的文本文件（TXT文件）中取出 ③ 输出：第一行：每次淘汰的页面号，第二行：显示缺页的总次数 -Main page scheduling algorithm: FIFO, least recently used scheduling algorithm (LRU), least recently used scheduling algorithm (LFU), the best algorithm (OPT) subject requirements: ① the realization of the three algorithms: 1, FIFO 2, OPT 3, LRU ② page sequence from the specified text file (TXT files) out of ③ Output: the first line: every time out the page number, the second line: shows the total number of missing pages
Update : 2025-02-17 Size : 1kb Publisher : sunny
[JSP/Java] cache4j_0.4_src DL : 0: cache4j是一个有简单API与实现快速的Java对象缓存。它的特性包括：在内存中进行缓存，设计用于多线程环境，两种实现：同步与阻塞，多种缓存清除策略：LFU, LRU, FIFO，可使用强引用(strong reference)与软引用(soft reference)存储对象。-cache4j is a simple API and achieving rapid Java Object Cache. Its features include : in memory for caching, designed for multi-threaded environment, the two realized : synchronous and obstruction, cache removal strategies : LFU, LRU, FIFO, can be invoked to use strong (strong reference) with the use of soft (soft referenc e) Storage object.
Update : 2025-02-17 Size : 50kb Publisher : ytr
[Linux-Unix] main DL : 0: 操作系统实验（LINUX）：设计一个虚拟存储区和内存工作区,并使用下列算法计算访问命中率. （1）进先出的算法（FIFO）（2）最近最少使用的算法（LRU）（3）最佳淘汰算法(OPT) （4）最少访问页面算法(LFU) （5）最近最不经常使用算法(NUR) 命中率=(1-页面失效次数)/页地址流长度 -Experimental operating system (LINUX): Design of a virtual memory storage area and work area, and use the following algorithm to visit hit rate. (1) into the algorithm, first-out (FIFO) (2) at least recently used algorithm (LRU) (3 ) the best out of algorithm (OPT) (4) at least visit the page algorithm (LFU) (5) the least frequently used in recent algorithm (NUR) hit rate = (1- page failure number)/page address stream length
Update : 2025-02-17 Size : 2kb Publisher : zengzl
[Windows Develop] suanfa DL : 0: （3）计算并输出下述各种算法在不同内存容量下的命中率。 ①先进先出算法FIFO ②最近最少使用算法LRU ③最佳淘汰算法OPT：先淘汰最不常用的页地址 ④最少访问页面算法LFU ⑤最近最不经常使用算法NUR -(3) calculate and output a variety of algorithms in different memory of the percentage of hits. FIFO FIFO ② ① algorithm least recently used algorithm LRU ③ the best out of algorithm OPT: first out of the least frequently used page address ④ at least visit the page algorithm LFU ⑤ recently the least frequently used algorithm NUR
Update : 2025-02-17 Size : 253kb Publisher : 毕言朋
[OS program] Optimal DL : 0: 存储管理中页面置换算法性能测试要求：设系统采用固定分配局部置换的存储分配策略，编写仿真程序对下述页面置换算法进行性能测试，并对结果进行分析和比较。 (1) 最佳适应(Optimal)页面置换算法； (2) 先进先出(FIFO)页面置换算法； (3) 最近最久未使用(LRU)页面置换算法； (4) 最少使用(LFU)页面置换算法。要求可适用于键盘输入和自动产生随机页面走向序列两种数据输入方式。-Memory management page replacement algorithm in the performance testing requirements: system for the distribution of partial replacement of fixed storage allocation strategy, the preparation of simulation program on the following page replacement algorithm performance testing, and the results were analyzed and compared. (1) the best adaptation (Optimal) page replacement algorithm (2) First In First Out (FIFO) page replacement algorithm (3) the most recent use of long (LRU) page replacement algorithm (4) use at least (LFU) page replacement algorithm. Requirements applicable to the keyboard input and automatically generated pages to a random sequence of two data entry methods.
Update : 2025-02-17 Size : 2kb Publisher : pauly_917
[Linux-Unix] Linux_2_36060302_36060304_36060307_36060323 DL : 0: 操作系统实验：模拟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.
Update : 2025-02-17 Size : 596kb Publisher : 李毅
[Other] fifo DL : 0: c语言实现内存调度 FIFO LFU LRU 基于vc6.0 -c language memory-based FIFO LFU LRU scheduling vc6.0
Update : 2025-02-17 Size : 1kb Publisher : 小弟
[Windows Develop] PageChange DL : 0: 页面置换算法演示及其性能测试系统: 1最佳适应(Optimal) 2先进先出(FIFO) 3最近最久未使用(LRU) 4最少使用(LFU) 5内存页面数配置 6输入测试- the system of Page replace arithmetic demo and to testing of the capability
Update : 2025-02-17 Size : 14kb Publisher : zhhuo
[Other] cache DL : 0: （1）FIFO：First In First Out，先进先出（2）LRU：Least Recently Used，最近最少使用（3）LFU：Least Frequently Used，最不经常使用-（1）FIFO：First In First Out （2）LRU：Least Recently Used （3）LFU：Least Frequently Used
Update : 2025-02-17 Size : 638kb Publisher : 鲁龙年
[JSP/Java] OperatingSystemPageReplacementAlgorithm DL : 0: Java操作系统页面置换算法：（1）进先出的算法（FIFO）（2）最近最少使用的算法（LRU）（3）最佳淘汰算法(OPT) （4）最少访问页面算法(LFU) （注：由本人改成改进型Clock算法）（5）最近最不经常使用算法(NUR) -Java operating system, page replacement algorithm: (1) into the first out method (FIFO) (2) least recently used algorithm (LRU) (3) optimal replacement algorithm (OPT) (4) at least visit the page algorithm (LFU) ( Note: I changed improved by the Clock algorithm) (5) recently least frequently used algorithm (NUR)
Update : 2025-02-17 Size : 335kb Publisher : 李锐歆
[Linux-Unix] FLU DL : 0: LRU算法和FIFO OPT LFU算法 -LRU algorithm and the FIFO OPT LFU algorithm
Update : 2025-02-17 Size : 1kb Publisher : 周俊
[Windows Develop] memoryanalog DL : 0: 模拟内存页面置换的五个算法fifo，opt，lfu，lru，clock-Analog memory page replacement
Update : 2025-02-17 Size : 245kb Publisher : 胡扯蛋
[Windows Develop] 11 DL : 0: lfu and fifo and optimal algoritm comparison
Update : 2025-02-17 Size : 2kb Publisher : ali.saadat81
[Windows Develop] FIFO-LFU DL : 0: 用C语言实现操作系统请求页面调度算法FIFO LFU的实现提前装入0，5,6页最后能够计算出缺页中断率-Operating system using C language the page is requested the implementation of scheduling algorithms FIFO LFU advance into 0,5,6 page last page fault rate to calculate the vacancy
Update : 2025-02-17 Size : 2kb Publisher : sunying
[OS Develop] FIFO-LFU DL : 0: 请求页式管理中的置换算法包括采用LFU（最不经常使用）置换算法采用FIFO（先进先出）置换算法-The request page management of replacement algorithm
Update : 2025-02-17 Size : 1kb Publisher : 周晗
[CSharp] yeshicunchuguanli DL : 0: 操作系统页式存储管理的FIFO,LFU算法-Page memory management of the operating system, FIFO, LFU algorithm
Update : 2025-02-17 Size : 1kb Publisher : 李宇
[CSharp] LFU DL : 0: 是flu算法是在命令行中输入数据流来进行调度，有计算缺页率。不是从txt中读取。是为了。LFU是最近最不常用页面置换算法(Least Frequently Used),也就是淘汰一定时期内被访问次数最少的页!要求在页置换时置换引用计数最小的页，因为经常使用的页应该有一个较大的引用次数-Main page scheduling algorithm: FIFO, least recently used scheduling algorithm (LRU), least recently used scheduling algorithm (LFU), the best algorithm (OPT) subject requirements: ① the realization of the three algorithms: 1, FIFO 2, OPT 3, LRU ② page sequence the specified text file (TXT files) out of ③ Output: the first line: every time out the page number, the second line: shows the total number of missing pages
Update : 2025-02-17 Size : 5kb Publisher : Alice zang

« 12 3 »