Block Replacement If more than one block in a cache set, then a block must be selected to be replaced on a cache miss. Random the block replaced is chosen randomly easy to implement in hardware LRU the least-recently accessed block is chosen reduces miss rates can be expensive to implement for high levels of associativity

Chapter 7: Large and Fast: Exploiting Memory Hierarchy - 38 of 67