Computer Architecture 2008 – Caches 9 Fully Associative Cache u An address is partitioned to  offset within block  block number u Each block may be mapped to each of the cache lines  Lookup block in all lines u Each cache line has a tag  All tags are compared to the block# in parallel  Need a comparator per line  If one of the tags matches the block#, we have a hit Supply data according to offset Tag Array Tag Tag = Block#Offset Address Fields 0431 Data array 031 Line = = = hitdata
{}