On Fri 08 May 2015 05:46:57 PM CEST, Max Reitz wrote: > Let's assume the cache is full. Now this hash algorithm (direct mapped > cache) basically becomes futile, because the LRU algorithm (fully > associative cache) takes over
That's right, although in that scenario I guess there's no good algorithm. Anyway and summarizing that I wrote in a different e-mail, I just thought that starting the lookup always from the beginning was the worst alternative and it was very easy to improve it a bit, but I don't think it has a big impact on the performance. Otherwise I would have evaluated a different data structure. Berto
