# US 2026/0064592 A1 · Memory device optimization for parallel data requests

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

- Number: US 2026/0064592 A1
- Document ID: US20260064592A1
- Status: Published application
- Kind: A1
- Application number: 18/941,785
- Filed: 2024-11-08
- Published: 2026-03-05
- Earliest claimed: 2024-08-27
- Assignees: Microchip Technology Incorporated
- Applicants: Microchip Technology Incorporated
- Inventors: Nian Niles Yang; Pitamber Shukla; Achyut Chandulal Gedia
- Web page: https://patentgrep.com/patent/US20260064592A1

## CPC

- G06F 12/0246: {in block erasable memory, e.g. flash memory}
- G06F 12/0646: {Configuration or reconfiguration}
- G06F 9/546: {Message passing systems or structures, e.g. queues}
- G06F 2209/548: Queue
- G06F 2212/7201: Logical to physical mapping or translation of blocks or pages
- G06F 2212/7205: Cleaning, compaction, garbage collection, erase control
- G06F 2212/7208: Multiple device management, e.g. distributing data over multiple flash devices
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)

## Abstract

A data storage system may include a memory device and a controller. The controller may include at least one processor and a memory. The memory may include instructions stored thereon, that when executed by at least one processor, cause the at least one processor to: assign memory spaces of the memory device respectively to corresponding ones of a plurality of data requestors, said memory spaces having corresponding physical addresses; receive data access requests from the plurality of data requestors; generate a queue of the data access requests for accessing the memory device; and responsive to the data access requests, enable the plurality of data requestors to directly access corresponding ones of the respective memory spaces.

## Claims

### Claim 1

A data storage system comprising:
a memory device; and
a controller including at least one processor and a memory, said memory including instructions stored thereon, that when executed by the at least one processor, cause the at least one processor to:
assign memory spaces of the memory device respectively to corresponding ones of a plurality of data requestors, said memory spaces having corresponding physical addresses;
receive data access requests from the plurality of data requestors;
generate a queue of the data access requests for accessing the memory device; and
responsive to the data access requests, enable the plurality of data requestors to directly access corresponding ones of the respective memory spaces.

### Claim 2 (depends on 1)

The data storage system of claim 1,
wherein the respective memory spaces include virtual wordlines and virtual blocks.

### Claim 3 (depends on 1)

The data storage system of claim 1,
wherein the instructions, when executed by the at least one processor, cause the at least one processor to:
collect telemetry data of the memory device; and
modify memory space assignments for a subset of the respective memory spaces based on the collected telemetry data.

### Claim 4 (depends on 3)

The data storage system of claim 3,
wherein the instructions, when executed by the at least one processor, cause the at least one processor to:
send updated physical addresses of the subset of the memory spaces to those of the plurality of data requestors having modified memory space assignments.

### Claim 5 (depends on 3)

The data storage system of claim 3,
wherein the telemetry data includes a status and usage data for the memory spaces.

### Claim 6 (depends on 5)

The data storage system of claim 5,
wherein the modification of the memory space assignments includes changing memory space assignments for at least some of the plurality of data requestors based on the telemetry data.

### Claim 7 (depends on 1)

The data storage system of claim 1,
wherein the queue defines respective time slices for enabling the plurality of data requestors to directly access the corresponding ones of the respective memory spaces.

### Claim 8 (depends on 1)

The data storage system of claim 1,
wherein the instructions, when executed by the at least one processor, cause the at least one processor to:
perform wear leveling and garbage collection (GC) operations on respective ones of the memory spaces; and
modify memory space assignments for a subset of the respective ones of the memory spaces based on the wear leveling and GC operations.

### Claim 9

A computer-implemented method, comprising:
assigning memory spaces of a memory device respectively to corresponding ones of a plurality of data requestors, said respective memory spaces having corresponding physical addresses;
receiving data access requests from a subset of the plurality of data requestors, said data access requests including respective physical addresses of the corresponding physical addresses;
generating a queue of the data access requests for accessing the memory device; and
responsive to the data access requests, enabling the subset of the plurality of data requestors to directly access the memory device.

### Claim 10 (depends on 9)

The computer-implemented method of claim 9, comprising:
collecting telemetry data of the memory device; and
modifying memory space assignments for a subset of the respective memory spaces based on the collected telemetry data, wherein the respective memory spaces include virtual wordlines and virtual blocks.

### Claim 11 (depends on 10)

The computer-implemented method of claim 10, comprising:
sending updated physical addresses of the subset of the memory spaces to those of the plurality of data requestors having modified memory space assignments.

### Claim 12 (depends on 10)

The computer-implemented method of claim 10,
wherein the telemetry data includes a status and usage data for the memory spaces,
wherein modifying the memory space assignments includes changing memory space assignments for at least some of the plurality of data requestors based on the telemetry data.

### Claim 13 (depends on 9)

The computer-implemented method of claim 9,
wherein the queue defines respective time slices for enabling the plurality of data requestors to directly access the corresponding ones of the respective memory spaces, wherein the respective memory spaces include virtual wordlines and virtual blocks.

### Claim 14

Non-transitory computer readable media having instructions stored thereon, that when executed by at least one processor, cause the at least one processor to:
assign memory spaces of the memory device respectively to corresponding ones of a plurality of data requestors, said memory spaces having corresponding physical addresses;
receive data access requests from the plurality of data requestors;
generate a queue of the data access requests for accessing the memory device; and
responsive to the data access requests, enable the plurality of data requestors to directly access corresponding ones of the respective memory spaces.

### Claim 15 (depends on 14)

The non-transitory computer readable media of claim 14,
wherein the respective memory spaces include virtual wordlines and virtual blocks.

### Claim 16 (depends on 14)

The non-transitory computer readable media of claim 14,
wherein the instructions, when executed by the at least one processor, cause the at least one processor to:
collect telemetry data of the memory device; and
modify memory space assignments for a subset of the respective memory spaces based on the collected telemetry data.

### Claim 17 (depends on 16)

The non-transitory computer readable media of claim 16,
wherein the instructions, when executed by the at least one processor, cause the at least one processor to:
send updated physical addresses of the subset of the memory spaces to those of the plurality of data requestors having modified memory space assignments.

### Claim 18 (depends on 16)

The non-transitory computer readable media of claim 16,
wherein the telemetry data includes a status and usage data for the memory spaces.

### Claim 19 (depends on 18)

The non-transitory computer readable media of claim 18,
wherein the modification of the memory space assignments includes changing memory space assignments for at least some of the plurality of data requestors based on the telemetry data.

### Claim 20 (depends on 14)

The non-transitory computer readable media of claim 14,
wherein the queue defines respective time slices for enabling the plurality of data requestors to directly access the corresponding ones of the respective memory spaces.
