# US 2026/0086871 A1 · Systems and methods for write distribution with a scheduler

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

- Number: US 2026/0086871 A1
- Document ID: US20260086871A1
- Status: Published application
- Kind: A1
- Application number: 18/890,906
- Filed: 2024-09-20
- Published: 2026-03-26
- Earliest claimed: 2024-09-20
- Assignees: Dell Products L.P.
- Applicants: Dell Products L.P.
- Inventors: Rong Yu; Lixin Pang; Sean Hu
- Web page: https://patentgrep.com/patent/US20260086871A1

## CPC

- G06F 9/505: {considering the load}
- G06F 3/061: {Improving I/O performance}
- G06F 3/0659: {Command handling arrangements, e.g. command buffers, queues, command scheduling}
- G06F 3/067: {Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]}
- G06F 3/0688: {Non-volatile semiconductor memory arrays}
- G06F 9/5016: {the resource being the memory}
- G06N 3/08: Learning methods
- G06N 5/01: Dynamic search techniques; Heuristics; Dynamic trees; Branch-and-bound
- G06N 20/00: Machine learning
- G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N)
- G06N: COMPUTING ARRANGEMENTS BASED ON SPECIFIC COMPUTATIONAL MODELS

## Abstract

A front-end, device group-based system and method in a storage array is disclosed for using a per-node request scheduler to monitor real-time I/O request distributions and forward I/O requests to a selected middle layer candidate node based on the resources and statistics of the middle layer and back end nodes present in a storage array. A scheduler on each middle layer node may be responsible for distributing I/O requests for a specific set of front-end devices. The scheduler may detect a skew in I/O request distribution and adjust distribution accordingly.

## Claims

### Claim 1

A method comprising:
assigning each of a plurality of front end nodes in a storage array to a device group;
receiving at a first front end node an input/output (I/O) request;
sending the I/O request to a middle layer node associated with the device group;
selecting by a per-node scheduler a destination node to process the request, the destination node selected according to one or more I/O statistics relating to the storage array; and
transmitting the I/O request to the destination node for destaging.

### Claim 2 (depends on 1)

The method of claim 1 wherein selecting a destination node is based on balancing storage array resources.

### Claim 3 (depends on 1)

The method of claim 1 wherein the I/O statistics are stored in a database accessible to all nodes of the storage array.

### Claim 4 (depends on 3)

The method of claim 3 wherein the database is copied to a global memory in communication with the middle layer.

### Claim 5 (depends on 3)

The method of claim 3 wherein the middle layer is configured to update the database periodically.

### Claim 6 (depends on 1)

The method of claim 1 wherein the I/O statistics include one or more of a pending I/O count, queue depth, back end response time, CPU utilization, and write pending level.

### Claim 7 (depends on 1)

The method of claim 1 wherein selecting a destination node includes using a weighted model.

### Claim 8 (depends on 1)

The method of claim 1 wherein selecting a destination node includes using a machine learning model.

### Claim 9

A system comprising:
a memory; and
at least one processor that is operatively coupled to the memory, the at least one processor being configured to perform the operations of:
assigning each of a plurality of front end nodes in a storage array to a device group;
receiving at a first front end node an input/output (I/O) request;
sending the I/O request to a middle layer node associated with the device group;
selecting by a per-node scheduler a destination node to process the request, the destination node selected according to one or more I/O statistics relating to the storage array; and
transmitting the I/O request to the destination node for destaging.

### Claim 10 (depends on 9)

The system of claim 9 wherein selecting a destination node is based on balancing storage array resources.

### Claim 11 (depends on 9)

The system of claim 9 wherein the I/O statistics are stored in a database accessible to all nodes of the storage array.

### Claim 12 (depends on 11)

The system of claim 11 wherein the database is copied to a global memory in communication with the middle layer.

### Claim 13 (depends on 11)

The system of claim 11 wherein the middle layer is configured to update the database periodically.

### Claim 14 (depends on 9)

The system of claim 9 wherein the I/O statistics include one or more of a pending I/O count, queue depth, back end response time, CPU utilization, and write pending level.

### Claim 15 (depends on 9)

The system of claim 9 wherein selecting a destination node includes using one of a weighted model and a machine learning model.

### Claim 16

A non-transitory computer-readable medium storing one or more processor-executable instructions, which when executed by at least one processor cause the at least one processor to perform the operations of:
assigning each of a plurality of front end nodes in a storage array to a device group;
receiving at a first front end node an input/output (I/O) request;
sending the I/O request to a middle layer node associated with the device group;
selecting by a per-node scheduler a destination node to process the request, the destination node selected according to one or more I/O statistics relating to the storage array; and
transmitting the I/O request to the destination node for destaging.

### Claim 17 (depends on 16)

The non-transitory computer-readable medium of claim 16 wherein the I/O statistics are stored in a database accessible to all nodes of the storage array.

### Claim 18 (depends on 17)

The non-transitory computer-readable medium of claim 17 wherein the middle layer is configured to update the database periodically.

### Claim 19 (depends on 16)

The non-transitory computer-readable medium of claim 16 wherein the I/O statistics include one or more of a pending I/O count, queue depth, back end response time, CPU utilization, and write pending level.

### Claim 20 (depends on 16)

The non-transitory computer-readable medium of claim 16 wherein selecting a destination node includes using one of a weighted model and a machine learning model.
