An Algorithm for Variable Cache Ways

Cache ways are fixed in traditional caches. This paper proposes an algorithm to have variable number of ways in set associative caches. The cache is assumed to be fast registers. A free register to a set is allocated on cold miss. The least recently used policy is used to replace a way in case of no... View More