# US 2025/0086004 A1 · Resource use methods and apparatuses > Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt - Number: US 2025/0086004 A1 - Document ID: US20250086004A1 - Status: Published application - Kind: A1 - Application number: 18/958,739 - Filed: 2024-11-25 - Published: 2025-03-13 - Earliest claimed: 2022-07-26 - Assignees: Alipay (Hangzhou) Information Technology Co., Ltd. - Applicants: Alipay (Hangzhou) Information Technology Co., Ltd. - Inventors: Denghui Li; Tongkai Yang; Jun Du - Web page: https://patentgrep.com/patent/US20250086004A1 ## CPC - G06F 9/4856: {resumption being on a different machine, e.g. task migration, virtual machine migration (G06F9/5088 takes precedence)} - G06F 9/5088: {involving task migration} - H04L 41/0897: by horizontal or vertical scaling of resources, or by migrating entities, e.g. virtual resources or entities - H04L 41/5019: Ensuring fulfilment of SLA - H04L 47/72: using reservation actions during connection setup - H04L 47/76: using dynamic resource allocation, e.g. in-call renegotiation requested by the user or requested by the network in response to changing network conditions - H04L 67/34: {involving the movement of software or configuration parameters (network booting or remote initial program loading [RIPL] G06F9/4416)} - G06F 9/45558: {Hypervisor-specific management and integration aspects} - G06F 2009/4557: {Distribution of virtual machine instances; Migration and load balancing} - G06F 2209/485: Resource constraint - G06F 2209/5014: Reservation - G06F 2209/5019: Workload prediction - G06F 2209/509: Offload - H04L 67/1008: based on parameters of servers, e.g. available memory or workload (monitoring of computer activity G06F11/30) - Y02D 10/00: Energy efficient computing, e.g. low power processors, power management or thermal management - G06F: ELECTRIC DIGITAL DATA PROCESSING (computer systems based on specific computational models G06N) - H04L: TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION (arrangements common to telegraphic and telephonic communication H04M) - Y02D: CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE ## Abstract A computer-implemented method includes determining a quantity of reserved resources that need to be reserved in one node. Nodes in which quantities of current remaining resources are less than a quantity of reserved resources are determined. For each determined node, calculating a total quantity of resources occupied by allocated service requests in the node and determining whether the node is capable of satisfying the quantity of reserved resources. If yes, marking the node as a migratable node. One migrating node is selected from migratable nodes and corresponding M allocated service requests are migrated to at least one other node. Resources occupied by the M allocated service requests are released, where M satisfies a condition that after the resources occupied by the M allocated service requests are released, a quantity of remaining resources in the migrating node is not less than the quantity of reserved resources. ## Claims ### Claim 1 A computer-implemented method for resource use, comprising: determining a quantity of reserved resources that need to be reserved in one node; determining nodes in which quantities of current remaining resources are less than the quantity of reserved resources; calculating, for each determined node and as a calculated total quantity of resources, a total quantity of resources occupied by allocated service requests in the node; determining, for each determined node based on the calculated total quantity of resources, whether the node is capable of satisfying the quantity of reserved resources, and if yes, marking the node as a migratable node; selecting one migrating node from migratable nodes; migrating, to at least one other node, M allocated service requests corresponding to the migrating node; and releasing resources occupied by the M allocated service requests in the migrating node, wherein M satisfies a condition that after the resources occupied by the M allocated service requests are released, a quantity of remaining resources in the migrating node is not less than the quantity of reserved resources, wherein M is a positive integer not less than 1. ### Claim 2 (depends on 1) The computer-implemented method of claim 1, wherein determining a quantity of reserved resources that need to be reserved in one node, comprises: estimating, as a requirement, large-scale resources required by future service requests; determining, based on the requirement, the quantity of reserved resources that need to be reserved in one node; and correspondingly, after the releasing resources occupied by the M allocated service requests in the migrating node: adding current remaining resources of the migrating node to a resource cache pool; and when a service request is received, allocating remaining resources in one node from the resource cache pool for the service request. ### Claim 3 (depends on 1) The computer-implemented method of claim 1, wherein determining a quantity of reserved resources that need to be reserved in one node, comprises: determining, based on sizes of resources required by a currently received service request, the quantity of reserved resources that need to be reserved in one node. ### Claim 4 (depends on 3) The computer-implemented method of claim 3, comprising: correspondingly, after releasing resources occupied by the M allocated service requests in the migrating node: allocating current remaining resources in the migrating node for the currently received service request. ### Claim 5 (depends on 1) The computer-implemented method of claim 1, wherein each M allocated service request is an allocated service request whose service attribute allows migration. ### Claim 6 (depends on 1) The computer-implemented method of claim 1, wherein: determining, based on the calculated total quantity of resources, whether the node is capable of satisfying the quantity of reserved resources comprises: determining whether a sum of the calculated total quantity of resources and a quantity of current remaining resources in the node is not less than the quantity of reserved resources; and if yes, determining that the quantity of reserved resources is satisfied, wherein correspondingly, M satisfies a condition that a sum of a total quantity of resources occupied by the M allocated service requests and a quantity of current remaining resources in the node is not less than the quantity of reserved resources. ### Claim 7 (depends on 1) The computer-implemented method of claim 1, wherein: determining, based on the calculated total quantity of resources, whether the node is capable of satisfying the quantity of reserved resources comprises: determining whether the calculated total quantity of resources is not less than the quantity of reserved resources; and if yes, determining that the quantity of reserved resources is satisfied, wherein correspondingly, M satisfies a condition that a total quantity of resources occupied by the M allocated service requests is not less than the quantity of reserved resources. ### Claim 8 (depends on 1) The computer-implemented method of claim 1, wherein selecting one migrating node from migratable nodes when determining that there are two or more nodes in which quantities of current remaining resources are less than the quantity of reserved resources, comprises: sorting, for each migratable node based on quantities of occupied resources, allocated service requests corresponding to the migratable node. ### Claim 9 (depends on 8) The computer-implemented method of claim 8, comprising: selecting top Ni allocated service requests for an ith migratable node, wherein Ni is an integer not less than 1, and Ni satisfies a condition that after resources occupied by the top Ni allocated service requests are released, a quantity of remaining resources in the ith migratable node is not less than the quantity of reserved resources. ### Claim 10 (depends on 8) The computer-implemented method of claim 8, comprising selecting one migratable node as the migrating node based on a value of Ni of each migratable node. ### Claim 11 (depends on 10) The computer-implemented method of claim 10, wherein, based on quantities of occupied resources, sorting, for each migratable node based on quantities of occupied resources, allocated service requests corresponding to the migratable node, comprises: sorting the allocated service requests corresponding to the migratable node in ascending order of the quantities of occupied resources. ### Claim 12 (depends on 10) The computer-implemented method of claim 10, wherein selecting one migratable node as the migrating node based on a value of Ni of each migratable node, comprises: sorting the migratable nodes in ascending order of values of Ni. ### Claim 13 (depends on 12) The computer-implemented method of claim 12, comprising: selecting a current top migratable node as the migrating node. ### Claim 14 (depends on 1) The computer-implemented method of claim 1, wherein migrating, to at least one other node, M allocated service requests corresponding to the migrating node, comprises: for each M allocated service request of the M allocated service requests: determining, based on a quantity of resources occupied by each M allocated service request, whether each M allocated service request is migratable to a target node other than the migrating node; and if yes: reserving, in the target node, a quantity of resources required by each M allocated service request; and migrating each M allocated service request to the target node. ### Claim 15 (depends on 4) The computer-implemented method of claim 4, wherein releasing resources occupied by the M allocated service requests in the migrating node, comprises: marking each released resource as a reserved resource for the currently received service request. ### Claim 16 (depends on 1) The computer-implemented method of claim 1, wherein: the computer-implemented method is applied to cluster resource scheduling and each node is a node in a cluster. ### Claim 17 (depends on 1) The computer-implemented method of claim 1, comprising: a resource comprises at least one of a hardware resource or a virtual resource. ### Claim 18 (depends on 1) The computer-implemented method of claim 1, comprising: the node is a physical machine or a virtual machine. ### Claim 19 A non-transitory, computer-readable medium storing one or more instructions executable by a computer system to perform one or more operations for resource use, comprising: determining a quantity of reserved resources that need to be reserved in one node; determining nodes in which quantities of current remaining resources are less than the quantity of reserved resources; calculating, for each determined node and as a calculated total quantity of resources, a total quantity of resources occupied by allocated service requests in the node; determining, for each determined node based on the calculated total quantity of resources, whether the node is capable of satisfying the quantity of reserved resources, and if yes, marking the node as a migratable node; selecting one migrating node from migratable nodes; migrating, to at least one other node, M allocated service requests corresponding to the migrating node; and releasing resources occupied by the M allocated service requests in the migrating node, wherein M satisfies a condition that after the resources occupied by the M allocated service requests are released, a quantity of remaining resources in the migrating node is not less than the quantity of reserved resources, wherein M is a positive integer not less than 1. ### Claim 20 A computer-implemented system for resource use, comprising: one or more computers; and one or more computer memory devices interoperably coupled with the one or more computers and having tangible, non-transitory, machine-readable media storing one or more instructions that, when executed by the one or more computers, perform one or more operations, comprising: determining a quantity of reserved resources that need to be reserved in one node; determining nodes in which quantities of current remaining resources are less than the quantity of reserved resources; calculating, for each determined node and as a calculated total quantity of resources, a total quantity of resources occupied by allocated service requests in the node; determining, for each determined node based on the calculated total quantity of resources, whether the node is capable of satisfying the quantity of reserved resources, and if yes, marking the node as a migratable node; selecting one migrating node from migratable nodes; migrating, to at least one other node, M allocated service requests corresponding to the migrating node; and releasing resources occupied by the M allocated service requests in the migrating node, wherein M satisfies a condition that after the resources occupied by the M allocated service requests are released, a quantity of remaining resources in the migrating node is not less than the quantity of reserved resources, wherein M is a positive integer not less than 1.