People are always looking for more effective cache mechanisms, particularly for ways of reducing the miss penalty (for example, using means of annex caches or victim caches). A student makes the following suggestion. Not all data is the same. Some numbers are used more frequently than others, particularly small numbers. So, why not arrange the cache so that if there are two candidates for eviction, the higher value is ejected first? What do you think?