CN117349009A - Cluster node determining method and device - Google Patents

Cluster node determining method and device Download PDF

Info

Publication number
CN117349009A
CN117349009A CN202311257318.3A CN202311257318A CN117349009A CN 117349009 A CN117349009 A CN 117349009A CN 202311257318 A CN202311257318 A CN 202311257318A CN 117349009 A CN117349009 A CN 117349009A
Authority
CN
China
Prior art keywords
cluster node
node
candidate cluster
candidate
value
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Pending
Application number
CN202311257318.3A
Other languages
Chinese (zh)
Inventor
王晨
姜晓东
古颜松
薛彭飞
宛明宇
刘玉杰
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China United Network Communications Group Co Ltd
Original Assignee
China United Network Communications Group Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by China United Network Communications Group Co Ltd filed Critical China United Network Communications Group Co Ltd
Priority to CN202311257318.3A priority Critical patent/CN117349009A/en
Publication of CN117349009A publication Critical patent/CN117349009A/en
Pending legal-status Critical Current

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5027—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resource being a machine, e.g. CPUs, Servers, Terminals
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44—Arrangements for executing specific programs
    • G06F9/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
    • G06F9/45533—Hypervisors; Virtual machine monitors
    • G06F9/45558—Hypervisor-specific management and integration aspects
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5005—Allocation of resources, e.g. of the central processing unit [CPU] to service a request
    • G06F9/5011—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals
    • G06F9/5016—Allocation of resources, e.g. of the central processing unit [CPU] to service a request the resources being hardware resources other than CPUs, Servers and Terminals the resource being the memory
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5061—Partitioning or combining of resources
    • G06F9/5066—Algorithms for mapping a plurality of inter-dependent sub-tasks onto a plurality of physical CPUs
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46—Multiprogramming arrangements
    • G06F9/50—Allocation of resources, e.g. of the central processing unit [CPU]
    • G06F9/5061—Partitioning or combining of resources
    • G06F9/5077—Logical partitioning of resources; Management or configuration of virtualized resources
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44—Arrangements for executing specific programs
    • G06F9/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
    • G06F9/45533—Hypervisors; Virtual machine monitors
    • G06F9/45558—Hypervisor-specific management and integration aspects
    • G06F2009/45562—Creating, deleting, cloning virtual machine instances
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44—Arrangements for executing specific programs
    • G06F9/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
    • G06F9/45533—Hypervisors; Virtual machine monitors
    • G06F9/45558—Hypervisor-specific management and integration aspects
    • G06F2009/4557—Distribution of virtual machine instances; Migration and load balancing
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for program control, e.g. control units
    • G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/44—Arrangements for executing specific programs
    • G06F9/455—Emulation; Interpretation; Software simulation, e.g. virtualisation or emulation of application or operating system execution engines
    • G06F9/45533—Hypervisors; Virtual machine monitors
    • G06F9/45558—Hypervisor-specific management and integration aspects
    • G06F2009/45583—Memory management, e.g. access or allocation

Abstract

The application provides a method and a device for determining a cluster node, which relate to the field of computer clusters, can improve the efficiency of determining a target cluster node, and have higher accuracy. The method comprises the following steps: acquiring resource information of each cluster node in a plurality of cluster nodes and the number of containers which are concurrently created by each cluster node at the current moment; receiving a container creation request, wherein the container creation request is used for indicating the creation of a preset number of containers; determining at least one candidate cluster node in the plurality of cluster nodes according to the resource information of the plurality of cluster nodes; and determining a target cluster node in at least one candidate cluster node according to the resource information of the candidate cluster node and the number of containers which are concurrently created by the candidate cluster node at the current moment. The resource information comprises node memory resources and node CPU resources.

Description

Cluster node determining method and device
Technical Field
The present disclosure relates to the field of computer clusters, and in particular, to a method and apparatus for determining a cluster node.
Background
With the development of cloud computing technology, the containerization technology has become a mainstream way of application system deployment and management. The containerization technique may package third party applications and their dependent libraries, configuration files, etc. into a single operating environment for rapid deployment and operation on different computers. The technique of containerization is not separated from container cluster scheduling. The container cluster scheduling may schedule the third party application to the target cluster node to ensure availability and high performance of the third party application.
There are a variety of container cluster scheduling schemes such as implementing container cluster scheduling by cluster management tools. But this way of determining the target cluster node is inefficient and has poor accuracy.
Disclosure of Invention
The method and the device for determining the cluster node can improve the efficiency of determining the target cluster node and are high in accuracy.
In order to achieve the above purpose, the present application adopts the following technical scheme:
in a first aspect, the present application provides a method for determining a cluster node, where the method includes: acquiring resource information of each cluster node in a plurality of cluster nodes and the number of containers which are concurrently created at the current moment by each cluster node, wherein the resource information comprises node memory resources and node Central Processing Unit (CPU) resources; receiving a container creation request, wherein the container creation request is used for indicating the creation of a preset number of containers; determining at least one candidate cluster node in the plurality of cluster nodes according to the resource information of the plurality of cluster nodes; and determining a target cluster node in at least one candidate cluster node according to the resource information of the candidate cluster node and the number of containers which are concurrently created by the candidate cluster node at the current moment.
Based on the technical scheme, the resource information of each cluster node in the plurality of cluster nodes and the number of containers which are concurrently created by each cluster node at the current moment can be obtained, at least one candidate cluster node in the plurality of cluster nodes is determined according to the resource information of the plurality of cluster nodes, a container creation request is received, and the target cluster node in the at least one candidate cluster node is determined according to the resource information of the candidate cluster node, the number of containers which are concurrently created by the candidate cluster node at the current moment and the preset number. Because the resource information of each cluster node and the number of containers which are concurrently created by each cluster node at the current moment are acquired based on a heartbeat mechanism, the resource information of each cluster node in a plurality of cluster nodes, the number of containers which are concurrently created at the current moment and the running state of the cluster nodes can be acquired in real time, and the fault of the cluster nodes can be detected and processed through the running state of the cluster nodes in time, so that the accuracy of determining the target cluster nodes is improved. In addition, the algorithm for determining the target cluster node in at least one candidate cluster node is simple according to the resource information of the candidate cluster nodes, the number of containers which are concurrently created by the candidate cluster nodes at the current moment and the preset number, and the candidate cluster nodes are determined after being screened from a plurality of cluster nodes, so that the efficiency for determining the target cluster nodes can be improved, the rate for creating the containers is further improved, and the service response efficiency is further improved.
In one possible implementation, the creating a container request includes creating memory resources and CPU resources required for a preset number of containers, determining at least one candidate cluster node of the plurality of nodes according to resource information of the nodes, including: determining at least one preparation cluster node in the plurality of cluster nodes according to the resource information of the plurality of cluster nodes, wherein the memory resource of each preparation cluster node is larger than a first threshold value, and the CPU resource of each preparation cluster node is larger than a second threshold value; and determining at least one candidate cluster node in the at least one preparation cluster node according to the number of containers which are concurrently created by the preparation cluster node at the current moment, wherein the number of containers which are concurrently created by each candidate cluster node at the current moment is smaller than or equal to the maximum value of the number of containers which are concurrently created by each cluster node.
In one possible implementation manner, the at least one candidate cluster node includes a first candidate cluster node and a second candidate cluster node, and determining a target cluster node in the at least one candidate cluster node according to resource information of the candidate cluster node and the number of containers concurrently created by the candidate cluster node at the current moment, including: if the number of containers concurrently created by the first candidate cluster node at the current moment is smaller than or equal to a third threshold value and the number of containers concurrently created by the second candidate cluster node at the current moment is larger than a fourth threshold value, determining the first candidate cluster node as a target cluster node; if the number of containers concurrently created by the first candidate cluster node at the current moment is greater than a third threshold value and the number of containers concurrently created by the second candidate cluster node at the current moment is greater than a fourth threshold value, determining a target cluster node in at least one candidate cluster node according to the maximum value of the number of containers concurrently created by the first candidate cluster node and the maximum value of the number of containers concurrently created by the second candidate cluster node; if the number of containers concurrently created by the first candidate cluster node at the current moment is smaller than or equal to a third threshold value and the number of containers concurrently created by the second candidate cluster node at the current moment is smaller than or equal to a fourth threshold value, determining a target cluster node in at least one candidate cluster node according to the resource information of the first candidate cluster node and the second candidate cluster node.
A possible implementation manner, determining a target cluster node in at least one candidate cluster node according to a maximum value of a number of containers concurrently created by the first candidate cluster node and a maximum value of a number of containers concurrently created by the second candidate cluster node, including: determining a first difference value between the maximum value of the number of containers concurrently created by the first candidate cluster node and a third threshold value; determining a second difference value between the maximum value of the number of containers concurrently created by the second candidate cluster node and a fourth threshold value; and determining the candidate cluster node with the large difference value in the first difference value and the second difference value as a target cluster node.
A possible implementation manner, determining a target cluster node in at least one candidate cluster node according to resource information of the first candidate cluster node and the second candidate cluster node, includes: determining a first basic value of the first candidate cluster node and a second basic value of the second candidate cluster node according to the resource information of the first candidate cluster node and the resource information of the second candidate cluster node and a preset rule, wherein the first basic value comprises a value corresponding to the node memory resource of the first candidate cluster node and a value corresponding to the node CPU resource, and the second basic value comprises a value corresponding to the node memory resource of the second candidate cluster node and a value corresponding to the node CPU resource; and determining the candidate cluster node with the large value in the first basic value and the second basic value as a target cluster node.
A possible implementation manner, the method further includes: determining a first numerical value of the first candidate cluster node and a second numerical value of the second candidate cluster node according to the resource information of the first candidate cluster node and the resource information of the second candidate cluster node based on a variance algorithm; and determining the candidate cluster node with the large value in the first value and the second value as a target cluster node.
In a second aspect, the present application provides a determining apparatus for a cluster node, where the apparatus includes an obtaining module, a transceiver module, and a processing module; the acquisition module is used for acquiring the resource information of each cluster node in the plurality of cluster nodes and the number of containers which are concurrently created at the current moment by each cluster node, wherein the resource information comprises node memory resources and node Central Processing Unit (CPU) resources. And the receiving and transmitting module is used for receiving a container creating request, wherein the container creating request is used for indicating to create a preset number of containers. And the processing module is used for determining at least one candidate cluster node in the plurality of cluster nodes according to the resource information of the plurality of cluster nodes. The processing module is further used for determining a target cluster node in at least one candidate cluster node according to the resource information of the candidate cluster node and the number of containers which are concurrently created by the candidate cluster node at the current moment.
In a third aspect, the present application provides an apparatus for determining a cluster node, the apparatus comprising a processor coupled to a memory, the processor being for executing a computer program or instructions to implement a method as described in any one of the possible implementations of the first aspect and the first aspect.
In a fourth aspect, the present application provides a computer-readable storage medium having instructions stored therein which, when run on a terminal, cause the computer to perform the method as described in any one of the possible implementations of the first aspect and the first aspect.
In a fifth aspect, embodiments of the present application provide a computer program product comprising instructions which, when run on a computer, cause the computer to perform the method as described in any one of the possible implementations of the first aspect and the first aspect.
In a sixth aspect, embodiments of the present application provide a chip comprising a processor coupled with a memory, the processor for running a computer program or instructions to implement a method as described in any one of the possible implementations of the first aspect and the first aspect.
The technical effects of any one of the possible implementation manners of the second aspect to the sixth aspect may be referred to the technical effects of the first aspect or the different possible implementation manners of the first aspect, which are not described herein.
Drawings
Fig. 1 is a schematic diagram of a determining system of a cluster node according to an embodiment of the present application;
fig. 2 is a flowchart of a method for determining a cluster node according to an embodiment of the present application;
fig. 3 is a schematic structural diagram of a determining device for a cluster node according to an embodiment of the present application;
fig. 4 is a schematic structural diagram of another determination of cluster nodes according to an embodiment of the present application;
fig. 5 is a schematic structural diagram of a chip according to an embodiment of the present application.
Detailed Description
The method and the device for determining the cluster node provided by the embodiment of the application are described in detail below with reference to the accompanying drawings.
The term "and/or" is herein merely an association relationship describing an associated object, meaning that there may be three relationships, e.g., a and/or B, may represent: a exists alone, A and B exist together, and B exists alone.
The terms "first" and "second" and the like in the description and in the drawings are used for distinguishing between different objects or for distinguishing between different processes of the same object and not for describing a particular sequential order of objects.
Furthermore, references to the terms "comprising" and "having" and any variations thereof in the description of the present application are intended to cover a non-exclusive inclusion. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those listed but may optionally include other steps or elements not listed or inherent to such process, method, article, or apparatus.
It should be noted that, in the embodiments of the present application, words such as "exemplary" or "such as" are used to mean serving as an example, instance, or illustration. Any embodiment or design described herein as "exemplary" or "for example" should not be construed as preferred or advantageous over other embodiments or designs. Rather, the use of words such as "exemplary" or "such as" is intended to present related concepts in a concrete fashion.
The method provided in the embodiment of the present application is described below by taking the determining system 10 of the cluster node shown in fig. 1 as an example.
As shown in fig. 1, an architecture diagram of a cluster node determining system 10 according to an embodiment of the present application is provided. In fig. 1, the cluster node determining system 10 may include a service end 101, a cluster node determining device 102, a node 103, a node 104, and a storage device 105.
The service end in the embodiment of the present application, for example, the service end 101, may be any kind of third party application platform. The service end needs to request to create a container to run the service of the service end, and sends the request to create the container to the determining device of the cluster node. The interface (Application Programming Interface, API) between the programs is provided with a high degree of scalability.
The determining device of the cluster node in the embodiment of the present application, for example, the determining device 102 of the cluster node may be any device having a computing function. For example, the cluster node determining means is a Server (Server) node. Wherein, a scheduler is deployed in the Server node. The Server node is used for dispatching, managing and monitoring a plurality of cluster nodes. The determining device of the cluster node is provided with a visual webpage for a user to operate.
In one possible implementation manner, the determining device of the cluster node includes an access module, a configuration module, an Agent module (Agent module) and a scheduling module. The access module provides a visual page for a user to directly use and an interface (Application Programming Interface, API) between the open program for a third party application to access. And a configuration module for a user to configure optional parameters (such as maximum value of the number of concurrent created containers). And the Agent module monitors the state of each cluster node. And the scheduling module is used for realizing the method for determining the cluster nodes in the first aspect.
The nodes in the embodiments of the present application, for example, the node 103 and the node 104, may be any cluster node. Wherein multiple containers may be deployed on a node. Each node of the container cluster is deployed with an Agent program. The Agent program deployed by the node is used for communicating with the determining device of the cluster node (for example, receiving a command of the determining device of the cluster node), acquiring the health condition of the node, and interacting with the container runtime deployed by the node (for example, acquiring the node memory resource, the node CPU resource, the disk, the port and the like of the node). It will be appreciated that a node may also be referred to as a host.
The storage device in the embodiment of the present application, for example, the storage device 105, may be any device having a storage function. For example, the storage device is a centralized storage system. Wherein the centralized storage system may be a zookeeper component.
It can be understood that the determining device of the cluster node in the embodiment of the present application may be integrated into a service end, where the service end provides a pair of external disclosure interface creation containers. For example: when a user enters a third party application platform page, the third party application calls an external public interface to initiate a request for creating a container, the determining device of the cluster node determines a target cluster node to create the container according to the determining method of the cluster node provided by the application, and the created container information is returned to the third party application platform. The third party application platform can be efficiently and stably provided for the container applied by the user, and the risk of service damage is reduced.
The cluster node determination system 10 shown in fig. 1 is only used for example and is not used to limit the technical solution of the present application. It should be understood by those skilled in the art that the system 10 for determining cluster nodes in the implementation process may further include other devices, and the number of the service end 101, the node 103 and the node 104 may also be determined according to specific needs, which is not limited.
The method provided in the embodiments of the present application is specifically described below.
As shown in fig. 2, a method for determining a cluster node according to an embodiment of the present application includes the following steps:
s201, a determining device of the cluster nodes obtains resource information of each cluster node in the plurality of cluster nodes and the number of containers which are created by each cluster node at the current moment.
In this embodiment of the present application, the determining device of the cluster node may be a determining device of the cluster node in the determining system 10 of the cluster node shown in fig. 1, for example, the determining device of the cluster node is the determining device 102 of the cluster node in fig. 1. Any one of the plurality of cluster nodes may be a node in the cluster node determination system 10 shown in fig. 1, for example, the node is the node 103 or the node 104 in fig. 1.
The resource information comprises node memory resources and node CPU resources.
In one possible implementation manner, the determining device of the cluster node obtains the number of containers concurrently created at the current moment by each cluster node by querying a storage device (for example, a centralized storage system or a Zookeeper module). It will be appreciated that the storage means may record the number of containers each cluster node concurrently creates at the current time.
One possible implementation manner is based on a heartbeat mechanism, and the determining device of the cluster node obtains resource information of each cluster node in the plurality of cluster nodes through an Agent program deployed by each cluster node. Optionally, the determining device of the cluster node may further obtain a health condition of each cluster node through an Agent program deployed by each cluster node. Wherein the health condition is used to characterize the fault condition of the cluster node.
Specifically, the cluster node determining device responds to a user input operation (for example, the operation is that a user clicks an add host button on a visual webpage of the cluster node determining device and inputs host information), is connected to a designated host, starts a deployed Agent program (the Agent program is used for monitoring and managing a Docker environment of the designated host) in the designated host, establishes a heartbeat connection, acquires resource information of each cluster node in a plurality of cluster nodes and acquires health status of each cluster node. If a certain cluster node loses heartbeat connection within a period of time, the cluster node determining device determines that the cluster node is unavailable (for example, the cluster node fails), and excludes the cluster node when a target cluster node is determined later. It will be appreciated that the host is a cluster node, and the host information may include an address or an identifier of the host.
Optionally, the determining means of the cluster node responds to a user deletion operation (for example, the operation is that the user clicks a delete host button on a visual web page of the determining means of the cluster node), all containers on the host are stopped by the Agent program, finally the Agent program is stopped, and the information stored in the storage means of the host is deleted. It can be understood that, the determining device of the cluster node responds to the user clicking other buttons related to the container on the visual webpage of the determining device of the cluster node, the operation performed on the container is forwarded to the Agent program of the host where the container is located, and the Agent program interacts with the Docker environment runtime of the host to complete the operation performed on the container.
S202, a determining device of the cluster node receives a container creation request.
Wherein the create container request is used to indicate that a preset number of containers are created. The create container request includes memory resources and CPU resources required to create a preset number of containers. The create container request comes from the business side.
Illustratively, the determining means of the cluster node is responsive to a user input operation (e.g., the operation being a user clicking an add container button on a visual web page of the determining means of the cluster node and entering the memory resources and CPU resources required to create a preset number of containers).
S203, determining at least one candidate cluster node in the plurality of cluster nodes according to the resource information of the plurality of cluster nodes by the cluster node determining device.
In one possible implementation manner, the determining device of the cluster node determines at least one preparation cluster node in the plurality of cluster nodes according to resource information of the plurality of cluster nodes; and determining at least one candidate cluster node in the at least one preparation cluster node according to the number of containers which are concurrently created by the preparation cluster node at the current moment.
The memory resource of each preparation cluster node is larger than a first threshold value, and the CPU resource of each preparation cluster node is larger than a second threshold value. And the number of containers which are concurrently created by each candidate cluster node at the current moment is smaller than or equal to the maximum value of the number of containers which are concurrently created by each cluster node.
The first threshold value is a value corresponding to memory resources required for creating a preset number of containers. The second threshold is a value corresponding to CPU resources required to create a preset number of containers included in the create container request. The maximum value of the number of the containers which are created concurrently by each cluster node is preset by a user on a visual webpage of a determining device of the cluster node, and the maximum values of the number of the containers which are created concurrently by the different types of nodes are different.
S204, determining the target cluster node in at least one candidate cluster node by the cluster node determining device according to the resource information of the candidate cluster node and the number of containers which are concurrently created by the candidate cluster node at the current moment.
In the embodiment of the application, the at least one candidate cluster node includes a first candidate cluster node and a second candidate cluster node.
In one possible implementation manner, if the number of containers concurrently created by the first candidate cluster node at the current time is smaller than or equal to a third threshold value, and the number of containers concurrently created by the second candidate cluster node at the current time is larger than a fourth threshold value, the determining device of the cluster node determines that the first candidate cluster node is the target cluster node.
One possible design, the third threshold or the fourth threshold may be preset by the user on the visualized web page of the determining means of the cluster node. The third threshold is the number of containers waiting to be created at the current moment by the first candidate cluster node. The fourth threshold is the number of containers that the second candidate cluster node waits to create at the current time. It can be appreciated that the number of containers concurrently created by the first candidate cluster node is smaller than that of the second candidate cluster node at the current time, that is, the response time of the first candidate cluster node waiting for creating containers at the current time is shorter than that of the second candidate cluster node, that is, the response time of the first candidate cluster node serving as a target cluster node for creating the containers with the preset number is faster, and the efficiency of creating the containers with the preset number is higher.
In one possible implementation manner, if the number of containers concurrently created by the first candidate cluster node at the current time is greater than the third threshold and the number of containers concurrently created by the second candidate cluster node at the current time is greater than the fourth threshold, the determining device of the cluster node determines, according to the maximum value of the number of containers concurrently created by the first candidate cluster node and the maximum value of the number of containers concurrently created by the second candidate cluster node, a target cluster node in at least one candidate cluster node.
In one example, the determining means of the cluster node determines a first difference between a maximum value of the number of containers concurrently created by the first candidate cluster node and a third threshold; determining a second difference value between the maximum value of the number of containers concurrently created by the second candidate cluster node and a fourth threshold value; and determining the candidate cluster node with the large difference value in the first difference value and the second difference value as a target cluster node.
It can be appreciated that the greater the difference between the maximum value of the number of containers concurrently created by the candidate cluster node and the number of containers waiting to be created by the candidate cluster node at the current moment, the higher the efficiency of creating containers by the candidate cluster node is, and the more suitable for determining as the target cluster node.
In one possible implementation manner, if the number of containers concurrently created by the first candidate cluster node at the current time is less than or equal to a third threshold and the number of containers concurrently created by the second candidate cluster node at the current time is less than or equal to a fourth threshold, the determining device of the cluster node determines, according to the resource information of the first candidate cluster node and the second candidate cluster node, a target cluster node in at least one candidate cluster node.
In one example, the determining device of the cluster node determines a first basic value of the first candidate cluster node and a second basic value of the second candidate cluster node according to the resource information of the first candidate cluster node and the second candidate cluster node and a preset rule; and determining the candidate cluster node with the large value in the first basic value and the second basic value as a target cluster node.
The first basic value comprises a value corresponding to the node memory resource of the first candidate cluster node and a value corresponding to the node CPU resource, and the second basic value comprises a value corresponding to the node memory resource of the second candidate cluster node and a value corresponding to the node CPU resource.
The determining device of the cluster node is used for determining the node CPU resource and the memory resource of the first candidate cluster node according to the preset rule:
score=cpu ((capability-sum (requested)) 10/capability) +memory ((capability-sum (req uested)) 10/capability), determining a first base value for the first candidate cluster node. Wherein, the capability in CPU (capability-sum (requested)) 10/capability) is the node CPU resource of the first candidate node, and requested is the node CPU resource required by the creation container request already scheduled to run on the first candidate cluster node. memory (capability-sum (requested)) 10/capability) is a node memory resource of the first candidate node, and requested is a node memory resource required by a creation container already scheduled to run on the first candidate cluster node. It will be appreciated that based on the above method, a second base value for a second candidate cluster node may be determined.
It will be appreciated that the first base value is used to characterize the free CPU resources and memory resources of the first candidate cluster node. The second base value is used to characterize free CPU resources and memory resources of the second candidate cluster node. The larger the value of the base value, the more idle CPU resources and memory resources of the candidate cluster node are indicated, namely, the shorter the response time of the candidate cluster node for creating containers is indicated, and the higher the efficiency of creating containers with preset quantity is.
Further, in order to avoid a situation that a large amount of node CPU resources are allocated on one cluster node and a large amount of node memory resources remain, or a situation that a large amount of node memory resources are allocated and a large amount of node CPU resources remain, the determining device of the cluster node may further:
determining a first numerical value of the first candidate cluster node and a second numerical value of the second candidate cluster node according to the resource information of the first candidate cluster node and the second candidate cluster node based on a variance algorithm; and determining the candidate cluster node with the large value in the first value and the second value as a target cluster node.
The determining means of the cluster node is based on a variance algorithm, according to the formula: score=10-variance (cpu fraction, memory fraction) 10, and determining a first value of the first candidate cluster node according to the first base value. The CPU fraction is an available node CPU resource of the first candidate cluster node. The memeryfraction is an available node memory resource of the first candidate cluster node. The volumeFraction is the "distance" between two resources, cpu Fraction and memryFraction. The smaller the "distance" between two resources, cpu fraction and memryfraction, the larger the number of candidate cluster nodes determined. Similarly, a second value for a second candidate cluster node may be determined based on the method described above.
It can be appreciated that, based on the variance algorithm, the determining device of the cluster node may determine, as the target cluster node, a cluster node with a relatively balanced available node CPU resource and available node memory resource in the first candidate cluster node and the second candidate cluster node.
Optionally, after the determining device of the cluster node determines the target cluster node, the concurrency limit is performed by using the semaphore, and the create container request is forwarded to an Agent program deployed on the target cluster node for processing. After receiving the container creating request, the Agent program creates a preset number of containers in the target cluster node, and returns the creating result to the determining device of the cluster node after the creation is completed.
It will be appreciated that the storage device records the scheduling information of the create container request. The scheduling information comprises identification of the target cluster node, real-time state of a container deployed on the target cluster node, start-stop time of container creation and creation result. The scheduling information facilitates the user to query in time when the node fails or is needed.
Based on the method shown in fig. 2, the determining device of the cluster node may obtain the resource information of each cluster node in the plurality of cluster nodes and the number of containers concurrently created by each cluster node at the current moment, determine at least one candidate cluster node in the plurality of cluster nodes according to the resource information of the plurality of cluster nodes, receive the request for creating the containers, and determine the target cluster node in the at least one candidate cluster node according to the resource information of the candidate cluster node, the number of containers concurrently created by the candidate cluster node at the current moment, and the preset number. Because the resource information of each cluster node and the number of containers which are concurrently created by each cluster node at the current moment are acquired based on a heartbeat mechanism, the resource information of each cluster node in a plurality of cluster nodes, the number of containers which are concurrently created at the current moment and the running state of the cluster nodes can be acquired in real time, and the fault of the cluster nodes can be detected and processed through the running state of the cluster nodes in time, so that the accuracy of determining the target cluster nodes is improved. In addition, the algorithm for determining the target cluster node in at least one candidate cluster node is simple according to the resource information of the candidate cluster nodes, the number of containers which are concurrently created by the candidate cluster nodes at the current moment and the preset number, and the candidate cluster nodes are determined after being screened from a plurality of cluster nodes, so that the efficiency for determining the target cluster nodes can be improved, the rate for creating the containers is further improved, and the service response efficiency is further improved.
As shown in fig. 3, a schematic structural diagram of a determining device 30 for a cluster node according to an embodiment of the present application is provided, where the determining device 30 for a cluster node includes an obtaining module 301, a transceiver module 302, and a processing module 303.
The obtaining module 301 is configured to obtain resource information of each cluster node in the plurality of cluster nodes and a number of containers concurrently created by each cluster node at a current moment, where the resource information includes a node memory resource and a node central processing unit CPU resource. For example: the acquisition module 301 is configured to perform S201 described above.
The transceiver module 302 is configured to receive a container creation request, where the container creation request is used to indicate that a preset number of containers are created. For example: the transceiver module 302 is configured to perform S202 described above.
The processing module 303 is configured to determine at least one candidate cluster node in the plurality of cluster nodes according to the resource information of the plurality of cluster nodes. For example: the processing module 303 is configured to execute S203 described above.
The processing module 303 is further configured to determine a target cluster node in at least one candidate cluster node according to the resource information of the candidate cluster nodes and the number of containers that the candidate cluster nodes concurrently create at the current moment. For example: the processing module 303 is configured to execute S204 described above.
A possible design, the processing module 303 is specifically configured to determine, according to resource information of the plurality of cluster nodes, at least one spare cluster node in the plurality of cluster nodes, where a memory resource of each spare cluster node is greater than a first threshold and a CPU resource of each spare cluster node is greater than a second threshold; the processing module 303 is further specifically configured to determine, according to the number of containers concurrently created by the preparation cluster node at the current time, at least one candidate cluster node in the at least one preparation cluster node, where the number of containers concurrently created by each candidate cluster node at the current time is less than or equal to a maximum value of the number of containers concurrently created by each cluster node.
The processing module 303 is further specifically configured to determine that the first candidate cluster node is the target cluster node if the number of containers concurrently created by the first candidate cluster node at the current time is less than or equal to a third threshold and the number of containers concurrently created by the second candidate cluster node at the current time is greater than a fourth threshold; the processing module 303 is further specifically configured to determine, if the number of containers concurrently created by the first candidate cluster node at the current time is greater than a third threshold and the number of containers concurrently created by the second candidate cluster node at the current time is greater than a fourth threshold, a target cluster node in at least one candidate cluster node according to a maximum value of the number of containers concurrently created by the first candidate cluster node and a maximum value of the number of containers concurrently created by the second candidate cluster node; the processing module 303 is further specifically configured to determine, if the number of containers concurrently created by the first candidate cluster node at the current time is less than or equal to a third threshold and the number of containers concurrently created by the second candidate cluster node at the current time is less than or equal to a fourth threshold, a target cluster node in the at least one candidate cluster node according to the resource information of the first candidate cluster node and the second candidate cluster node.
A possible design, the processing module 303 is further specifically configured to determine a first difference between a maximum value of the number of containers concurrently created by the first candidate cluster node and the third threshold; the processing module 303 is further specifically configured to determine a second difference between a maximum value of the number of containers concurrently created by the second candidate cluster node and a fourth threshold; the processing module 303 is further specifically configured to determine, as the target cluster node, a candidate cluster node with a large difference value of the first difference value and the second difference value.
The processing module 303 is further specifically configured to determine, according to the resource information of the first candidate cluster node and the resource information of the second candidate cluster node and according to a preset rule, a first basic value of the first candidate cluster node and a second basic value of the second candidate cluster node, where the first basic value includes a value corresponding to a node memory resource of the first candidate cluster node and a value corresponding to a node CPU resource, and the second basic value includes a value corresponding to a node memory resource of the second candidate cluster node and a value corresponding to a node CPU resource; the processing module 303 is further specifically configured to determine a candidate cluster node with a large value of the first base value and the second base value as the target cluster node.
A possible design, the processing module 303 is further specifically configured to determine, based on a variance algorithm, a first value of the first candidate cluster node and a second value of the second candidate cluster node according to the resource information of the first candidate cluster node and the resource information of the second candidate cluster node; the processing module 303 is further specifically configured to determine a candidate cluster node with a large value of the first value and the second value as the target cluster node.
When implemented in hardware, the acquisition module 301, the transceiver module 302, and the processing module 303 in the embodiments of the present application may be integrated on a communication interface or may be integrated on a processor. A specific implementation is shown in fig. 4.
Fig. 4 shows a schematic diagram of a possible hardware configuration of the determining apparatus of the cluster node involved in the above embodiment. The test device comprises: a processor 402. Optionally, the determining device of the cluster node further includes: a communication interface 403, a memory 401 and a bus 404.
The processor 402 is configured to control and manage actions of the determining device of the cluster node, for example, performing the steps performed by the acquiring module 301, the transceiver module 302, and the processing module 303, and/or performing other processes of the techniques described herein. The processor 402 described above may be implemented or executed with various exemplary logic blocks, modules, and circuits described in connection with this disclosure. The processor may be a central processing unit, a general purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof. Which may implement or perform the various exemplary logic blocks, modules, and circuits described in connection with this disclosure. The processor may also be a combination that performs the function of a computation, e.g., a combination comprising one or more microprocessors, a combination of a DSP and a microprocessor, etc.
The communication interface 403 is configured to support communication between the determining device of the cluster node and other network entities, for example, to perform the steps performed by the acquiring module 301 or the transceiver module 302.
The memory 401 is used for storing program codes and data of the determining means of the cluster node. For example, the memory 401 may be a memory or the like in the determining means of the cluster node, which may comprise a volatile memory, such as a random access memory; the memory may also include non-volatile memory, such as read-only memory, flash memory, hard disk or solid state disk; the memory may also comprise a combination of the above types of memories.
Bus 404 may be an extended industry standard architecture (Extended Industry Standard Architecture, EISA) bus, or the like. The bus 404 may be classified as an address bus, a data bus, a control bus, etc. For ease of illustration, only one thick line is shown in fig. 4, but not only one bus or one type of bus.
Fig. 5 is a schematic structural diagram of a chip 50 according to an embodiment of the present application. The chip 50 includes one or more (including two) processors 501. Optionally, the chip 50 further comprises a communication interface 503, a bus 502 and a memory 504.
Wherein the processor 501 may implement or execute the various exemplary logic blocks, units and circuits described in connection with the present disclosure. The processor may be a central processing unit, a general purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, a transistor logic device, a hardware component, or any combination thereof. Which may implement or perform the various exemplary logic blocks, units and circuits described in connection with this disclosure. The processor may also be a combination that performs the function of a computation, e.g., a combination comprising one or more microprocessors, a combination of a DSP and a microprocessor, etc.
Memory 504 may include read-only memory and random access memory and provides operating instructions and data to processor 501. A portion of the memory 504 may also include non-volatile random access memory (NVRAM).
In some implementations, the memory 504 stores elements, execution modules or data structures, or a subset thereof, or an extended set thereof.
In the present embodiment, the corresponding operation is performed by calling an operation instruction stored in the memory 504 (the operation instruction may be stored in the operating system).
Memory 504 may include volatile memory, such as random access memory; the memory may also include non-volatile memory, such as read-only memory, flash memory, hard disk or solid state disk; the memory may also comprise a combination of the above types of memories.
Bus 502 may be an extended industry standard architecture (Extended Industry Standard Architecture, EISA) bus or the like. The bus 502 may be divided into an address bus, a data bus, a control bus, and the like. For ease of illustration, only one line is shown in fig. 5, but not only one bus or one type of bus.
From the foregoing description of the embodiments, it will be apparent to those skilled in the art that, for convenience and brevity of description, only the above-described division of functional modules is illustrated, and in practical application, the above-described functional allocation may be implemented by different functional modules according to needs, i.e. the internal structure of the apparatus is divided into different functional modules to implement all or part of the functions described above. The specific working processes of the above-described systems, devices and units may refer to the corresponding processes in the foregoing method embodiments, which are not described herein.
The present application provides a computer program product comprising instructions which, when run on a computer, cause the computer to perform the method of the method embodiments described above.
The embodiment of the application also provides a computer readable storage medium, in which instructions are stored, which when executed on a computer, cause the computer to perform the method in the method flow shown in the method embodiment.
The computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples (a non-exhaustive list) of the computer-readable storage medium would include the following: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a random access Memory (Random Access Memory, RAM), a Read-Only Memory (ROM), an erasable programmable Read-Only Memory (Erasable Programmable Read Only Memory, EPROM), a register, a hard disk, an optical fiber, a portable compact disc Read-Only Memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing, or any other form of computer readable storage medium known in the art. An exemplary storage medium is coupled to the processor such the processor can read information from, and write information to, the storage medium. In the alternative, the storage medium may be integral to the processor. The processor and the storage medium may reside in an application specific integrated circuit (Application Specific Integrated Circuit, ASIC). In the context of the present application, a computer-readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device.
Since the determining apparatus, the computer readable storage medium, and the computer program product of the cluster node in the embodiments of the present application may be applied to the above-mentioned method, the technical effects that can be obtained by the determining apparatus, the computer readable storage medium, and the computer program product may also refer to the above-mentioned method embodiments, and the embodiments of the present application are not repeated herein.
In the several embodiments provided in this application, it should be understood that the disclosed systems, devices, and methods may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is merely a logical function division, and there may be additional divisions when actually implemented, for example, multiple units or components may be combined or integrated into another system, or some features may be omitted or not performed. Alternatively, the coupling or direct coupling or communication connection shown or discussed with each other may be through some interface, indirect coupling or communication connection of devices or units, electrical, mechanical, or other form.
The units described as separate units may or may not be physically separate, and units shown as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units may be selected according to actual needs to achieve the purpose of the solution of this embodiment.
In addition, each functional unit in each embodiment of the present application may be integrated in one processing unit, or each unit may exist alone physically, or two or more units may be integrated in one unit.
The foregoing is merely a specific embodiment of the present application, but the protection scope of the present application is not limited thereto, and any changes or substitutions within the technical scope of the present disclosure should be covered in the protection scope of the present application. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

Claims (14)

1. A method for determining a cluster node, the method comprising:
acquiring resource information of each cluster node in a plurality of cluster nodes and the number of containers which are concurrently created by each cluster node at the current moment, wherein the resource information comprises node memory resources and node Central Processing Unit (CPU) resources;
receiving a container creation request, wherein the container creation request is used for indicating the creation of a preset number of containers;
determining at least one candidate cluster node in the plurality of cluster nodes according to the resource information of the plurality of cluster nodes;
and determining a target cluster node in the at least one candidate cluster node according to the resource information of the candidate cluster node and the number of containers which are concurrently created by the candidate cluster node at the current moment.
2. The method of claim 1, wherein the create container request includes memory resources and CPU resources required to create the predetermined number of containers, wherein the determining at least one candidate cluster node of the plurality of nodes based on the node's resource information comprises:
determining at least one preparation cluster node in the plurality of cluster nodes according to the resource information of the plurality of cluster nodes, wherein the memory resource of each preparation cluster node is larger than a first threshold value, and the CPU resource of each preparation cluster node is larger than a second threshold value;
and determining at least one candidate cluster node in the at least one preparation cluster node according to the number of containers concurrently created by the preparation cluster node at the current moment, wherein the number of containers concurrently created by each candidate cluster node at the current moment is smaller than or equal to the maximum value of the number of containers concurrently created by each cluster node.
3. The method of claim 1, wherein the at least one candidate cluster node comprises a first candidate cluster node and a second candidate cluster node, wherein the determining a target cluster node of the at least one candidate cluster node according to the resource information of the candidate cluster node and the number of containers concurrently created by the candidate cluster node at the current time comprises:
If the number of containers concurrently created by the first candidate cluster node at the current moment is smaller than or equal to a third threshold value, and the number of containers concurrently created by the second candidate cluster node at the current moment is larger than a fourth threshold value, determining that the first candidate cluster node is the target cluster node;
if the number of containers concurrently created by the first candidate cluster node at the current time is greater than the third threshold and the number of containers concurrently created by the second candidate cluster node at the current time is greater than the fourth threshold, determining a target cluster node in the at least one candidate cluster node according to the maximum value of the number of containers concurrently created by the first candidate cluster node and the maximum value of the number of containers concurrently created by the second candidate cluster node;
and if the number of containers concurrently created by the first candidate cluster node at the current moment is smaller than or equal to the third threshold value and the number of containers concurrently created by the second candidate cluster node at the current moment is smaller than or equal to the fourth threshold value, determining a target cluster node in the at least one candidate cluster node according to the resource information of the first candidate cluster node and the second candidate cluster node.
4. The method of claim 3, wherein the determining a target cluster node of the at least one candidate cluster node from the maximum value of the number of containers concurrently created by the first candidate cluster node and the maximum value of the number of containers concurrently created by the second candidate cluster node comprises:
determining a first difference value between a maximum value of the number of containers concurrently created by the first candidate cluster node and the third threshold;
determining a second difference value between the maximum value of the number of containers concurrently created by the second candidate cluster node and the fourth threshold value;
and determining the candidate cluster node with the large difference value in the first difference value and the second difference value as the target cluster node.
5. The method of claim 3, wherein the determining a target cluster node of the at least one candidate cluster node based on the resource information of the first candidate cluster node and the second candidate cluster node comprises:
determining a first basic value of the first candidate cluster node and a second basic value of the second candidate cluster node according to the resource information of the first candidate cluster node and the resource information of the second candidate cluster node and a preset rule, wherein the first basic value comprises a value corresponding to a node memory resource of the first candidate cluster node and a value corresponding to a node CPU resource, and the second basic value comprises a value corresponding to a node memory resource of the second candidate cluster node and a value corresponding to a node CPU resource;
And determining the candidate cluster node with the large value in the first basic value and the second basic value as the target cluster node.
6. The method of claim 5, wherein the method further comprises:
determining a first numerical value of the first candidate cluster node and a second numerical value of the second candidate cluster node according to the resource information of the first candidate cluster node and the resource information of the second candidate cluster node based on a variance algorithm;
and determining the candidate cluster node with the large value in the first value and the second value as the target cluster node.
7. The device for determining the cluster nodes is characterized by comprising an acquisition module, a transceiver module and a processing module;
the acquisition module is used for acquiring resource information of each cluster node in the plurality of cluster nodes and the number of containers which are concurrently created at the current moment by each cluster node, wherein the resource information comprises node memory resources and node Central Processing Unit (CPU) resources;
the receiving and transmitting module is used for receiving a container creation request, wherein the container creation request is used for indicating to create a preset number of containers;
The processing module is used for determining at least one candidate cluster node in the plurality of cluster nodes according to the resource information of the plurality of cluster nodes;
the processing module is further configured to determine a target cluster node in the at least one candidate cluster node according to the resource information of the candidate cluster node and the number of containers concurrently created by the candidate cluster node at the current time.
8. The apparatus of claim 7, wherein the device comprises a plurality of sensors,
the processing module is specifically configured to determine, according to the resource information of the plurality of cluster nodes, at least one preliminary cluster node in the plurality of cluster nodes, where a memory resource of each preliminary cluster node is greater than a first threshold and a CPU resource of each preliminary cluster node is greater than a second threshold;
the processing module is further specifically configured to determine, according to the number of containers concurrently created by the preparation cluster node at the current time, at least one candidate cluster node in the at least one preparation cluster node, where the number of containers concurrently created by each candidate cluster node at the current time is less than or equal to a maximum value of the number of containers concurrently created by each cluster node.
9. The apparatus of claim 7, wherein the device comprises a plurality of sensors,
the processing module is further specifically configured to determine that the first candidate cluster node is the target cluster node if the number of containers concurrently created by the first candidate cluster node at the current time is less than or equal to a third threshold and the number of containers concurrently created by the second candidate cluster node at the current time is greater than a fourth threshold;
the processing module is further specifically configured to determine, if the number of containers concurrently created by the first candidate cluster node at the current time is greater than the third threshold and the number of containers concurrently created by the second candidate cluster node at the current time is greater than the fourth threshold, a target cluster node in the at least one candidate cluster node according to a maximum value of the number of containers concurrently created by the first candidate cluster node and a maximum value of the number of containers concurrently created by the second candidate cluster node;
the processing module is further specifically configured to determine, if the number of containers concurrently created by the first candidate cluster node at the current time is less than or equal to the third threshold and the number of containers concurrently created by the second candidate cluster node at the current time is less than or equal to the fourth threshold, a target cluster node in the at least one candidate cluster node according to resource information of the first candidate cluster node and the second candidate cluster node.
10. The apparatus of claim 9, wherein the device comprises a plurality of sensors,
the processing module is further specifically configured to determine a first difference value between a maximum value of the number of containers concurrently created by the first candidate cluster node and the third threshold;
the processing module is further specifically configured to determine a second difference value between a maximum value of the number of containers concurrently created by the second candidate cluster node and the fourth threshold;
the processing module is further specifically configured to determine, as the target cluster node, a candidate cluster node with a large difference value in the first difference value and the second difference value.
11. The apparatus of claim 9, wherein the device comprises a plurality of sensors,
the processing module is further specifically configured to determine, according to the resource information of the first candidate cluster node and the resource information of the second candidate cluster node and according to a preset rule, a first basic value of the first candidate cluster node and a second basic value of the second candidate cluster node, where the first basic value includes a value corresponding to a node memory resource of the first candidate cluster node and a value corresponding to a node CPU resource, and the second basic value includes a value corresponding to a node memory resource of the second candidate cluster node and a value corresponding to a node CPU resource;
The processing module is further specifically configured to determine a candidate cluster node with a large value in the first basic value and the second basic value as the target cluster node.
12. The apparatus of claim 11, wherein the device comprises a plurality of sensors,
the processing module is further specifically configured to determine, based on a variance algorithm, a first value of the first candidate cluster node and a second value of the second candidate cluster node according to the resource information of the first candidate cluster node and the resource information of the second candidate cluster node;
the processing module is further specifically configured to determine a candidate cluster node with a large value in the first value and the second value as the target cluster node.
13. A cluster node determining apparatus, comprising: a processor; the processor is coupled to a memory for storing a program or instructions which, when executed by the processor, cause the determining means of the cluster node to perform the method of any of claims 1 to 6.
14. A computer readable storage medium having instructions stored therein, wherein when the instructions are executed by a computer, the computer performs the method of any one of claims 1 to 6.
CN202311257318.3A 2023-09-26 2023-09-26 Cluster node determining method and device Pending CN117349009A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN202311257318.3A CN117349009A (en) 2023-09-26 2023-09-26 Cluster node determining method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202311257318.3A CN117349009A (en) 2023-09-26 2023-09-26 Cluster node determining method and device

Publications (1)

Publication Number Publication Date
CN117349009A true CN117349009A (en) 2024-01-05

Family

ID=89368323

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202311257318.3A Pending CN117349009A (en) 2023-09-26 2023-09-26 Cluster node determining method and device

Country Status (1)

Country Link
CN (1) CN117349009A (en)

Similar Documents

Publication Publication Date Title
CN115328663B (en) Method, device, equipment and storage medium for scheduling resources based on PaaS platform
CN113243005A (en) Performance-based hardware emulation in on-demand network code execution systems
CN110096336B (en) Data monitoring method, device, equipment and medium
KR20170110708A (en) Opportunistic Resource Migration for Resource Deployment Optimization
US10169102B2 (en) Load calculation method, load calculation program, and load calculation apparatus
CN109960575B (en) Computing capacity sharing method, system and related equipment
CN111324427B (en) Task scheduling method and device based on DSP
CN114416352A (en) Computing resource allocation method and device, electronic equipment and storage medium
CN113010265A (en) Pod scheduling method, scheduler, memory plug-in and system
CN112698952A (en) Unified management method and device for computing resources, computer equipment and storage medium
CN112685148A (en) Asynchronous communication method and device of mass terminals, computer equipment and storage medium
CN113886069A (en) Resource allocation method and device, electronic equipment and storage medium
CN111831411A (en) Task processing method and device, storage medium and electronic equipment
US11561824B2 (en) Embedded persistent queue
CN114153549A (en) Virtual machine creation method and related equipment
CN111399999A (en) Computer resource processing method and device, readable storage medium and computer equipment
CN114070755A (en) Virtual machine network flow determining method and device, electronic equipment and storage medium
CN111831408A (en) Asynchronous task processing method and device, electronic equipment and medium
CN112860387A (en) Distributed task scheduling method and device, computer equipment and storage medium
CN111008064A (en) Virtual machine resource scheduling method and device, and cluster deployment method and device
CN117349009A (en) Cluster node determining method and device
CN110912949A (en) Method and device for submitting sites
CN114741165A (en) Processing method of data processing platform, computer equipment and storage device
CN114090201A (en) Resource scheduling method, device, equipment and storage medium
CN113703930A (en) Task scheduling method, device and system and computer readable storage medium

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination