[Ecls-list] Hopefully some innovation..
Juan Jose Garcia-Ripoll
jjgarcia at users.sourceforge.net
Sat Jan 12 11:54:43 UTC 2008
On 1/12/08, Brian Spilsbury <brian.spilsbury at gmail.com> wrote:
> This means that for an object to be a candidate for deletion it must
> have survived
> one pass, and given that this is a one bit approximation to LRU, that's as old
> as you can measurably get.
Well, as I said, it is probably the one bit restriction and the fact
that this new algorithm adds arbitrary many generations what makes it
more efficient in reducing the probability of a recently added element
to be overwritten.
Facultad de Fisicas, Universidad Complutense,
Ciudad Universitaria s/n Madrid 28040 (Spain)
More information about the ecl-devel