Hacker News
new
|
past
|
comments
|
ask
|
show
|
jobs
|
submit
login
qwerta
on Nov 4, 2014
|
parent
|
context
|
favorite
| on:
Cache Eviction: When Are Randomized Algorithms Bet...
In my experience maintaining LRU queue has significant overhead. Random (hash based) displacement has almost zero overhead.
mnw21cam
on Nov 4, 2014
[–]
A fully-associative LRU cache can have significant overhead, yes. An 8-way set-associative LRU cache, not so much.
Guidelines
|
FAQ
|
Lists
|
API
|
Security
|
Legal
|
Apply to YC
|
Contact
Search: