# US 2024/0202124 A1 · Snoop filter for large cache using hash technique with optimal refresh algorithm

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

- Number: US 2024/0202124 A1
- Document ID: US20240202124A1
- Status: Published application
- Kind: A1
- Application number: 18/067,779
- Filed: 2022-12-19
- Published: 2024-06-20
- Earliest claimed: 2022-12-19
- Assignees: Intel Corporation
- Applicants: Intel Corporation
- Inventors: Israel Diamand; Randy Osborne; Nadav Bonen
- Web page: https://patentgrep.com/patent/US20240202124A1

## CPC

- G06F 12/0831: using a bus scheme, e.g. with bus monitoring or watching means
- G06F 12/0864: using pseudo-associative means, e.g. set-associative or hashing
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Embodiments described herein may include apparatus, systems, techniques, and/or processes that are directed to computing systems implementing a very large cache for one or more processing engines in a shared memory system. According to various embodiments, a snoop filter tracks a hash value of the cached addresses instead of tracking the addresses themselves. Tracking hash values introduces inaccuracy and an inability to easily clean or refresh the snoop filter. A refresh algorithm maintains cache coherency without significant performance degradation. The cache refresh algorithm keeps the accuracy of the snoop filter, hence reducing the latency and power effects of false snoops. Further, the use of hash values reduces the hardware cost over traditional snoop filters.

## Claims

### Claim 1

At least one machine readable medium comprising a plurality of instructions which, when executed on a computing device, cause the computing device to:
detect a memory access with a physical address to a shared memory;
create a hash value of a subset of the physical address;
identify a state bit corresponding to the hash value in a snoop filter cache tag array; and
snoop a cache with the physical address if the state bit is set.

### Claim 2 (depends on 1)

The machine-readable medium of claim 1, wherein the state bit indicates there is a chance the physical address is owned by the cache if set and indicates the physical address is not owned by the cache if not set.

### Claim 3 (depends on 1)

The machine-readable medium of claim 1, the plurality of instructions further cause the computing device to refresh a first portion of the snoop filter cache tag array, the refresh comprising:
initiating requests for ownership of a set of physical addresses of data stored in the cache;
creating a new hash value for an approved address of the set of physical addresses, recording the new hash value in a second portion of the snoop filter cache tag array and setting a corresponding new state bit in the second portion of the snoop filter cache tag array; and
repeating the creating, the recording, and the setting for each approved address of the set of physical addresses; and
clearing the first portion of the snoop filter cache tag array after all of the requests for ownership have been processed.

### Claim 4 (depends on 3)

The machine-readable medium of claim 3, wherein the refresh further comprises:
detecting another memory access with another physical address to the shared memory;
creating another hash value of a subset of the another physical address;
identifying a first state bit corresponding to the another hash value in the first portion of the snoop filter cache tag array, and identifying a second state bit corresponding to the another hash value in the second portion of the snoop filter cache tag array; and
snooping the cache with the another physical address if at least one of the first state bit and the second state bit is set.

### Claim 5 (depends on 4)

The machine-readable medium of claim 4, wherein the first and the second state bits indicate there is a chance the another physical address is owned by the cache if either is set and indicating the another physical address is not owned by the cache if both the first and the second state bits are not set.

### Claim 6 (depends on 4)

The machine-readable medium of claim 4, wherein the snooping the cache with the another physical address results in a redundant snoop.

### Claim 7 (depends on 4)

The machine-readable medium of claim 4, wherein the refresh is initiated when a number of snoops exceeds a set threshold.

### Claim 8 (depends on 4)

The machine-readable medium of claim 4, wherein the another hash value represents more than one physical address.

### Claim 9

An apparatus comprising:
a snoop filter to maintain coherency of a cache, the snoop filter comprising:
an encoded value generator to create an encoded value from a subset of a physical address of data stored in the cache, the encoded value generator to create another encoded value from another subset of another physical address of a memory transaction;
a snoop filter cache tag array to store the encoded value and set a corresponding state bit;
the snoop filter to identify the another encoded value in the snoop filter cache tag array and another corresponding state bit; the snoop filter to initiate a snoop of the cache if the another corresponding state bit is set.

### Claim 10 (depends on 9)

The apparatus of claim 9, wherein the state bit indicates there is a chance the physical address is owned by the cache if set and indicates the physical address is not owned by the cache if not set.

### Claim 11 (depends on 9)

The apparatus of claim 9, wherein the snoop filter further to initiate a refresh of a first portion of the snoop filter cache tag array and store refreshed data in a second portion of the snoop filter cache tag array, wherein if a new memory transaction is observed during the refresh, the snoop filter to check both the first portion and the second portion of the snoop filter cache tag array for the new encoded value of the new physical address to determine if the cache owns the new physical address.

### Claim 12 (depends on 11)

The apparatus of claim 11, the snoop filter to further clear the first portion of the snoop filter cache tag array when the refresh is complete.

### Claim 13 (depends on 11)

The apparatus of claim 11, wherein the snoop filter to initiate the refresh when a number of snoops exceeds a set threshold.

### Claim 14 (depends on 11)

The apparatus of claim 11, wherein the encoded value represents more than one physical address.

### Claim 15

A system apparatus comprising:
a cache and a cache tag array; and
a snoop filter to maintain coherency of the cache, the snoop filter comprising:
an encoded value generator to create an encoded value from a subset of a physical address of data stored in the cache, the encoded value generator to create another encoded value from another subset of another physical address of a memory transaction;
a snoop filter tag array to store the encoded value and set a corresponding state bit;
the snoop filter to identify the another encoded value in the snoop filter tag array and another corresponding state bit; the snoop filter to initiate a snoop of the cache if the another corresponding state bit is set;
wherein the snoop tag array is 1/Nth a size of the cache tag array, and N is at least 2.

### Claim 16 (depends on 15)

The system of claim 15, wherein the state bit indicates there is a chance the physical address is owned by the cache if set and indicates the physical address is not owned by the cache if not set.

### Claim 17 (depends on 15)

The system of claim 15, wherein the snoop filter further to initiate a refresh of a first portion of the snoop filter tag array and store refreshed data in a second portion of the snoop filter tag array, wherein if a new memory transaction is observed during the refresh, the snoop filter to check both the first portion and the second portion of the snoop filter tag array for the new encoded value of the new physical address to determine if the cache does not own the new physical address.

### Claim 18 (depends on 17)

The system of claim 17, the snoop filter to further clear the first portion of the snoop filter tag array when the refresh is complete.

### Claim 19 (depends on 17)

The system of claim 17, wherein the snoop filter to initiate the refresh when a number of set state bits exceeds a set threshold.

### Claim 20 (depends on 17)

The system of claim 17, wherein the encoded value represents more than one physical address.
