12360903

Cache Coherence Using Dynamic Coarse-Grained Tracking

PublishedJuly 15, 2025
Assigneenot available in USPTO data we have
Technical Abstract

Patent Claims
17 claims

Legal claims defining the scope of protection, as filed with the USPTO.

1

1. A method, comprising: receiving a request for allocating an incoming cacheline to one of a plurality of SFT entries in a snoop filter (SFT); performing a tag lookup function for a tag of the incoming cacheline in the SFT, in response to determining that the incoming cacheline is not part of an existing sector of any of the plurality of SFT entries, finding one or more candidate SFT entries, wherein the candidate SFT entries can be converted to an aggregated entry; selecting one of the candidate SFT entries; and allocating the incoming cacheline to the selected SFT entry, wherein finding one or more candidate SFT entries further comprises finding one or more candidate SFT entries wherein a sector size is less than a predetermined maximum sector size.

2

2. The method of claim 1, further comprising increasing value of a sector size in the selected SFT entry to indicate inclusion of the new cacheline in the SFT, wherein the sector size is part of SFT entry metadata.

3

3. The method of claim 2, wherein in response to determining that the incoming cacheline is not part of an existing sector of any of the plurality of SFT entries and determining that none of the plurality of SFT entries can be converted to an aggregated entry: allocating a new SFT entry to the incoming cacheline; and setting the value of the sector size of the new SFT entry to minimum_entry_size.

4

4. The method of claim 1, wherein the value of the predetermined maximum sector size is programmable by setting one or more registers.

5

5. The method of claim 1, wherein selecting one of the candidate SFT entries further comprises evaluating value of sector size stored in the metadata of the plurality of SFT entries, the sector size value of a given SFT entry indicating a size of a sector being tracked by the given SFT entry.

6

6. The method of claim 5, wherein selecting one of the candidate SFT entries further comprises selecting one of the candidate SFT entries with the smallest value of the sector size.

7

7. The method of claim 1, further comprising: in response to determining that the incoming cacheline is part of an existing sector of given one of the plurality of SFT entries, allocating the incoming cacheline to the given one of the plurality of SFT entries and increasing value of a tracking counter for the given one of the plurality of SFT entries.

8

8. One or more physically manufactured computer-readable storage media, encoding computer-executable instructions for executing on a computer system a computer process, the computer process comprising: receiving a request for allocating an incoming cacheline to one of a plurality of SFT entries in a snoop filter (SFT); performing a tag lookup function for a tag of the incoming cacheline in the SFT, in response to determining that the incoming cacheline is not part of an existing sector of any of the plurality of SFT entries, finding one or more candidate SFT entries, wherein the candidate SFT entries can be converted to an aggregated entry; selecting one of the candidate SFT entries; and allocating the incoming cacheline to the selected SFT entry, wherein the computer process further comprising increasing value of a sector size in the selected SFT entry to indicate inclusion of the new cacheline in the SFT, wherein the sector size is part of SFT entry metadata.

9

9. The one or more physically manufactured computer-readable storage media of claim 8, wherein finding one or more candidate SFT entries further comprises finding one or more candidate SFT entries wherein the sector size is less than a predetermined maximum sector size.

10

10. The one or more physically manufactured computer-readable storage media of claim 8, wherein selecting one of the candidate SFT entries further comprises evaluating value of sector size stored in the metadata of the plurality of SFT entries, the sector size value of a given SFT entry indicating a size of a sector being tracked by the given SFT entry.

11

11. The one or more physically manufactured computer-readable storage media of claim 8, wherein selecting one of the candidate SFT entries further comprises selecting one of the candidate SFT entries with the smallest value of the sector size.

12

12. The one or more physically manufactured computer-readable storage media of claim 8, wherein the computer process further comprising: in response to determining that the incoming cacheline is part of an existing sector of given one of the plurality of SFT entries, allocating the incoming cacheline to the given one of the plurality of SFT entries and increasing value of a tracking counter for the given one of the plurality of SFT entries.

13

13. The one or more physically manufactured computer-readable storage media of claim 8, wherein in response to determining that the incoming cacheline is not part of an existing sector of any of the plurality of SFT entries and determining that none of the plurality of SFT entries can be converted to an aggregated entry: allocating a new SFT entry to the incoming cacheline; and setting the value of the sector size of the new SFT entry to minimum_entry_size.

14

14. A system comprising: memory; one or more processor units; and a cache coherence system stored in the memory and executable by the one or more processor units, the cache coherence system encoding computer-executable instructions on the memory for executing on the one or more processor units a computer process, the computer process comprising: receiving a request for allocating an incoming cacheline to one of a plurality of SFT entries in a snoop filter (SFT); performing a tag lookup function for a tag of the incoming cacheline in the SFT, in response to determining that the incoming cacheline is not part of an existing sector of any of the plurality of SFT entries, finding one or more candidate SFT entries, wherein the candidate SFT entries can be converted to an aggregated entry; selecting one of the candidate SFT entries; and allocating the incoming cacheline to the selected SFT entry, wherein selecting one of the candidate SFT entries further comprises evaluating value of sector size stored in the metadata of the plurality of SFT entries, the sector size value of a given SFT entry indicating a size of a sector being tracked by the given SFT entry.

15

15. The system of claim 14, wherein the computer process further comprising increasing value of a sector size in the selected SFT entry to indicate inclusion of the new cacheline in the SFT, wherein the sector size is part of SFT entry metadata.

16

16. The system of claim 14, wherein finding one or more candidate SFT entries further comprises finding one or more candidate SFT entries wherein the sector size is less than a predetermined maximum sector size.

17

17. The system of claim 14, wherein selecting one of the candidate SFT entries further comprises selecting one of the candidate SFT entries with the smallest value of the sector size.

Patent Metadata

Filing Date

Unknown

Publication Date

July 15, 2025

Inventors

Dimitrios KASERIDIS
Mukund RAMAKRISHNA

Want to explore more patents?

Browse 5M+ US patents with plain-English claim translations and AI-generated analysis.

Citation & reuse

Analysis on this page is generated by Patentable — an AI-powered patent intelligence platform. AI-generated summaries, explanations, and analysis may be reused with attribution and a visible link back to the canonical URL below. Patent abstracts and claims are USPTO public domain.

Cite as: Patentable. “CACHE COHERENCE USING DYNAMIC COARSE-GRAINED TRACKING” (12360903). https://patentable.app/patents/12360903

© 2026 Patentable. All rights reserved.

Patentable is a research and drafting-assistant tool, not a law firm, and does not provide legal advice. Documents we generate are drafts for review by a licensed patent attorney.