$>$ The ways of a set can be viewed as a priority list, ordered

from high priority to low priority. Every time the set is touched, the list can be

reorganized to change block priorities. With this view, cache management policies

can be decomposed into three sub$-$policies: Insertion, Promotion, and Victim

Selection. Insertion defines where newly fetched blocks are placed in the priority

list. Promotion defines how a block$$s position in the list is changed every time it is

touched $($a cache hit$).$ Victim Selection defines which entry of the list is evicted to

make room for a new block when there is a cache miss.