# US 2012/0254550 A1 · Bypass and insertion algorithms for exclusive last-level caches

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

- Number: US 2012/0254550 A1
- Document ID: US20120254550A1
- Status: Published application
- Kind: A1
- Application number: 13/078,415
- Filed: 2011-04-01
- Published: 2012-10-04
- Earliest claimed: 2011-04-01
- Assignees: Intel Corporation
- Inventors: Jayesh Gaur; Mainak Chaudhuri; Sreenivas Subramoney
- Web page: https://patentgrep.com/patent/US20120254550A1

## CPC

- G06F 12/0888: using selective caching, e.g. bypass
- G06F 12/0897: with two or more cache hierarchy levels (with multilevel cache hierarchies G06F12/0811)
- G06F 12/122: of the least frequently used [LFU] type, e.g. with individual count value
- G06F 12/128: adapted to multidimensional cache systems, e.g. set-associative, multicache, multiset or multilevel
- 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

An apparatus and method are described for implementing an exclusive lower level cache (LLC) policy within a computer processor. For example, one embodiment of a computer processor comprises: a mid-level cache circuit (MLC) for storing a first set of cache lines containing instructions and/or data; a lower level cache circuit (LLC) for storing a second set of cache lines of instructions and/or data; and an insertion circuit for implementing a policy for inserting or replacing cache lines within the LLC based on values of use recency and use frequency associated with the lines.

## Claims

### Claim 1

A computer processor comprising:
a mid-level cache circuit (MLC) for storing a first set of cache lines containing instructions and/or data;
a lower level cache circuit (LLC) for storing a second set of cache lines of instructions and/or data; and
an insertion circuit for implementing a policy for inserting or replacing cache lines within the LLC based on values of use recency and use frequency associated with the lines.

### Claim 2 (depends on 1)

The computer processor as in claim 1 wherein an exclusive cache policy is implemented such that if a cache line is stored in the LLC it is not stored in the MLC and if a cache line is stored in the MLC it is not stored in the LLC.

### Claim 3 (depends on 1)

The computer processor as in claim 1 wherein the LLC comprises a data structure for storing a trip count (TC) value and use count (UC) value, the TC and UC values being combined to determine whether to insert or not insert a cache line into the LLC.

### Claim 4 (depends on 3)

The computer processor as in claim 3 wherein when a cache line is filled into the MLC from memory or from the LLC by a demand request, its UC value is set to one.

### Claim 5 (depends on 4)

The computer processor as in claim 4 wherein when a cache line is filled into the MLC by a prefetch request, its UC is set to zero.

### Claim 6 (depends on 1)

The computer processor as in claim 1 wherein a plurality of observers are defined which allocate all cache lines in the LLC and implement a static insertion age assignment based on a single-bit trip count (TC) value of an incoming cache line.

### Claim 7

A method comprising:
storing a first set of cache lines containing instructions and/or data in a mid-level cache circuit (MLC);
storing a second set of cache lines of instructions and/or data in a lower level cache circuit (LLC); and
inserting or replacing cache lines within the LLC based on values of use recency and use frequency associated with the lines.

### Claim 8 (depends on 7)

The method as in claim 7 further comprising inserting or replacing the cache lines according to an exclusive cache policy such that if a cache line is stored in the LLC it is not stored in the MLC and if a cache line is stored in the MLC it is not stored in the LLC.

### Claim 9 (depends on 7)

The method as in claim 7 further comprising:
storing a trip count (TC) value and use count (UC) value, the TC and UC values being combined to determine whether to insert or not insert a cache line into the LLC.

### Claim 10 (depends on 9)

The method as in claim 9 further comprising setting a cache line's UC value to one when the cache line is filled into the MLC from memory or from the LLC by a demand request.

### Claim 11 (depends on 10)

The method as in claim 10 further comprising setting the cache line's UC value to zero when the cache line is filled into the MLC by a prefetch request.

### Claim 12 (depends on 7)

The method as in claim 7 further comprising defining a plurality of observers which allocate all cache lines in the LLC and implement a static insertion age assignment based on a single-bit trip count (TC) value of an incoming cache line.

### Claim 13

A computer system comprising
a display device;
a memory for storing instructions;
a processor for processing the instructions, the processor comprising:
a mid-level cache circuit (MLC) for storing a first set of cache lines containing instructions and/or data;
a lower level cache circuit (LLC) for storing a second set of cache lines of instructions and/or data; and
an insertion circuit for implementing a policy for inserting or replacing cache lines within the LLC based on values of use recency and use frequency associated with the lines.

### Claim 14 (depends on 13)

The computer system claim 13 wherein an exclusive cache policy is implemented such that if a cache line is stored in the LLC it is not stored in the MLC and if a cache line is stored in the MLC it is not stored in the LLC.

### Claim 15 (depends on 13)

The computer system as in claim 13 wherein the LLC comprises a data structure for storing a trip count (TC) value and use count (UC) value, the TC and UC values being combined to determine whether to insert or not insert a cache line into the LLC.

### Claim 16 (depends on 15)

The computer system as in claim 15 wherein when a cache line is filled into the MLC from memory or from the LLC by a demand request, its UC value is set to one.

### Claim 17 (depends on 16)

The computer system as in claim 16 wherein when a cache line is filled into the MLC by a prefetch request, its UC is set to zero.

### Claim 18 (depends on 13)

The computer system as in claim 13 wherein a plurality of observers are defined which allocate all cache lines in the LLC and implement a static insertion age assignment based on a single-bit trip count (TC) value of an incoming cache line.
