Cache mechanism and method for avoiding cast out on bad victim select and recycling victim select operation
View Patent ↗A method, apparatus, and computer for identifying selection of a bad victim during victim selection at a cache and recovering from such bad victim selection without causing the system to crash or suspend forward progress of the victim selection process. Among the bad victim selection addressed are recovery from selection of a deleted member and recovery from use of LRU state bits that do not map to a member within the congruence class. When LRU victim selection logic generates an output vector identifying a victim, the output vector is checked to ensure that it is a valid vector (non-null) and that it is not pointing to a deleted member. When the output vector is not valid or points to a deleted member, the LRU victim selection logic is triggered to re-start the victim selection process.
1. In a memory component, a method comprising:
selecting a least recently used (LRU) victim member from among a congruence class; and
determining whether the LRU victim member is a bad victim;
responding to a selection of a bad victim by:
triggering a selection of a next victim member from the congruence class in place of the bad victim member;
issuing an LRU mode select input to trigger the LRU victim selection logic to issue the randomly selected member as the victim member, wherein the LRU mode select input defaults to allow a selection of the victim member indicated by the LRU state bits when the victim member is not a bad victim; and
restarting the LRU victim selection logic to select a new victim member from the congruence class when the previous selection resulted in selection of a bad victim.
2. The method of claim 1 , further comprising:
at an LRU victim selection logic, receiving from an LRU state array a plurality of LRU state bits indicating a least recently used member of the congruence class;
initially selecting the member indicated as LRU by the LRU state bits as the LRU victim member; and
outputting an LRU victim vector identifying the location of the LRU victim member.
3. The method of claim 2 , further comprising:
randomly selecting a member to assign as the LRU victim member; and
selecting the next LRU victim from among the randomly selected member and the member that is indicated by the LRU state bits.
4. The method of claim 3 , further comprising discarding a victim vector outputted from the LRU victim selection logic when the victim vector points to a bad victim.
5. The method of claim 3 , further comprising:
determining when the selected victim member is a bad victim, said bad victim being one of a faulty member within a cache line that does not provide proper caching operation, a deleted member, and a phantom member indicated by the LRU state bits when the LRU state bits do not point to one of the members of the congruence class.
6. The method of claim 3 , wherein said determining comprises:
determining when a victim vector outputted from the LRU victim selection logic does not point to any of the members in the congruence class;
determining when the victim vector is a faulty member, such as a deleted member; and
triggering a restart of the victim selection process at the LRU victim selection logic when either comparison yields a positive results.