# US 2026/0064293 A1 · Resource scheduling method, apparatus, medium, electronic device, and program product > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2026/0064293 A1 - Document ID: US20260064293A1 - Status: Published application - Kind: A1 - Application number: 19/223,885 - Filed: 2025-05-30 - Published: 2026-03-05 - Earliest claimed: 2024-08-29 - Assignees: Beijing Volcano Engine Technology Co., Ltd. - Applicants: Beijing Volcano Engine Technology Co., Ltd. - Inventors: Minghao YANG; Fenghao ZHANG; Haijia SHEN; Haibin SHE; Yilong CHEN; Chungang LI; Kai LI; Xianghui ZHOU; Pengwei ZHAO - Web page: https://patentgrep.com/patent/US20260064293A1 ## CPC - G06F 3/067: {Distributed or networked storage systems, e.g. storage area networks [SAN], network attached storage [NAS]} - G06F 11/2033: {switching over of hardware resources} - G06F 3/0605: {by facilitating the interaction with a user or administrator} - G06F 3/0617: {in relation to availability} - G06F 3/0653: {Monitoring storage devices or systems} - G06F 3/0659: {Command handling arrangements, e.g. command buffers, queues, command scheduling} - G06F 9/5011: {the resources being hardware resources other than CPUs, Servers and Terminals} - G06F 9/5022: {Mechanisms to release resources} - G06F 9/5072: {Grid computing} - G06F 9/5083: {Techniques for rebalancing the load in a distributed system} - G06F 11/0727: {in a storage system, e.g. in a DASD or network based storage system (drivers for digital recording or reproducing units G06F3/06; circuits for error detection or correction within digital recording or reproducing units G11B20/18; for distributed storage of data in networks, e.g. transport arrangements for network file system [NFS], storage area networks [SAN] or network attached storage [NAS], H04L67/1097)} - G06F 2201/85: Active fault masking without idle spares - G06F 2209/5013: Request control - G06F 2209/503: Resource availability - G06F 2209/508: Monitor - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) ## Abstract The present disclosure relates to a resource scheduling method and apparatus based on a distributed storage system, a medium, an electronic device, and a program product. The method includes: acquiring request retry failure information generated by a user side in a distributed storage cluster when a request retry fails, and storing the request retry failure information, wherein the request retry failure information is at least used to indicate a target storage resource on which the request retry fails; and in response to detecting that a target storage node in the distributed storage cluster has a heartbeat disconnection, scheduling, according to request retry failure information related to the target storage node, a target storage resource on which a request retry fails on the target storage node to another storage node in the distributed storage cluster that is in a normal operating state. ## Claims ### Claim 1 A resource scheduling method based on a distributed storage system, comprising: acquiring request retry failure information generated by a user side in a distributed storage cluster when a request retry fails, and storing the request retry failure information, wherein the request retry failure information is at least used to indicate a target storage resource on which the request retry fails; and in response to detecting that a target storage node in the distributed storage cluster has a heartbeat disconnection, scheduling, according to request retry failure information related to the target storage node, a target storage resource on which a request retry fails on the target storage node to another storage node in the distributed storage cluster that is in a normal operating state. ### Claim 2 (depends on 1) The method according to claim 1, wherein the scheduling, the target storage resource on which the request retry fails on the target storage node to another storage node in the distributed storage cluster that is in a normal operating state, according to the request retry failure information related to the target storage node, comprises: selecting at least one storage node in a normal operating state from other storage nodes in the distributed storage cluster except the target storage node; and selecting a first storage node with a schedulable capacity greater than a total number of target storage resources on which the request retry fails from the at least one storage node, and scheduling the target storage resource on which the request retry fails on the target storage node to the first storage node. ### Claim 3 (depends on 1) The method according to claim 1, wherein the scheduling the target storage resource on which the request retry fails on the target storage node to another storage node in the distributed storage cluster that is in a normal operating state, comprises: acquiring a state of the distributed storage cluster; determining, based on the state of the distributed storage cluster, a total number of storage nodes allowed to be scheduled for a scale failure; in response to the total number of storage nodes allowed to be scheduled for the scale failure being greater than or equal to a total number of target storage nodes on which the request retry fails, scheduling the target storage resource on which the request retry fails on the target storage node to another storage node in the distributed storage cluster that is in a normal operating state; and in response to the total number of storage nodes allowed to be scheduled for the scale failure being less than the total number of target storage nodes on which the request retry fails, prohibiting migrating in or out of storage resources for the target storage node. ### Claim 4 (depends on 1) The method according to claim 1, further comprising: in response to a total number of target storage resources on which the request retry fails on the target storage node being greater than or equal to a predetermined threshold, after a scheduling of the target storage resource on which the request retry fails on the target storage node is completed, stopping a service of the target storage node, and scheduling other storage resources on the target storage node to other storage nodes in a normal operating state. ### Claim 5 (depends on 1) The method according to claim 1, further comprising: in response to detecting that the target storage node recovers a heartbeat, scheduling a storage resource with traffic in a probe cloud disk to the target storage node, wherein the probe cloud disk is a cloud disk configured to detect whether the target storage node is capable of recovering a service; in response to detecting that request retry failure information for the storage resource with traffic is not acquired within a period of time, performing a management and control operation for the storage resource with traffic, wherein the management and control operation is configured to manage and control the storage resource with traffic; and in response to the management and control operation being normally executed, recovering the service of the target storage node. ### Claim 6 (depends on 5) The method according to claim 5, further comprising: in response to detecting that the request retry failure information for the storage resource with traffic is acquired within the period of time, rescheduling the storage resource with traffic in the probe cloud disk to the target storage node again after a predetermined time interval, and after a total number of times of rescheduling reaches a predetermined number of times, setting the target storage node to a stop running state, and stopping the rescheduling. ### Claim 7 A computer-readable medium, on which a computer program is stored, wherein the computer program, when executed by a processing apparatus, implements a resource scheduling method based on a distributed storage system, wherein the resource scheduling method comprises: acquiring request retry failure information generated by a user side in a distributed storage cluster when a request retry fails, and storing the request retry failure information, wherein the request retry failure information is at least used to indicate a target storage resource on which the request retry fails; and in response to detecting that a target storage node in the distributed storage cluster has a heartbeat disconnection, scheduling, according to request retry failure information related to the target storage node, a target storage resource on which a request retry fails on the target storage node to another storage node in the distributed storage cluster that is in a normal operating state. ### Claim 8 (depends on 7) The computer-readable medium according to claim 7, wherein the scheduling, the target storage resource on which the request retry fails on the target storage node to another storage node in the distributed storage cluster that is in a normal operating state, according to the request retry failure information related to the target storage node, comprises: selecting at least one storage node in a normal operating state from other storage nodes in the distributed storage cluster except the target storage node; and selecting a first storage node with a schedulable capacity greater than a total number of target storage resources on which the request retry fails from the at least one storage node, and scheduling the target storage resource on which the request retry fails on the target storage node to the first storage node. ### Claim 9 (depends on 7) The computer-readable medium according to claim 7, wherein the scheduling the target storage resource on which the request retry fails on the target storage node to another storage node in the distributed storage cluster that is in a normal operating state, comprises: acquiring a state of the distributed storage cluster; determining, based on the state of the distributed storage cluster, a total number of storage nodes allowed to be scheduled for a scale failure; in response to the total number of storage nodes allowed to be scheduled for the scale failure being greater than or equal to a total number of target storage nodes on which the request retry fails, scheduling the target storage resource on which the request retry fails on the target storage node to another storage node in the distributed storage cluster that is in a normal operating state; and in response to the total number of storage nodes allowed to be scheduled for the scale failure being less than the total number of target storage nodes on which the request retry fails, prohibiting migrating in or out of storage resources for the target storage node. ### Claim 10 (depends on 7) The computer-readable medium according to claim 7, wherein the method further comprises: in response to a total number of target storage resources on which the request retry fails on the target storage node being greater than or equal to a predetermined threshold, after a scheduling of the target storage resource on which the request retry fails on the target storage node is completed, stopping a service of the target storage node, and scheduling other storage resources on the target storage node to other storage nodes in a normal operating state. ### Claim 11 (depends on 7) The computer-readable medium according to claim 7, wherein the method further comprises: in response to detecting that the target storage node recovers a heartbeat, scheduling a storage resource with traffic in a probe cloud disk to the target storage node, wherein the probe cloud disk is a cloud disk configured to detect whether the target storage node is capable of recovering a service; in response to detecting that request retry failure information for the storage resource with traffic is not acquired within a period of time, performing a management and control operation for the storage resource with traffic, wherein the management and control operation is configured to manage and control the storage resource with traffic; and in response to the management and control operation being normally executed, recovering the service of the target storage node. ### Claim 12 (depends on 11) The computer-readable medium according to claim 11, wherein the method further comprises: in response to detecting that the request retry failure information for the storage resource with traffic is acquired within the period of time, rescheduling the storage resource with traffic in the probe cloud disk to the target storage node again after a predetermined time interval, and after a total number of times of rescheduling reaches a predetermined number of times, setting the target storage node to a stop running state, and stopping the rescheduling. ### Claim 13 An electronic device, comprising: a storage apparatus, on which a computer program is stored; and a processing apparatus, configured to execute the computer program in the storage apparatus, to implement a resource scheduling method based on a distributed storage system, wherein the resource scheduling method comprises: acquiring request retry failure information generated by a user side in a distributed storage cluster when a request retry fails, and storing the request retry failure information, wherein the request retry failure information is at least used to indicate a target storage resource on which the request retry fails; and in response to detecting that a target storage node in the distributed storage cluster has a heartbeat disconnection, scheduling, according to request retry failure information related to the target storage node, a target storage resource on which a request retry fails on the target storage node to another storage node in the distributed storage cluster that is in a normal operating state. ### Claim 14 (depends on 13) The electronic device according to claim 13, wherein the scheduling, the target storage resource on which the request retry fails on the target storage node to another storage node in the distributed storage cluster that is in a normal operating state, according to the request retry failure information related to the target storage node, comprises: selecting at least one storage node in a normal operating state from other storage nodes in the distributed storage cluster except the target storage node; and selecting a first storage node with a schedulable capacity greater than a total number of target storage resources on which the request retry fails from the at least one storage node, and scheduling the target storage resource on which the request retry fails on the target storage node to the first storage node. ### Claim 15 (depends on 13) The electronic device according to claim 13, wherein the scheduling the target storage resource on which the request retry fails on the target storage node to another storage node in the distributed storage cluster that is in a normal operating state, comprises: acquiring a state of the distributed storage cluster; determining, based on the state of the distributed storage cluster, a total number of storage nodes allowed to be scheduled for a scale failure; in response to the total number of storage nodes allowed to be scheduled for the scale failure being greater than or equal to a total number of target storage nodes on which the request retry fails, scheduling the target storage resource on which the request retry fails on the target storage node to another storage node in the distributed storage cluster that is in a normal operating state; and in response to the total number of storage nodes allowed to be scheduled for the scale failure being less than the total number of target storage nodes on which the request retry fails, prohibiting migrating in or out of storage resources for the target storage node. ### Claim 16 (depends on 13) The electronic device according to claim 13, wherein the method further comprises: in response to a total number of target storage resources on which the request retry fails on the target storage node being greater than or equal to a predetermined threshold, after a scheduling of the target storage resource on which the request retry fails on the target storage node is completed, stopping a service of the target storage node, and scheduling other storage resources on the target storage node to other storage nodes in a normal operating state. ### Claim 17 (depends on 13) The electronic device according to claim 13, wherein the method further comprises: in response to detecting that the target storage node recovers a heartbeat, scheduling a storage resource with traffic in a probe cloud disk to the target storage node, wherein the probe cloud disk is a cloud disk configured to detect whether the target storage node is capable of recovering a service; in response to detecting that request retry failure information for the storage resource with traffic is not acquired within a period of time, performing a management and control operation for the storage resource with traffic, wherein the management and control operation is configured to manage and control the storage resource with traffic; and in response to the management and control operation being normally executed, recovering the service of the target storage node. ### Claim 18 (depends on 17) The electronic device according to claim 17, wherein the method further comprises: in response to detecting that the request retry failure information for the storage resource with traffic is acquired within the period of time, rescheduling the storage resource with traffic in the probe cloud disk to the target storage node again after a predetermined time interval, and after a total number of times of rescheduling reaches a predetermined number of times, setting the target storage node to a stop running state, and stopping the rescheduling.