CN110569124A

CN110569124A - Task allocation method and device

Info

Publication number: CN110569124A
Application number: CN201910751786.3A
Authority: CN
Inventors: 封志华
Original assignee: Ping An Property and Casualty Insurance Company of China Ltd
Current assignee: Ping An Property and Casualty Insurance Company of China Ltd
Priority date: 2019-08-15
Filing date: 2019-08-15
Publication date: 2019-12-13

Abstract

the application discloses a task allocation method and a task allocation device, wherein the method comprises the following steps: the method comprises the steps that a first server sends a first message to a task distribution system, wherein the first message is used for the task distribution system to determine the operation condition of the first server; the first server receives a task obtaining rule of the first server sent by the task distribution system; the task obtaining rule of the first server is determined for the task distribution system according to the running conditions of N servers in a server cluster environment, wherein the N servers comprise the first server; and the first server acquires the target task from the common task pool according to the task acquisition rule. By adopting the embodiment of the invention, the task competition among the servers can be effectively reduced, and the allocation strategy can be dynamically adjusted efficiently.

Description

Task allocation method and device

Technical Field

The present application relates to the field of computer technologies, and in particular, to a task allocation method and apparatus.

Background

In a cluster environment of a plurality of servers, in order to balance system load, tasks to be executed need to be distributed to each server as evenly as possible, and resources of the servers need to be fully utilized. Currently, the processing modes of task allocation commonly used include "administrator distribution" and "executive initiative acquisition". For the processing mode of "executor actively acquires", the mode is to implement the distribution of tasks based on that the executor (i.e. application instance, or server) actively acquires tasks in the task pool. The executor in this mode needs to acquire the target task to be executed according to the determined acquisition rule or the dynamically allocated acquisition rule.

However, in the mode of acquiring tasks according to the dynamically allocated acquisition rules, the acquisition rules are adjusted according to the overall operating conditions of the cluster environment, and the acquisition rules are sent to the servers, for example, when the number of servers in the cluster environment is reduced and the number of tasks is not changed, each server acquires more tasks according to the adjusted acquisition rules. The actual operation difference and the processing capacity of the servers are not considered, so that the rules obtained by a plurality of servers are basically consistent, and the processing capacity of the servers cannot be effectively utilized. The server cannot effectively solve the task competition problem of the plurality of servers in the task obtaining process according to the similar obtaining rules.

Therefore, how to efficiently and dynamically adjust the policy for allocating the appropriate servers and effectively reduce the task competition among the servers is an urgent problem to be solved in the present application.

disclosure of Invention

The embodiment of the invention provides a task allocation method and a task allocation device, which can effectively reduce task competition among servers and efficiently and dynamically adjust allocation strategies.

in a first aspect, an embodiment of the present invention provides a task allocation method, where the method may include:

the method comprises the steps that a first server sends a first message to a task distribution system, wherein the first message is used for the task distribution system to determine the operation condition of the first server;

the first server receives a task obtaining rule of the first server sent by the task distribution system; the task obtaining rule of the first server is determined for the task distribution system according to the running conditions of N servers in a server cluster environment, wherein the N servers comprise the first server;

And the first server acquires the target task from the common task pool according to the task acquisition rule.

By implementing the embodiment of the invention, the running state of the server in the server cluster and the conditions of whether the server is off-line due to faults or not are obtained in real time by sending the first message to the task distribution system, so that the task distribution system can accurately and reasonably distribute the tasks according to the cluster resources; the server (including the first server) in the cluster receives the task obtaining rule fed back by the task distribution system before obtaining the task, and obtains the task according to the task obtaining rule, so that the problems of task competition and the like of the server in the cluster in the task obtaining process are avoided.

In a possible implementation manner, before the first server acquires the target task from the common task pool according to the task acquisition rule, the method further includes:

the first server performs hash operation on the task identifier of the target task to obtain a corresponding hash value, and judges whether the target task is obtained or not according to the hash value;

And when the first server judges that the hash value is within a preset value range, determining to acquire the target task.

And the first server locks the task identifier of the target task so as to lock the acquisition permission of the target task.

in a possible implementation manner, after the first server obtains the target task in the common task pool according to the task obtaining rule, the method further includes:

the first server determines a task execution strategy of the target task, wherein the task execution strategy is sent to the first server by the task distribution system, or the task execution strategy is contained in the target task;

And executing the target task according to the task execution strategy.

In a second aspect, an embodiment of the present invention provides a task allocation method, where the method may include:

the task allocation system receives N first messages sent by N servers, wherein each first message in the N first messages is used for determining the running condition of the corresponding server in the server cluster environment;

the task allocation system determines a task acquisition rule of each server in the N servers according to the running conditions of the N servers;

And the task distribution system sends a corresponding task acquisition rule to each server in the N servers.

By implementing the embodiment of the invention, the task allocation system receives the first message of the server and feeds back the task obtaining rule to each server according to the first message, so that the task obtaining decision is not occupied by the resource of the server, and the task obtaining rule can be adjusted according to the task condition in the cluster. The task allocation system adjusts and formulates a task acquisition rule, and then sends a corresponding rule to the servers in the cluster, wherein the task rules are different for each server, but the rules are not contradictory, so that the task competition among the servers is effectively avoided; due to the task obtaining rule sent by the task distribution system, the change condition of the cluster resources can be uniformly adjusted within the first time, and the resources of the servers in the cluster environment can be efficiently utilized.

In one possible implementation, the operation condition includes load information of each of the N servers; the task allocation system determines a task obtaining rule of each server in the N servers according to the running conditions of the N servers, and the method comprises the following steps:

And the task allocation system determines that each server in the N servers acquires one or more corresponding target tasks in a corresponding target time period according to the load information of each server in the N servers and the total amount of tasks in the common task pool.

in one possible implementation, the method further includes:

and the task allocation system determines the number of running servers and the number of idle servers in the N servers in the server cluster environment according to the N first messages, wherein the running servers are non-failure servers which are electrified to run, and the idle servers are servers with load values lower than preset load values.

In a third aspect, an embodiment of the present invention provides a task allocation apparatus, including:

The system comprises a sending unit, a task allocation system and a processing unit, wherein the sending unit is used for sending a first message to the task allocation system by a first server, and the first message is used for determining the running condition of the first server by the task allocation system;

A first receiving unit, configured to receive, by the first server, a task acquisition rule of the first server sent by the task distribution system; the task obtaining rule of the first server is determined for the task distribution system according to the running conditions of N servers in a server cluster environment, wherein the N servers comprise the first server;

And the acquisition unit is used for acquiring the target task in a public task pool by the first server according to the task acquisition rule.

In a possible implementation manner, the apparatus further includes a hash operation unit, configured to, before the first server obtains a target task in a public task pool according to the task obtaining rule, perform, by the first server, a hash operation on a task identifier of the target task to obtain a corresponding hash value, and determine whether to obtain the target task according to the hash value; and when the first server judges that the hash value is within a preset value range, determining to acquire the target task.

In a possible implementation manner, the apparatus further includes a locking unit, configured to lock a task identifier of a target task by the first server to lock an acquisition permission of the target task before the first server acquires the target task in a common task pool according to the task acquisition rule.

in a possible implementation manner, the apparatus further includes a task execution policy determining unit, configured to determine, by the first server, a task execution policy of a target task after the first server acquires the target task in a common task pool according to the task acquisition rule, where the task execution policy is sent to the first server by the task distribution system, or the task execution policy is included in the target task; and executing the target task according to the task execution strategy.

In a fourth aspect, an embodiment of the present invention provides a task allocation apparatus, including:

a second receiving unit, configured to receive, by a task distribution system, N first messages sent by N servers, where each of the N first messages is used to determine an operating condition of a corresponding server in a server cluster environment;

the confirmation unit is used for determining the task acquisition rule of each server in the N servers by the task distribution system according to the running conditions of the N servers;

and the distribution unit is used for sending the corresponding task acquisition rule to each server in the N servers by the task distribution system.

in one possible implementation, the operation condition includes load information of each of the N servers; the confirmation unit is specifically configured to: and the task allocation system determines that each server in the N servers acquires one or more corresponding target tasks in a corresponding target time period according to the load information of each server in the N servers and the total amount of tasks in the common task pool.

In one possible implementation, the apparatus further includes: and the quantity counting unit is used for determining the quantity of the running servers and the quantity of the idle servers in the N servers in the server cluster environment by the task distribution system according to the N first messages, wherein the running servers are non-failure servers which are electrified to run, and the idle servers are servers with load values lower than preset load values.

In a fifth aspect, an embodiment of the present invention provides a distribution apparatus, including a processor and a memory, where the processor and the memory are connected to each other, where the memory is used to store a computer program, and the computer program includes program instructions, and the processor is configured to call the program instructions to execute the method according to the first aspect or the second aspect.

In a sixth aspect, the present invention provides a computer-readable storage medium, in which a computer program is stored, the computer program including program instructions, which, when executed by a processor, cause the processor to perform the method of the first aspect or the second aspect.

Drawings

In order to more clearly illustrate the technical solutions of the embodiments of the present invention, the drawings used in the description of the embodiments will be briefly introduced below.

FIG. 1 is a block diagram of a task allocation architecture according to an embodiment of the present invention;

Fig. 2 is a schematic flowchart of a task allocation method according to an embodiment of the present invention;

FIG. 3 is a flowchart illustrating another task allocation method according to an embodiment of the present invention;

FIG. 4 is a flowchart illustrating a task allocation method according to an embodiment of the present invention;

FIG. 5 is a flowchart illustrating a task allocation method according to another embodiment of the present invention;

FIG. 6 is a diagram of a task allocation application scenario provided by an embodiment of the present invention;

FIG. 7 is a schematic structural diagram of a task allocation apparatus according to an embodiment of the present invention;

FIG. 8 is a schematic structural diagram of a task allocation apparatus according to an embodiment of the present invention;

Fig. 9 is a schematic structural diagram of a dispensing apparatus according to an embodiment of the present invention.

Detailed Description

The terms "comprising" and "having," and any variations thereof, as appearing in the specification, claims and drawings of this application, are intended to cover non-exclusive inclusions. For example, a process, method, system, article, or apparatus that comprises a list of steps or elements is not limited to only those steps or elements listed, but may alternatively include other steps or elements not listed, or inherent to such process, method, article, or apparatus. Furthermore, the terms "first," "second," and "third," etc. are used to distinguish between different objects and are not used to describe a particular order. The technical solutions in the embodiments of the present invention will be described below with reference to the drawings in the embodiments of the present invention.

First, some terms in the present application are explained so as to be easily understood by those skilled in the art.

(1) Server clustering refers to the process of collecting many servers together to perform the same service, and appears as if there is only one server at a client. The cluster can use a plurality of computers to perform parallel computation so as to obtain high computation speed, and can also use a plurality of computers to perform backup so as to ensure that any one machine damages the whole system or can normally run.

(2) Load Balance (Load Balance) is a method of sharing tasks to execute on a plurality of operation units, such as a Web server, an FTP server, an enterprise key application server, and other key task servers, so as to collectively complete work tasks.

(3) heartbeat messages (Heartbeat messages) are messages that a sending source sends to a receiving source, which allows the receiving source to determine if and when the sending source has failed or terminated. Generally, heartbeat messages are sent from the time the sender is started until the sender is turned off, during which the sender sends messages periodically or repeatedly without interruption. When the recipient does not receive a message within a certain message reception period, the recipient may consider the sending source to have been shut down, to have failed, or to be currently unavailable. Heartbeat messages may often be used for high availability or fault tolerant processing purposes.

(4) The primary key is a candidate key that is selected to be the unique identifier of the row of the table. The primary key may be composed of one field or a plurality of fields, and is respectively called a single-field primary key or a multi-field primary key.

(5) the task pool is a component for storing tasks by the business layer, is a container for the tasks, is an instance pool for sharing the tasks among threads, and is completely transparent to the client layer. When the Web application is started, the task pool is created, and when the Web application is stopped, the task pool is cleared. Due to the task caching mechanism provided by the task pool, the system overhead caused by frequently creating and recycling the task instances can be reduced, and the storage resources can be saved.

in the following, a description is first given of one of the system architectures on which the embodiments of the present invention are based, and the text recognition method proposed in the present application can be applied to the system architecture. Referring to fig. 1, fig. 1 is a schematic diagram of an architecture for task allocation according to an embodiment of the present invention, as shown in fig. 1, the architecture includes a server (a plurality of servers form a server cluster) and a task allocation system; wherein the content of the first and second substances,

A server may be a device that provides computing services. The server needs to respond to and process the service request, so that the server has the capability of bearing and guaranteeing the service. In the embodiment of the present invention, the server may perform the following operations: sending a first message to a task allocation system; receiving a task obtaining rule of the first server sent by the task distribution system; and acquiring the target task in the public task pool according to the task acquisition rule. As shown in fig. 1, a server cluster includes a plurality of servers such as a server 1, a server 2, and a server 3, and the number of servers in the server cluster is not limited in the embodiment of the present invention.

The task allocation system may be a software program for storing information and judging and processing information, or a hardware device having a certain arithmetic capability. In the embodiment of the present invention, the task allocation system may include a data list with a certain processing capability, and perform the following operations: receiving N first messages sent by N servers; determining a task obtaining rule of each server in the N servers according to the running conditions of the N servers; and sending a corresponding task obtaining rule to each server in the N servers.

It will be appreciated that the illustration of fig. 1 is merely an exemplary implementation of an embodiment of the present invention. The architecture in the embodiments of the present invention may include, but is not limited to, the above architecture.

The following specifically analyzes and solves the technical problem proposed in the present application in combination with the above system architecture and the embodiment of a task allocation method provided in the present application.

Referring to fig. 2, fig. 2 is a flowchart illustrating a task allocation method according to an embodiment of the present invention, where the task allocation method can be applied to a task allocation system (including the above-mentioned architecture). In the following, referring to fig. 2, taking the first server as an example of the execution subject, the method may include the following steps S201 to S203.

Step S201: the first server sends a first message to the task distribution system.

specifically, the first server sends a first message to the task distribution system when starting to start running until the first server is offline (i.e., not working) due to power failure, malfunction, and the like. During this period, the first server will send the first message continuously. The first server can be any one of the server clusters, and the online server in each cluster sends a first message to the task distribution system; the first message is used for the task distribution system to determine the operation condition of the first server, the first message may include a heartbeat message, and the operation condition may include whether to go offline, whether to fail, whether to execute the task by the server, whether to acquire the task by the server, and load information of the server. For example, all servers in the clustered environment send heartbeat messages to a common registry after being powered on and brought online. The frequency of the first message sent by the server is not limited in the embodiment of the invention.

Step S202: and the first server receives the task obtaining rule of the first server sent by the task distribution system.

Specifically, during a period when a first server sends a first message, the first server receives a task obtaining rule fed back by a task allocation system, and obtains a task according to the rule after obtaining the task obtaining rule, wherein the task obtaining rule of the first server is determined by the task allocation system according to the operating conditions of N servers in a server cluster environment, and the N servers include the first server. For example, the servers in the cluster may receive the task fetch rules sent by the common register during the sending of the heartbeat message.

Step S203: and the first server acquires the target task from the common task pool according to the task acquisition rule.

Specifically, after confirming the target task and locking the target task, the first server takes out the target task from the common task pool, and takes out task content of the target task and/or a task execution policy associated with the target task.

By implementing the embodiment of the invention, the running condition of the servers in the server cluster (including the running condition of each server and the running condition of the whole cluster environment) and whether the servers are off line due to faults or not are acquired in real time through the first message sent to the task distribution system, so that the task distribution system can accurately and reasonably distribute the tasks according to the cluster resources; the server (including the first server) in the cluster receives the task obtaining rule fed back by the task distribution system before obtaining the task, and obtains the task according to the task obtaining rule, so that the problems of task competition and the like of the server in the cluster in the task obtaining process are avoided.

Referring to fig. 3, fig. 3 is a flowchart illustrating a task allocation method according to an embodiment of the present invention, where the task allocation method can be applied to a task allocation system (including the above-mentioned architecture). In the following, referring to fig. 3, taking the first server as an execution subject, the method may include the following steps S301 to S308; the optional steps may include step S303, step S304, step S305, step S307, and step S308.

step S301: the first server sends a first message to the task distribution system.

specifically, please refer to the description of the foregoing step S201.

Alternatively, the task distribution system may include a common registry, i.e., a data list, for recording the number of servers that are alive and the number of servers that are idle in the server cluster environment; the live servers are servers in power-on operation, and may include servers that are not performing tasks (i.e., are idle) and servers that are performing tasks.

step S302: and the first server receives the task obtaining rule of the first server sent by the task distribution system.

specifically, please refer to the description of step S202.

Step S303: and the first server performs hash operation on the task identifier of the target task to obtain a corresponding hash value.

specifically, the first server performs hash operation on the task identifier of the target task to obtain a hash value corresponding to the task identifier. The task identity may include a task primary key. For example, each task in the common task pool has a task ID (i.e., a task primary key), which may include single-field IDs and multi-field IDs. The first server needs to fetch a target task corresponding to the task ID that meets the task obtaining rule. The first server carries out hash operation on the task main keys with different forms and lengths to obtain hash values mapped in a preset length or a numerical range. For example, the task primary key is 20190114, and after the hash operation, the task primary key is mapped to 1.

Step S304: judging whether the target task is acquired or not according to the hash value; and when the first server judges that the hash value is within a preset value range, determining to acquire the target task.

Specifically, the first server judges whether the hash value is within a preset value range of the task obtaining rule or is matched with the hash value corresponding to the target task in the task obtaining rule through the hash value obtained by the task identifier of the target task, and if the hash value meets one of the requirements, the target task is confirmed to be obtained. For example, before the server acquires a task, the server determines the hash value of the task ID and determines whether to acquire the task.

Alternatively, the step S304 of determining to acquire the target task may be an instruction of the server itself after the determination, or the content of the step is the determination of the hash value, and the operation of determining to acquire the target task and the operation of acquiring the target task may be performed synchronously.

Step S305: and the first server locks the task identifier of the target task so as to lock the acquisition permission of the target task.

specifically, after confirming that the target task is to be taken out, the first server may lock a task identifier of the target task, thereby ensuring that only the first server can obtain the target task and execute the target task, where the locking may include logically locking the target task, and the first server locks the target task, so as to avoid other servers from obtaining the same target task. For example, when the server a acquires the task a and locks the task a, the task a is locked; at server B, which is synchronized to fetch the task with server A, task a, which may be still in the task pool but has been locked, cannot be fetched.

step S306: and the first server acquires the target task in a public task pool according to the task acquisition rule.

specifically, please refer to the description of the foregoing step S203.

step S307: the first server determines a task execution policy of the target task.

Specifically, when the first server fetches a task, a process of judging an obtained task execution policy is added, that is, how to execute the fetched target task is determined.

Optionally, the corresponding task is executed according to different task execution strategies, and processing resources and processing time are reasonably distributed. And after the server takes out the corresponding task, executing the obtained task according to the task execution strategy. The task execution strategy comprises task dependence, retry interval, execution times and execution time.

Task dependency, which refers to the order of execution between different tasks; for example, task a, task b, and task c are performed in the order of bca, then after task b is performed, task c is performed, and after task c is finished, task a is performed. It is also possible to set 2 tasks to be processed at a certain stage at the same time. The strength of the sequential relevance between the tasks can also be set, for example, after the task a, the task b must be executed, or after the task a, the task b can be selected to be executed, and the task b is executed after the task a but immediately after the task a is completed.

The retry interval refers to the length of time between a task being executed once and the task being executed again. For example, after the execution of the task a fails, the task a is executed again after a set retry interval, until the retry is finished after a preset condition (for example, the task a is successfully executed) is satisfied.

optionally, the task execution policy is sent to the first server by the task distribution system, or the task execution policy is included in the target task. Under the condition of obtaining a task execution policy contained in a target task (namely, the content of the target task indicates which tasks have a close execution sequence, or the execution sequence is synchronous, and the like), the target task is taken out and the corresponding task execution policy is confirmed, and a plurality of tasks with strong relevance are preferentially obtained to be executed in the same instance (namely, a server) (under the condition that the task execution policy does not conflict with the task acquisition rule of the server). When a plurality of tasks with strong relevance are dispersed in different instances, communication can be established among the instances, and the tasks acquired by the instances are executed according to the execution strategies among the tasks.

Step S308: and executing the target task according to the task execution strategy.

Specifically, the first server executes the acquired target task according to the task execution policy determined in the foregoing step S307.

Referring to fig. 4, fig. 4 is a flowchart illustrating a task allocation method according to an embodiment of the present invention, where the task allocation method can be applied to a task allocation system (including the above-mentioned architecture). Referring to fig. 4, taking the task allocation system as an execution subject, the method may include the following steps S401 to S404.

Step S401: the task distribution system receives N first messages sent by N servers.

specifically, the task allocation system receives N first messages sent by all N servers running online in the server cluster environment. Each of the N first messages is used to determine an operation condition of the corresponding server in the server cluster environment, and optionally, the overall operation condition of the server cluster environment is determined according to all the N first messages, for example, a condition of monitoring the number of servers that are processing a task. The embodiment of the invention does not limit the communication mode between the task distribution system and the server.

Step S402: and the task allocation system determines a task acquisition rule of each server in the N servers according to the running conditions of the N servers.

Specifically, the task allocation system formulates a task obtaining rule which accords with the running condition of the cluster environment at the current moment and the running condition of each server in the cluster environment for each server in the cluster according to the obtained number of idle servers, the task execution capacity of each server and the number of tasks in a common task pool, wherein the task obtaining rule is a basis used by a first server when the first server obtains a task to be executed in the common task pool; in the cluster environment at the same time, the servers with different operation conditions may obtain different acquisition rules; for the same server, in cluster environments at different times, due to factors such as the load condition of the server, the processing capacity, the task amount, and the like, the obtained acquisition rules may be different. For example, firstly, the task allocation system judges whether the server corresponding to each first message is idle and the number corresponding to different running states according to the received N first messages; when the number of idle servers is greater than a certain threshold, it is determined that there are more idle servers, and the number of tasks acquired by each server taking a task in the common task pool does not exceed the upper limit of the processing load, for example, 1 task is allocated to the server taking the task (the upper limit of the executed task is 1). When the number of idle servers is less than a certain threshold value, judging that the number of idle servers is less; in order to realize that the tasks to be executed are executed as much as possible, when the idle server acquires the tasks, the idle server can acquire at least 1 task and possibly acquire a plurality of or a series of a plurality of tasks (for example, the execution sequence is closely arranged, and the task B is executed immediately after the task A is executed), so that the time for communicating with other servers for judging the execution sequence of the target task is reduced, and the processing efficiency is improved.

step S403: and the task distribution system sends a corresponding task acquisition rule to each server in the N servers.

Specifically, after determining the task obtaining rule of each server in the N servers, the task allocation system may send the task obtaining rule to the corresponding server through a network or the like.

By implementing the embodiment of the invention, the first message of the server is received by the task allocation system, and the task rule is fed back to each server according to the first message, so that the conditions of the available servers in the cluster can be mastered in real time, the feedback to different idle servers is adjusted, the corresponding task acquisition rules are sent, and the dynamic changes of the tasks and the servers can be dealt with without predicting the conditions. Therefore, the task obtaining decision is not occupied by the resources of the server, and the task obtaining rule can be adjusted according to the task condition in the cluster. The task allocation system adjusts and formulates a task acquisition rule, and then sends a corresponding rule to the servers in the cluster, wherein the task rules are different for each server, but the rules are not contradictory, so that the task competition among the servers is effectively avoided; due to the task obtaining rule sent by the task distribution system, the change condition of the cluster resources can be uniformly adjusted within the first time, and the resources of the servers in the cluster environment can be efficiently utilized.

Referring to fig. 5, fig. 5 is a flowchart illustrating a task allocation method according to another embodiment of the present invention, where the task allocation method can be applied to a task allocation system (including the above-mentioned architecture). Referring to fig. 5, taking the task allocation system as an execution subject, the method may include the following steps S501 to S504, where the optional steps may include step S504.

Step S501: the task distribution system receives N first messages sent by N servers.

Specifically, please refer to the description of the foregoing step S401.

Step S502: and the task allocation system determines a task acquisition rule of each server in the N servers according to the running conditions of the N servers.

Specifically, please refer to the description of the foregoing step S402.

And the task allocation system determines that each server in the N servers acquires one or more corresponding target tasks in a corresponding target time period according to the load information of each server in the N servers and the total amount of tasks in the common task pool. For example, a common registry (i.e., a task distribution system) determines the number of instances in the cluster that are running normally, and the number of free instances that can get tasks in the task pool, upon receiving all heartbeat messages in the cluster. And sending an instruction to the determined idle instances according to the task condition in the task pool (the instruction comprises the rule for each idle instance to acquire the task, such as the number, the task complexity and the association degree), and acquiring the task meeting the requirement in the task pool by the idle instances after receiving the instruction.

Step S503: and the task distribution system sends a corresponding task acquisition rule to each server in the N servers.

Specifically, please refer to the description of the foregoing step S403.

step S504: and the task allocation system determines the number of running servers and the number of idle servers in the N servers in the server cluster environment according to the N first messages.

Specifically, the task distribution system can distinguish which servers are online without or running a small number of tasks through load low, which servers are busy processing tasks through load high, or the processing capacity is higher than that of the server and other servers are required to share tasks according to the content of the N first messages. In order to visually reflect the number of servers in different states, the task allocation system counts the number of servers in these states after differentiation. The operating server is a non-failure server which is in power-on operation, and the idle server is a server with a load value lower than a preset load value.

To facilitate understanding of the embodiment of the present invention, a scenario in which a task allocation method in the present application is applied is exemplarily listed below, and a server in a server cluster is taken as an example for description below, please refer to fig. 6, where fig. 6 is a diagram of a scenario in which a task is allocated according to an embodiment of the present invention.

As shown in the figure, the application scenario includes a common register, a server cluster, and a common task pool, where the common register is described by taking a server (the server in the application scenario is one of application instances) as an example, the server cluster includes multiple servers such as a server 1, a server 2, and a server 3, and the common task pool includes multiple tasks such as a task 1, a task 2, and a task 3. The server 1 (namely, a first server) sends heartbeat messages (namely, first messages) to a public registry, the public registry receives the heartbeat messages of all servers in the server cluster, and the running condition of the server 1 can be determined through the heartbeat messages corresponding to the server 1; the common register book determines the task obtaining rule of each server according to the running conditions of all the servers, and the task obtaining rule comprises the task obtaining rule corresponding to the server 1. The server 1 receives the task obtaining rule of the server 1 sent by the public register, and then the server 1 obtains the target task in the public task pool according to the obtained task obtaining rule. The server 1, the heartbeat message 1, the task obtaining rule 1 and the task 1 are exemplary description objects, and the exemplary objects are used for conveniently describing the application scene. The operation condition of the server is confirmed through the heartbeat message, and then the task allocation condition in the task pool is adjusted according to the specific operation condition, so that reasonable response is effectively made according to the cluster environment; by feeding back the acquisition rule through the public registry, the load condition of each current server is met, and task competition possibly caused by conflict of the acquisition rule of the server or untimely server communication is avoided.

It is to be understood that the above application scenarios are only exemplary embodiments of the present invention, and the application scenarios in the embodiments of the present invention include, but are not limited to, the above application scenarios.

The method of the embodiments of the present invention is explained in detail above, and the related apparatus of the embodiments of the present invention is provided below.

Referring to fig. 7, fig. 7 is a schematic structural diagram of a task allocation apparatus according to an embodiment of the present invention, which may include a sending unit 701, a first receiving unit 702, an obtaining unit 703, a hash operation unit 704, a locking unit 705, and a task execution policy determining unit 706. The optional units include a hash operation unit 704, a locking unit 705, and a task execution policy determination unit 706.

A sending unit 701, configured to send a first message to a task allocation system by a first server, where the first message is used for the task allocation system to determine an operating condition of the first server;

A first receiving unit 702, configured to receive, by the first server, a task obtaining rule of the first server sent by the task distribution system; the task obtaining rule of the first server is determined for the task distribution system according to the running conditions of N servers in a server cluster environment, wherein the N servers comprise the first server;

An obtaining unit 703 is configured to obtain, by the first server, a target task in a common task pool according to the task obtaining rule.

In a possible implementation manner, the apparatus 70 further includes a hash operation unit 704, configured to, before the first server obtains a target task in a public task pool according to the task obtaining rule, perform a hash operation on a task identifier of the target task by the first server, obtain a corresponding hash value, and determine whether to obtain the target task according to the hash value; and when the first server judges that the hash value is within a preset value range, determining to acquire the target task.

in a possible implementation manner, the apparatus 70 further includes a locking unit 705, configured to lock a task identifier of a target task by the first server to lock an acquisition right of the target task before the first server acquires the target task in a common task pool according to the task acquisition rule.

in a possible implementation manner, the apparatus 70 further includes a task execution policy determining unit 706, configured to, after the first server obtains a target task in a common task pool according to the task obtaining rule, determine, by the first server, a task execution policy of the target task, where the task execution policy is sent to the first server by the task distribution system, or the task execution policy is included in the target task; and executing the target task according to the task execution strategy.

Referring to fig. 8, fig. 8 is a schematic structural diagram of a task allocation apparatus according to an embodiment of the present invention, which may include a second receiving unit 801, a confirming unit 802, an allocating unit 803, and a quantity counting unit 804. Wherein the optional unit comprises a quantity statistics unit 804.

A second receiving unit 801, configured to receive, by a task distribution system, N first messages sent by N servers, where each of the N first messages is used to determine an operating condition of a corresponding server in a server cluster environment;

A determining unit 802, configured to determine, by the task allocation system, a task obtaining rule of each server in the N servers according to the operating conditions of the N servers;

In one possible implementation, the operation condition includes load information of each of the N servers; the confirming unit 802 is specifically configured to: and the task allocation system determines that each server in the N servers acquires one or more corresponding target tasks in a corresponding target time period according to the load information of each server in the N servers and the total amount of tasks in the common task pool.

An allocating unit 803, configured to send, by the task allocation system, a corresponding task acquisition rule to each server in the N servers.

In one possible implementation, the apparatus 80 further includes: the number counting unit 804 is configured to determine, by the task allocation system, the number of running servers and the number of idle servers in the N servers in the server cluster environment according to the N first messages, where the running servers are non-failure servers and are powered on to run, and the idle servers are servers with a load value lower than a preset load value.

it should be noted that, for the functions of each functional unit of the task allocation device described in the embodiment of the apparatus of the present application, reference may be made to the related description of the text recognition method in the embodiment of the method described in fig. 2 to fig. 5, which is not described herein again.

an embodiment of the present invention further provides a computer storage medium, where the computer storage medium may store a program, and the program includes, when executed, some or all of the steps described in any of the above method embodiments.

Embodiments of the present invention further provide a computer program, where the computer program includes instructions, and when the computer program is executed by a computer, the computer may perform some or all of the steps in the task allocation method in the foregoing method embodiments.

Referring to fig. 9, fig. 9 is a schematic structural diagram of an allocation apparatus 90 according to an embodiment of the present invention, and as shown in fig. 9, a task allocation device may be implemented in the structure of fig. 9, where the allocation apparatus 90 may include at least one storage component 901, at least one processing component 902, and at least one communication component 903. In addition, the device may also include general components such as an antenna, a power supply, etc., which will not be described in detail herein.

The storage component 901 may include one or more storage units, each of which may include one or more memories, which may be used to store programs and various data and enable high-speed, automated access to the programs or data during operation of the device. Physical devices having two stable states, denoted "0" and "1", respectively, may be employed to store information. The storage component 901 may be a Read-Only Memory (ROM) or other types of static storage devices that can store static information and instructions, a Random Access Memory (RAM) or other types of dynamic storage devices that can store information and instructions, an Electrically Erasable Programmable Read-Only Memory (EEPROM), a Compact Disc Read-Only Memory (CD-ROM) or other optical Disc storage, optical Disc storage (which may include Compact Disc, laser Disc, optical Disc, digital versatile Disc, blu-ray Disc, etc.), magnetic disk storage media or other magnetic storage devices, or any other medium that can be used to carry or store desired program code in the form of instructions or data structures and that can be accessed by a computer, but is not limited to such. The memory may be self-contained and coupled to the processor via a bus. The memory may also be integral to the processor.

The processing component 902, which may also be referred to as a processor, a processing unit, a processing board, a processing module, a processing device, or the like. The processing unit may be a Central Processing Unit (CPU), a Network Processor (NP), or a combination of a CPU and an NP, or may be a microprocessor, an application-specific integrated circuit (ASIC), or one or more integrated circuits for controlling the execution of the above programs.

the communication component 903, which may also be referred to as a transceiver, or transceiver, etc., may be used for communicating with other devices or communication networks, which may include elements for wireless, wired, or other communication.

When the distribution device 90 is the first server shown in fig. 1, the processing unit 902 is configured to call the data of the storage unit 901 to perform the related description of the method described in fig. 2 or fig. 3, which is not described herein again.

When the allocating device 90 is the task allocating system shown in fig. 1, the processing unit 902 is configured to call the data of the storage unit 901 to execute the related description of the method shown in fig. 4 or fig. 5, which is not described herein again.

In the foregoing embodiments, the descriptions of the respective embodiments have respective emphasis, and for parts that are not described in detail in a certain embodiment, reference may be made to related descriptions of other embodiments.

It should be noted that, for simplicity of description, the above-mentioned method embodiments are described as a series of acts or combination of acts, but those skilled in the art will recognize that the present application is not limited by the order of acts described, as some steps may occur in other orders or concurrently depending on the application. Further, those skilled in the art should also appreciate that the embodiments described in the specification are preferred embodiments and that the acts and modules referred to are not necessarily required in this application.

in the embodiments provided in the present application, it should be understood that the disclosed apparatus may be implemented in other manners. For example, the above-described embodiments of the apparatus are merely illustrative, and for example, the above-described division of the units is only one type of division of logical functions, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection of some interfaces, devices or units, and may be an electric or other form.

in this application, the units described as separate parts may or may not be physically separate, and parts displayed 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 can be selected according to actual needs to achieve the purpose of the solution of the embodiment of the present invention.

In addition, functional components in the embodiments of the present application may be integrated into one component, or each component may exist alone physically, or two or more components may be integrated into one component. The integrated components can be realized in a form of hardware or a form of software functional units.

The integrated components, if implemented in the form of software functional units and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present application may be substantially or partially contributed by the prior art, or all or part of the technical solution may be embodied in a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present application. And the aforementioned storage medium includes: a U-disk, a removable hard disk, a Read-only Memory (ROM), a Random Access Memory (RAM), a magnetic disk or an optical disk, and other various media capable of storing program codes.

while the invention has been described with reference to specific embodiments, the scope of the invention is not limited thereto, and those skilled in the art can easily conceive various equivalent modifications or substitutions within the technical scope of the invention. Therefore, the protection scope of the present application shall be subject to the protection scope of the claims.

It should be understood that, in the various embodiments of the present application, the sequence numbers of the above-mentioned processes do not mean the execution sequence, and the execution sequence of the processes should be determined by their functions and inherent logic, and should not constitute any limitation to the implementation process of the embodiments of the present invention. While the present application has been described herein in conjunction with various embodiments, other variations to the disclosed embodiments may be understood and effected by those skilled in the art in practicing the present application as claimed herein.

Claims

1. A task allocation method, comprising:

2. The method of claim 1, wherein before the first server obtains the target task in the common task pool according to the task obtaining rule, the method further comprises:

3. The method according to claim 1 or 2, wherein before the first server obtains the target task in the common task pool according to the task obtaining rule, the method further comprises:

4. The method according to claim 1 or 2, wherein after the first server obtains the target task in the common task pool according to the task obtaining rule, the method further comprises:

And executing the target task according to the task execution strategy.

5. A task allocation method, comprising:

6. The method of claim 5, wherein the operational condition comprises load information for each of the N servers; the task allocation system determines a task obtaining rule of each server in the N servers according to the running conditions of the N servers, and the method comprises the following steps:

7. The method of claim 5 or 6, further comprising:

8. A task assigning apparatus, comprising:

9. A task assigning apparatus, comprising:

10. The distribution equipment is characterized by comprising a storage component, a communication component and a processing component, wherein the storage component, the communication component and the processing component are connected with each other, the storage component is used for storing data processing codes, and the communication component is used for carrying out information interaction with external equipment; the processing means is configured to invoke program code to perform the method of any of the preceding claims 1 to 7.