A cache organization in which any data can be placed in any location. It has no conflict misses but must compare against every tag, so it suits small structures such as TLBs rather than large caches.
Field: Memory Hierarchy
In a fully associative cache any data can go anywhere, so the whole cache is a single set.
In a fully associative cache, how many address bits are use…In a fully associative cache any data can go anywhere, so conflict misses from competing for a set disappear.
Which misses are not reduced even by making a cache fully a…LRU replacement Loop blocking Average memory access time Cache line Capacity miss Compulsory miss Conflict miss Direct-mapped cache Miss penalty Non-blocking cache