ARC - Adaptive Replacement Cache

[shism2]

Adaptive Replacement Cache is supposed to substantially outperform LRU. Also, there is:

Clock with Adaptive Replacement which has comparable performance. I know I am not showing any "proof" or benchmarks but just wondering.

https://code.google.com/p/custard-cache/source/browse/trunk/custard-cache-policies/src/main/java/com/custardsource/cache/policy/replacement/AdaptiveReplacementCacheManager.java?r=51

[sjudd]

I've heard of this, but I've never looked in to it much. If you want to see if you can use that algorithm to implement Glide's cache interface and put up a pull request, I'd definitely be curious to try it out. You can find the cache interface here:

https://github.com/bumptech/glide/blob/master/library/src/com/bumptech/glide/resize/cache/MemoryCache.java

The clearing memory methods are less important for testing and it seems like the others would be relatively straight forward.

Thanks for pointing this out.

[shism2]

Ok, I will try my best to implement it. We would have to some way of benchmarking it.

[shism2]

Actually, it seems IBM has a patent on the algorithm. Does that mean we can't use it?

[sjudd]

I am not a lawyer, but probably better not to use it, particularly since it seems to have been dropped from some other more prominent projects.