Fully Associative Cache#
In a fully associative cache each \(n\)-bit memory address is split into a \(k\)-bit tag and a \(b\)-bit offset.
During read, tag is compared against all stored tags to find if cache hit.
In a fully associative cache each \(n\)-bit memory address is split into a \(k\)-bit tag and a \(b\)-bit offset.
During read, tag is compared against all stored tags to find if cache hit.