# US 2026/0064608 A1 · Combining read requests having spatial locality

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

- Number: US 2026/0064608 A1
- Document ID: US20260064608A1
- Status: Published application
- Kind: A1
- Application number: 19/291,089
- Filed: 2025-08-05
- Published: 2026-03-05
- Earliest claimed: 2023-03-21
- Assignees: Micron Technology, Inc.
- Applicants: Micron Technology, Inc.
- Inventors: Nikesh AGARWAL; Robert M. WALKER
- Web page: https://patentgrep.com/patent/US20260064608A1

## CPC

- G06F 13/1668: {Details of memory controller}
- G06F 13/1673: {using buffers}
- G06F 13/28: using burst mode transfer, e.g. direct memory access {DMA}, cycle steal (G06F13/32 takes precedence)
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

Provided is a memory system and a method for improving bandwidth utilization in the memory system that includes receiving, at a host processor, a first read request from an input buffer, determining a combinable address range associated with the first read request, identifying one or more additional read requests in the input buffer having access addresses within the combinable address range, when one or more additional read requests are identified, modifying the first read request to represent the one or more additional read requests using a bit vector indicating their presence within the combinable address range, packing the modified first read request into a single slot of an outgoing flit, and transmitting the flit over an outgoing communication link.

## Claims

### Claim 1

A method for improving bandwidth utilization in a memory system, the method comprising:
receiving, at a host processor, a first read request from an input buffer;
determining a combinable address range associated with the first read request;
identifying one or more additional read requests in the input buffer having access addresses within the combinable address range;
when one or more additional read requests are identified, modifying the first read request to represent the one or more additional read requests using a bit vector indicating their presence within the combinable address range;
packing the modified first read request into a single slot of an outgoing flit; and
transmitting the flit over an outgoing communication link.

### Claim 2 (depends on 1)

The method of claim 1, wherein the bit vector comprises a plurality of bit positions, each corresponding to a memory address within the combinable address range, and each bit position to indicate the presence or absence of a respective read request.

### Claim 3 (depends on 1)

The method of claim 1, wherein the first read request is initially received as a header, and the bit vector is encoded into the header.

### Claim 4 (depends on 1)

The method of claim 1, further comprising, when no additional read requests are identified within the combinable address range, packing the first read request into a slot of the flit outgoing without modification.

### Claim 5 (depends on 1)

The method of claim 1, wherein the flit comprises a fixed number of slots for memory requests, and packing includes filling as many slots as permitted according to a defined protocol rule.

### Claim 6 (depends on 5)

The method of claim 5, wherein the defined protocol rule used to format the flit is compliant with a standardized communication protocol for high-speed memory access.

### Claim 7 (depends on 1)

The method of claim 1, wherein the transmitted flit includes a combination of read requests and write requests, and each read request occupies one slot, while each write request occupies multiple slots.

### Claim 8 (depends on 6)

The method of claim 6, further comprising transmitting the flit in accordance with predefined constraints of the standardized communication protocol, including limiting a number of consecutive read requests allowed per flit.
