3 ms·
> Fully associative cache > Each memory chunk can be stored in any slot in the cache. Effectively, the cache operates like a hash table. Don't hash tables typ
by monocasa 3y ago
> Fully associative cache
> Each memory chunk can be stored in any slot in the cache. Effectively, the cache operates like a hash table.
Don't hash tables typically have only a set number of buckets a given key can use, in contrast to a fully associative structure?
- nick_ 3y agoIIRC, collisions on the address (key) overwrite the previous cache-line. Effectively, it's a most-recently-used "fully associative" structure. At least I think that's why the language seems to be a bit of a stretch.