SEQUENCE THRASHING AVOIDANCE VIA FALL THROUGH ESTIMATION

One example method includes determining a fall through threshold value for a cache, computing a length 's' of a sequence that is close to LRU eviction, and the length 's' is computed when a current fall through metric value is greater than the fall through threshold value, when the sequence length 's' is greater than a predetermined threshold length 'k,' performing a first shift of an LRU position to define a protected queue of the cache, initializing a counter with a value of 'r', decrementing the counter each time a requested page is determined to be included in the protected queue, until 'r'=0, and performing a second shift of the LRU position.