Overlapped access

With cache, access can also be overlapped: the cache is checked in parallel with checking main memory. If the address is not found in the cache, there is slightly less of a penalty. However, this requires more advanced hardware and more power. With overlapped access, the effective access time becomes:

$$EAT=(HR\times \text{cache access})+(MR\times \text{main memory access})$$