Granted Patent B2

US 12,332,794 · App. 18/336,637 · Granted Jun 17, 2025

Inventors: Mukund Ramakrishna (Austin, TX); Dimitrios Kaseridis (Austin, TX)

Assignee: Microsoft Technology Licensing, LLC

G06F12/0817G06F2212/62

Abstract

Claims (36)

1. A method, comprising:

determining a cacheline sector associated with a snoop filter (SFT) having a plurality of SFT entries;

determining a number of cachelines in the identified cacheline sector that are cached by one or more agents;

determining, based on the number of cachelines in the identified cacheline sector that are cached by one or more agents, a number of bits in a bit vector (BV) of one or more of the plurality of SFT entries, wherein the number of bits is required to track the one or more agents; and

determining a number of total agents N that may be tracked by the SFT based on size of the cacheline sector associated with the SFT.

2. The method of claim 1 , further comprising determining the number of total agents N that may be tracked by the SFT based on: a total number of cores tracked by the SFT, size of cacheline, and the size of the cacheline sector associated with the SFT.

3. The method of claim 2 , further comprising:

comparing the number of total agents N that may be tracked by the SFT to a required number of agents to be tracked by the SFT; and

in response to determining that the number of total agents N that may be tracked by the SFT is at or below the required number of agents to be tracked by the SFT, dynamically reducing the size of the cacheline sector associated with the SFT.

4. The method of claim 3 , further comprising:

in response to determining that the number of total agents N that may be tracked by the SFT is at above the required number of agents to be tracked by the SFT, dynamically increasing the size of the cacheline sector associated with the SFT.

5. One or more physically manufactured tangible computer-readable storage media, encoding computer-executable instructions for executing on a computer system a computer process, the computer process comprising:

determining a cacheline sector associated with a snoop filter (SFT) having a plurality of SFT entries;

determining a number of cachelines in the identified cacheline sector that are cached by one or more agents;

determining, based on the number of cachelines in the identified cacheline sector that are cached by one or more agents, a number of bits in a bit vector (BV) of one or more of the plurality of SFT entries, wherein the number of bits are required to track the one or more agents; and

determining a number of total agents N that may be tracked by the SFT based on size of the cacheline sector associated with the SFT.

6. The one or more physically manufactured tangible computer-readable storage media of manufacture of claim 5 , wherein the computer process further comprising determining a number of total agents N that may be tracked by the SFT based on: a total number of cores tracked by the SFT, size of cacheline, and the size of the cacheline sector associated with the SFT.

7. The one or more physically manufactured tangible computer-readable storage media of claim 6 , wherein the computer process further comprising:

comparing the number of total agents N that may be tracked by the SFT to a required number of agents to be tracked by the SFT; and

in response to determining that the number of total agents N that may be tracked by the SFT is at or below the required number of agents to be tracked by the SFT, dynamically reducing the size of the cacheline sector associated with the SFT.

8. The one or more physically manufactured tangible computer-readable storage media of claim 6 , wherein the computer process further comprising:

in response to determining that the number of total agents N that may be tracked by the SFT is at above the required number of agents to be tracked by the SFT, dynamically increasing the size of the cacheline sector associated with the SFT.

9. 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:

determining a cacheline sector associated with a snoop filter (SFT) having a plurality of SFT entries;

determining a number of cachelines in the identified cacheline sector that are cached by one or more agents;

determining, based on the number of cachelines in the identified cacheline sector that are cached by one or more agents, a number of bits in a bit vector (BV) of one or more of the plurality of SFT entries, wherein the number of bits is required to track the one or more agents; and

determining a number of total agents N that may be tracked by the SFT based on size of the cacheline sector associated with the SFT.

10. The system of claim 9 , wherein the computer process further comprising determining a number of total agents N that may be tracked by the SFT based on: a total number of cores tracked by the SFT, size of cacheline, and the size of the cacheline sector associated with the SFT.

11. The system of claim 10 , wherein the computer process further comprising:

comparing the number of total agents N that may be tracked by the SFT to a required number of agents to be tracked by the SFT; and

in response to determining that the number of total agents N that may be tracked by the SFT is at or below the required number of agents to be tracked by the SFT, dynamically reducing the size of the cacheline sector associated with the SFT.

12. The system of claim 10 , wherein the computer process further comprising:

in response to determining that the number of total agents N that may be tracked by the SFT is at above the required number of agents to be tracked by the SFT, dynamically increasing the size of the cacheline sector associated with the SFT.

Assignments (1)

Continuity (1)

References Cited (53)