# US 2026/0099481 A1 · Efficient management of queue entry state

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

- Number: US 2026/0099481 A1
- Document ID: US20260099481A1
- Status: Published application
- Kind: A1
- Application number: 19/185,635
- Filed: 2025-04-22
- Published: 2026-04-09
- Earliest claimed: 2024-10-07
- Assignees: NVIDIA Corporation
- Applicants: NVIDIA Corporation
- Inventors: Ziyad Hakura; Yury Uralsky; Kedar Shripad Joglekar; Hao Zhang; Sriram Venkateshan; Henry Moreton
- Web page: https://patentgrep.com/patent/US20260099481A1

## CPC

- G06F 16/2272: {Management thereof}
- G06F 9/5016: {the resource being the memory}
- G06F 9/542: {Event management; Broadcasting; Multicasting; Notifications}
- G06F 9/544: {Buffers; Shared memory; Pipes}
- G06F 9/546: {Message passing systems or structures, e.g. queues}
- G06F 2209/548: Queue
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Disclosed are systems and techniques for tracking the state of entries in a queue. The techniques include providing a first entry of a queue to a first process and providing a second entry of the queue to a second process. The queue includes a plurality of segments. The techniques further include, responsive to receiving a first signal from the first process, modifying a data structure associated with the queue for the first entry. The data structure associated with the queue includes a plurality of sections. Each section includes one or more counters each associated with a segment of the plurality of segments. The techniques further include, responsive to receiving a second signal from the second process, modifying the data structure associated with the queue for the second entry. The techniques further include modifying a tail pointer of the queue based on the data structure associated with the queue.

## Claims

### Claim 1

A method comprising:
providing a first entry of a queue to a first process, wherein the queue comprises a plurality of segments;
providing a second entry of the queue to a second process;
responsive to receiving a first signal from the first process, modifying a data structure associated with the queue for the first entry, wherein the data structure associated with the queue comprises a plurality of sections, wherein each section comprises one or more counters each associated with a segment of the plurality of segments, and wherein modifying the data structure associated with the queue for the first entry comprises incrementing a first counter;
responsive to receiving a second signal from the second process, modifying the data structure associated with the queue for the second entry, wherein modifying the data structure comprises incrementing a second counter; and
modifying a tail pointer of the queue based on the data structure associated with the queue.

### Claim 2 (depends on 1)

The method of claim 1, wherein:
the first entry is in a first segment of the plurality of segments;
the first counter is associated with the first segment of the plurality of segments;
the second entry is in a second segment of the plurality of segments; and
the second counter is associated with the second segment of the plurality of segments.

### Claim 3 (depends on 2)

The method of claim 2, wherein modifying the tail pointer of the queue based on the data structure associated with the queue comprises, responsive to a particular counter satisfying a threshold criterion, modifying the tail pointer of the queue to equal an end of a particular segment associated with the particular counter.

### Claim 4 (depends on 3)

The method of claim 3, further comprising determining that a head pointer of the queue and the tail pointer point to a same segment of the queue, wherein modifying the tail pointer of the queue based on the data structure associated with the queue comprises, responsive to a counter corresponding to the same segment of the queue satisfying a partial advance criterion, modifying the tail pointer of the queue to equal a position of the head pointer.

### Claim 5 (depends on 2)

The method of claim 2, wherein a first section of the plurality of sections comprises a tail indicator bit, one or more tail address bits, the first counter, and the second counter.

### Claim 6 (depends on 3)

The method of claim 3, wherein the first counter and the second counter each have a guard bit to indicate whether the threshold criterion has been satisfied.

### Claim 7 (depends on 1)

The method of claim 1, wherein the first process is a producer process that stores one or more data values in the first entry of the queue.

### Claim 8

A system comprising:
a memory storing a queue and a data structure associated with the queue, wherein the queue comprises a plurality of segments and the data structure associated with the queue comprises a plurality of sections, and wherein each section comprises one or more counters each associated with a segment of the plurality of segments; and
processing circuitry coupled to the memory, the processing circuitry to:
provide a first entry of the queue to a first process;
provide a second entry of the queue to a second process;
responsive to receiving a first signal from the first process, modify the data structure associated with the queue for the first entry, wherein to modify the data structure for the first entry the processing circuitry is to increment a first counter;
responsive to receiving a second signal from the second process, modify the data structure associated with the queue for the second entry, wherein to modify the data structure for the second entry the processing circuitry is to increment a second counter; and
modify a tail pointer of the queue based on the data structure associated with the queue.

### Claim 9 (depends on 8)

The system of claim 8, wherein:
the first entry is in a first segment of the plurality of segments;
the first counter is associated with the first segment of the plurality of segments;
the second entry is in a second segment of the plurality of segments; and
the second counter is associated with the second segment of the plurality of segments.

### Claim 10 (depends on 9)

The system of claim 9, wherein to modify the tail pointer of the queue based on the data structure associated with the queue, the processing circuitry is to, responsive to a particular counter satisfying a threshold criterion, modify the tail pointer of the queue to equal an end of a particular segment associated with the particular counter.

### Claim 11 (depends on 10)

The system of claim 10, wherein the processing circuitry is further to determine that a head pointer of the queue and the tail pointer point to a same segment of the queue, wherein to modify the tail pointer of the queue based on the data structure associated with the queue, the processing circuitry is to, responsive to a counter corresponding to the same segment of the queue satisfying a partial advance criterion, modify the tail pointer of the queue to equal a position of the head pointer.

### Claim 12 (depends on 9)

The system of claim 9, wherein a first section of the plurality of sections comprises a tail indicator bit, one or more tail address bits, the first counter, and the second counter.

### Claim 13 (depends on 10)

The system of claim 10, wherein the first counter and the second counter each have a guard bit to indicate whether the threshold criterion has been satisfied.

### Claim 14 (depends on 8)

The system of claim 8, wherein the first process is a consumer process that performs one or more operations based on data values in the first entry of the queue.

### Claim 15

A system comprising:
a first processor;
a second processor; and
processing circuitry coupled to the first processor and the second processor, the processing circuitry to:
provide a first entry of a queue to the first processor, wherein the queue comprises a plurality of segments;
provide a second entry of the queue to the second processor;
responsive to receiving a first signal from the first processor, modify a data structure associated with the queue for the first entry, wherein the data structure associated with the queue comprises a plurality of sections, wherein each section comprises one or more counters each associated with a segment of the plurality of segments, and wherein to modify the data structure associated with the queue for the first entry, the processing circuitry is to increment a first counter;
responsive to receiving a second signal from the second processor, modify the data structure associated with the queue for the second entry, wherein to modify the data structure associated with the queue for the second entry, the processing circuitry is to increment a second counter; and
modify a tail pointer of the queue based on the data structure associated with the queue.

### Claim 16 (depends on 15)

The system of claim 15, wherein:
the first entry is in a first segment of the plurality of segments;
the first counter is associated with the first segment of the plurality of segments;
the second entry is in a second segment of the plurality of segments; and
the second counter is associated with the second segment of the plurality of segments.

### Claim 17 (depends on 16)

The system of claim 16, wherein to modify the tail pointer of the queue based on the data structure associated with the queue, the processing circuitry is to, responsive to a particular counter satisfying a threshold criterion, modify the tail pointer of the queue to equal an end of a particular segment associated with the particular counter.

### Claim 18 (depends on 17)

The system of claim 17, wherein the processing circuitry is further to determine that a head pointer of the queue and the tail pointer point to a same segment of the queue, wherein to modify the tail pointer of the queue based on the data structure associated with the queue, the processing circuitry is to, responsive to a counter corresponding to the same segment of the queue satisfying a partial advance criterion, modify the tail pointer of the queue to equal a position of the head pointer.

### Claim 19 (depends on 16)

The system of claim 16, wherein a first section of the plurality of sections comprises a tail indicator bit, one or more tail address bits, the first counter, and the second counter.

### Claim 20 (depends on 17)

The system of claim 17, wherein the first counter and the second counter each have a guard bit to indicate whether the threshold criterion has been satisfied.
