Clock with adaptive replacement
my $c = Cache::Ref::CAR->new(
size => $n,
);
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.
\s-1CAR\s0 balances between an \s-1MFU\s0 like policy and an \s-1MRU\s0 like policy, automatically tuning itself as the workload varies.
The size of the live entries. Note that the cache also remembers this many expired keys, and keeps some metadata about those keys, so for memory usage the overhead is probably around double what Cache::Ref::LRU requires.
Yuval Kogman
This software is copyright (c) 2010 by Yuval Kogman.
This is free software; you can redistribute it and/or modify it under the same terms as the Perl 5 programming language system itself.