Evicts blocks from the cache in their order of arrival

Evicts the most recently added block-cache behaves as a stack

are used to keep track of order access

works well with cyclic patterns

Exploits Temporal locality

Number of comparators =

number of lines in a set

Number of sets = Number of lines / k

Number of sets = 2 ^ n --- n here represents

consists of TB, CI, BO

consists of TB, SI, BO

consists of TB, BO only

Doesn’t require any searching, so it’s not expensive as other caches

Instead of specifying a unique location for each memory block, ….. allow a main memory block to be replaced anywhere

Associative memory requires special hardware to allow associative searching and is thus …..

Direct mapped is

direct map is ….

fully associative is ….

it requires a larger tag to be stored with the block which results in a larger cache with special hardware

is a combination of 2 approaches

is like direct mapped in that we use the address to map the block to a certain cache location