# US 2003/0084253 A1 · Identification of stale entries in a computer cache

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2003/0084253 A1
- Document ID: US20030084253A1
- Status: Published application
- Kind: A1
- Application number: 10/001,594
- Filed: 2001-10-31
- Published: 2003-05-01
- Earliest claimed: 2001-10-31
- Inventors: David J.C. Johnson; Jonathan P. Lotz
- Web page: https://patentgrep.com/patent/US20030084253A1

## CPC

- G06F 12/123: with age lists, e.g. queue, most recently used [MRU] list or least recently used [LRU] list
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A single age-bit may provided for each line in a cache, or for each index. Each time a line, or index, is accessed, or written, the corresponding age-bit is set to a first logical state. A state machine periodically checks the status of each age-bit. If an age-bit is in the first logical state, the state machine sets the age-bit to a second logical state. If the age-bit is already in the second logical state, then the line of data corresponding to the age-bit, or at least one line in the set of lines corresponding to the index corresponding to the age-bit, has not been accessed or changed since the last time the state machine checked the age-bit.

## Claims

### Claim 1

A cache memory system, comprising:
storage for a plurality of data values;
storage for a plurality of age bits, each age bit corresponding to one of the data values; and
each age bit indicating whether the corresponding data value is stale.

### Claim 2 (depends on 1)

The cache memory system of claim 1, further comprising:
each age bit indicating that the corresponding data value is stale when the age bit has remained at a particular logical state for at least a predetermined time period.

### Claim 3 (depends on 2)

The cache memory system of claim 2, further comprising:
a state machine, the state machine periodically determining the state of each age bit, and for each age bit that is not at the particular logical state, setting the state of the age bit to the particular logical state.

### Claim 4 (depends on 1)

The cache memory system of claim 1, further comprising:
each age bit further indicating whether the corresponding data value is modified.

### Claim 5 (depends on 4)

The cache memory system of claim 4, further comprising:
each age bit indicating that the corresponding data value is stale and modified when the age bit has remained at a particular logical state for at least a predetermined time period.

### Claim 6 (depends on 5)

The cache memory system of claim 5, further comprising:
a state machine, the state machine periodically determining the state of each age bit, and for each age bit that is not at the particular logical state, setting the state of the age bit to the particular logical state.

### Claim 7

A method of detecting whether an entry in a cache memory is stale, comprising:
setting a bit to a first logical state when the entry is accessed;
setting the bit to a second logical state; and
determining that the entry is stale when the bit is at the second logical state after at least a predetermined time after being set to the second logical state.

### Claim 8

A method of detecting whether an entry in a cache memory is stale and dirty, comprising:
setting a bit to a first logical state when the entry is written;
setting the bit to a second logical state; and
determining that the entry is stale and dirty when the bit is at the second logical state after at least a predetermined time after being set to the second logical state.

### Claim 9

A method of detecting whether at least one entry in a set of entries in a cache memory is stale, comprising:
setting a bit to a first logical state when an entry corresponding to an index is accessed;
setting the bit to a second logical state; and
determining that at least one entry corresponding to the index is stale when the bit is at the second logical state after at least a predetermined time after being set to the second logical state.

### Claim 10

A method of detecting whether at least one entry in a set of entries in a cache memory is stale and dirty, comprising:
setting a bit to a first logical state when an entry corresponding to an index is modified;
setting the bit to a second logical state; and
determining that at least one entry corresponding to the index is stale and dirty when the bit is at the second logical state after at least a predetermined tine after being set to the second logical state.
