Location:
Search - cache LRU
Search list
Description: 使用LRU方法更新Cache
结合数据结构的相关知识，使用LRU的策略，对一组访问序列进行内部的Cache更新
并附实验报告-use LRU Cache update method combining data structures and the related knowledge, the use of the LRU strategy the group visited a sequence within the Cache update accompanied experimental report
Platform: |
Size: 14155 |
Author: 小米 |
Hits:
Description: 高速缓存算法类.英文介绍:
The Cache class implements a simple caching mechanism with \"least
recently used\" (LRU) replacement. It is useful for cases in which you
have some memory to spare and you wish to speed up access to frequently
used resources, of which not all will fit into available memory. Thus,
you know you have room in memory for more than 1 resource, but you don t
have room to store all possible resources in memory, so you want to
store some of them. The Cache class helps you to manage the storage in
memory of some subset of all possible resources and therefore speed up
your resource accesses. -cache algorithm category. English presentations : The Cache class implements a simple caching mec mechanism with the "least recently used" (LRU) replac ement. It is useful for cases in which you have so me memory to spare and you wish to speed up access to frequently used resources. not all of which will fit into available memory. Thus, you know you have room in memory for more than a re source. but you don t have room to store all possible RESO ; in memory, so you want to store some of them. The Cache class helps you to manage the storage in memory of some subset of all possible resources and therefore speed up your resource accesses.
Platform: |
Size: 8260 |
Author: 洋场河 |
Hits:
Description: 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.
Platform: |
Size: 51071 |
Author: ytr |
Hits:
Description: 使用LRU方法更新Cache
结合数据结构的相关知识，使用LRU的策略，对一组访问序列进行内部的Cache更新
并附实验报告-use LRU Cache update method combining data structures and the related knowledge, the use of the LRU strategy the group visited a sequence within the Cache update accompanied experimental report
Platform: |
Size: 14336 |
Author: 小米 |
Hits:
Description: 高速缓存算法类.英文介绍:
The Cache class implements a simple caching mechanism with "least
recently used" (LRU) replacement. It is useful for cases in which you
have some memory to spare and you wish to speed up access to frequently
used resources, of which not all will fit into available memory. Thus,
you know you have room in memory for more than 1 resource, but you don t
have room to store all possible resources in memory, so you want to
store some of them. The Cache class helps you to manage the storage in
memory of some subset of all possible resources and therefore speed up
your resource accesses. -cache algorithm category. English presentations : The Cache class implements a simple caching mec mechanism with the "least recently used" (LRU) replac ement. It is useful for cases in which you have so me memory to spare and you wish to speed up access to frequently used resources. not all of which will fit into available memory. Thus, you know you have room in memory for more than a re source. but you don t have room to store all possible RESO ; in memory, so you want to store some of them. The Cache class helps you to manage the storage in memory of some subset of all possible resources and therefore speed up your resource accesses.
Platform: |
Size: 8192 |
Author: 洋场河 |
Hits:
Description: 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.
Platform: |
Size: 51200 |
Author: ytr |
Hits:
Description: 计算机体系结构实验程序，分别采用FIFO与LRU算法实现Cache块的更新，功能更新过程中换入换出、命中等分步动态显示。-Computer architecture experimental procedures, respectively, using FIFO and LRU algorithm Cache block updates, feature updates for the process of being transferred out, hit the sub-step dynamic display.
Platform: |
Size: 2048 |
Author: Diana |
Hits:
Description: 实现LRU算法的Cache源代码，可以用来支持整个系统中某种对象数量的个数限制，同时，通过LRU算法保证使用频度高的对象尽可能的驻留内存。
该算法可以用来支持J2EE系统性能提升，同时又可以控制内存安全使用。-LRU algorithm implementation Cache source code, can be used to support the system as a whole number of objects in a certain number of restrictions, at the same time, through the LRU algorithm to ensure that the use of high frequency of memory-resident object, as far as possible.
The algorithm can be used to support the J2EE system performance, but also can control the memory safe to use.
Platform: |
Size: 12288 |
Author: zzj |
Hits:
Description: 实现LRU算法的cache dotnet C#源码，用来支持asp.net程序提升系统访问速度。同时保证系统能够控制内存的使用不产生泄漏。-LRU algorithm implementation cache dotnet C# source code, used to support asp.net procedures to enhance the speed of system access. At the same time to ensure that the system be able to control the use of memory does not have a leak.
Platform: |
Size: 57344 |
Author: zzj |
Hits:
Description: 国际顶尖期刊上发布的关于多核Cache替换算法的研究论文，非常有参考价值。-Top international journals published on the multi-core Cache replacement algorithm research paper, a very good reference.
Platform: |
Size: 4634624 |
Author: 马鹏斐 |
Hits:
Description: calculate the LRU of cache based on VC
Platform: |
Size: 173056 |
Author: thirtyfive |
Hits:
Description: （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
Platform: |
Size: 653312 |
Author: 鲁龙年 |
Hits:
Description: 实现cache替换算法，思路是改进的LRU和LFU算法，在一定程度上提高了原来的LRU算法的命中率。-Achieve cache replacement algorithm, idea is to improve the LRU and LFU algorithms, to a certain extent, the original LRU algorithm to improve the hit rate.
Platform: |
Size: 4096 |
Author: 闫雪飞 |
Hits:
Description: LRU置换算法是选择最近最久未使用的页面予以置换。该算法赋予每个页面一个访问字段，用来记录一个页面自上次被访问以来经历的时间T，当须淘汰一个页面时，选择现有页面中T值最大的，即最近最久没有访问的页面。这是一个比较合理的置换算法。-LRU replacement algorithm is to select the page from lack of use the most recent to be replaced. The algorithm gives an access field in each page to record a page being accessed has experienced since the last time T, when required to phase out a page, select an existing page, the maximum value of T, that is not a recent visit to the oldest page. This is a reasonable replacement algorithm.
Platform: |
Size: 1024 |
Author: shen6041 |
Hits:
Description: 一个CPU系统中LCACHE的设计，使用LRU算法替换-a LCACHE design in a CPU system, using arithmetic
Platform: |
Size: 4096 |
Author: sunny |
Hits:
Description: LRU算法更新Cache—— 了解和掌握寄存器分配和内存分配的有关技术。 -The LRU algorithm updates the Cache- understand and grasp the register allocation and memory allocation technology.
Platform: |
Size: 3072 |
Author: niwei |
Hits:
Description: CACHE的LRU算法的简单代码，编译运行环境为WINDOWS下VS2010。-CACHE LRU algorithm simple code, compile and run under WINDOWS environment VS2010.
Platform: |
Size: 1024 |
Author: 草广 |
Hits:
Description: cache 模拟器：支持LRU和random两种替换策略-cache simulator: support LRU and random replacement strategies
Platform: |
Size: 2048 |
Author: luluxiu |
Hits:
Description: A C program to show implementation of LRU cache
Platform: |
Size: 2048 |
Author: AMIT KUMAR BAGHEL |
Hits:
Description: 设计和实现一个数据结构最近最少使用(LRU)缓存。它应该支持以下操作:获取和设置。 得到(关键)得到的价值(永远是积极的)关键如果键存在于缓存中,否则返回1。 集(关键字,值)——设置或插入的值如果不是已经存在的关键。当缓存达到容量,应该最近最少使用项失效前插入一个新项。-Design and implement a data structure for Least Recently Used (LRU) cache. It should support the following operations: get and set.
get(key)- Get the value (will always be positive) of the key if the key exists in the cache, otherwise return-1.
set(key, value)- Set or insert the value if the key is not already present. When the cache reached its capacity, it should invalidate the least recently used item before inserting a new item.
Platform: |
Size: 1024 |
Author: 胡延旭 |
Hits: