Programming, Cache, Lru, Lip, Bip.
it is a dedicated set for LIP or it is a follower set. Some deterministic techniques such as complement-select policy eliminate the need of keeping two extra bits per set. If there are N sets in the cache and we need K dedicated sets for each replacement policy. We can divide these N sets to N/K