# US 2024/0004733 A1 · Data structure for a buffer memory in a multi-producer multi-consumer system

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

- Number: US 2024/0004733 A1
- Document ID: US20240004733A1
- Status: Published application
- Kind: A1
- Application number: 18/251,369
- Filed: 2021-11-02
- Published: 2024-01-04
- Earliest claimed: 2020-11-02
- Assignees: Robert Bosch GmbH
- Applicants: Robert Bosch GmbH
- Inventors: Gerd Hirsch; Matthias Killat
- Web page: https://patentgrep.com/patent/US20240004733A1

## CPC

- G06F 9/544: {Buffers; Shared memory; Pipes}
- G06F 9/546: {Message passing systems or structures, e.g. queues}
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A data structure for a buffer memory for a multi-producer multi-consumer system. The data structure includes at least one slot for storing data, a first queue, a second queue, a third queue. Each slot of the buffer memory is assigned a unique identifier. At all times, each of the identifiers being assigned either to the first queue or to the second queue or to the third queue.

## Claims

### Claim at position 1

1-11. (canceled)

### Claim 12

A data structure for a buffer memory for a multi-producer multi-consumer system, the data structure comprising:
at least one slot for storing data;
a first queue;
a second queue; and
a third queue;
wherein each slot of the buffer memory is assigned a unique identifier, and wherein at any time, each of the identifiers is assigned either to the first queue or to the second queue or to the third queue.

### Claim 13 (depends on 12)

The data structure as recited in claim 12, wherein the identifiers assigned to slots of the buffer memory which are not usable, are assigned to the first queue.

### Claim 14 (depends on 12)

The data structure as recited in claim 12, wherein the identifiers assigned to slots of the buffer memory that are used are assigned to the second queue.

### Claim 15 (depends on 12)

The data structure as recited in claim 12, wherein the identifiers assigned to slots of the buffer memory that are usable are assigned to the third queue.

### Claim 16 (depends on 12)

The data structure as recited in claim 12, wherein each of the identifiers is represented using an integer value.

### Claim 17 (depends on 16)

The data structure as recited in claim 16, wherein the integer value represents the identifier and a write-in cycle.

### Claim 18 (depends on 12)

The data structure as recited in claim 12, wherein each of the first queue, the second queue, and the third queue includes a variable for representing an instantaneous write- in position and a variable for representing an instantaneous read position, the variables each being represented using an integer value, the integer value representing both the position and an instantaneous cycle.

### Claim 19 (depends on 12)

The data structure as recited in claim 12, wherein the first queue, the second queue, and the third queue have the same capacity.

### Claim 20 (depends on 12)

The data structure as recited in claim 12, wherein the first queue, the second queue, and the third queue fulfill a FIFO principle.

### Claim 21 (depends on 12)

The data structure as recited in claim 12, wherein the first queue, the second queue, and the third queue are configured in such a way that lock-free, atomic push operations and lock-free atomic pop operations are executable on the first queue, the second queue, and the third queue.

### Claim 22 (depends on 12)

The data structure as recited in claim 12, wherein a read access and/or a write access to the at least one slot of the buffer memory is possible only with possession of the identifier assigned to the at least one slot.
