Search results for "distribution:Cache-Ref Cache::Cache"
Cache::Ref - Memory only cache of live references
Unlike CHI which attempts to address the problem of caching things persistently, this module implements in memory caching, designed primarily for shared references in memory. This collection of classes implements a number of semi related algorithms....
BRUNOV/Cache-Ref-0.04 - 23 Sep 2010 19:55:24 UTC
Cache::Ref::CAR - CLOCK with Adaptive Replacement
This algorithm is an implementation of http://www.almaden.ibm.com/cs/people/dmodha/clockfast.pdf. See also Cache::Ref::CART which is probably more appropriate for random access work loads. CAR balances between an MFU like policy and an MRU like polic...
BRUNOV/Cache-Ref-0.04 - 23 Sep 2010 19:55:24 UTC
Cache::Ref::LRU - Least recently used expiry policy
This is an implementation of the least recently used expiry policy. It provides both an array and a doubly linked list based implementation. See Cache::Ref for a discussion....
BRUNOV/Cache-Ref-0.04 - 23 Sep 2010 19:55:24 UTC
Cache::Ref::LIFO - Saves entries until full, discarding subsequent sets.
This is a very naive cache algorithm, it saves cache sets until the cache is full, at which point all additional saves which aren't a value update are discarded immediately. For very predictable workflows this is potentially a good fit, provided the ...
BRUNOV/Cache-Ref-0.04 - 23 Sep 2010 19:55:24 UTC
Cache::Ref::CART - CAR with temporal filtering
This algorithm is an extension to Cache::Ref::CAR that has temporal filtering on the upgrading from MRU to MFU pool. This means that two subsequent accesses to the same key do not automatically make it viable for long term caching, to get upgraded to...
BRUNOV/Cache-Ref-0.04 - 23 Sep 2010 19:55:24 UTC
Cache::Ref::Null - Caches nothing
This cache implementation will cache nothing. This is primarily intended for testing or comparing runtime without a cache against runtime with a cache. It's like Cache::Null but supports the additional methods in Cache::Ref....
BRUNOV/Cache-Ref-0.04 - 23 Sep 2010 19:55:24 UTC
Cache::Ref::CLOCK - CLOCK cache replacement algorithm
This algorithm is provides a second chance FIFO cache expiry policy using a circular buffer. It is a very well accepted page replacement algorithm, but largely for reasons which are irrelevant in this context (cache hits don't need to be serialized i...
BRUNOV/Cache-Ref-0.04 - 23 Sep 2010 19:55:24 UTC
Cache::Ref::GCLOCK - GCLOCK cache replacement algorithm
This algorithm is related to Cache::Ref::CLOCK but instead of starting all cache hits from "k", a counter is increased on every hit. This provides behavior which models an LFU expiry policy (without taking into account the full keyspace)....
BRUNOV/Cache-Ref-0.04 - 23 Sep 2010 19:55:24 UTC
Cache::Ref::CAR::Base - base clase for CAR and CART
This role provides the common functionality for Cache::Ref::CAR and Cache::Ref::CART....
BRUNOV/Cache-Ref-0.04 - 23 Sep 2010 19:55:24 UTC