« It's All Garbage | Main | Log Structured File System for Dummies »

April 03, 2011


Benjamin Manes

If I recall correctly, it also does not perform an LRU reordering of an entry if it has been reordered recently. This is a fair decision given the size of the cache as it maintains relative decency, but it is not a strict LRU. An efficient approach that avoids a background sweeper thread is lock amortization, which is used by ConcurrentLinkedHashMap to provide a non-blocking LRU data structure.

The comments to this entry are closed.