CN111309467A - Task distribution method and device, electronic equipment and storage medium - Google Patents

Abstract

Embodiments of the present invention relate to the technical field of information processing, and disclose a task distribution method and device, an electronic device, and a storage medium. Obtain a scheduling task from the preset first message queue in response to the task request; add the scheduling task to the preset second message queue; process the scheduling task; All scheduled tasks are taken out, and the first message queue is exchanged with the second message queue, which can reduce waste of resources and improve the efficiency of task distribution.

Description

Task distribution method and device, electronic device and storage medium

technical field

The present invention relates to the technical field of information processing, and in particular, to a task distribution method and device, an electronic device and a storage medium.

Background technique

In the service architecture, cluster deployment is often done for the goals of high availability and high throughput. In a process cluster, multiple identical service processes are often included, and each service process can independently provide external services. In the process of processing the task of each service process, if multiple service processes hit the same task at the same time, the processing task is often obtained by grabbing the lock.

Lock-grabbing task processing means that all service processes in the cluster have obtained all scheduling tasks. Before each service process schedules tasks, it first obtains a distributed task lock for the task. If the lock is obtained, the task is locked. Scheduling, if the lock is not obtained, it means that the task has been processed by other processes, and this process does not process the task.

The inventor finds that the related art has at least the following problems: a large amount of resources are wasted in order to grab tasks among various process services, and the efficiency of task distribution is not high.

SUMMARY OF THE INVENTION

The purpose of the embodiments of the present invention is to provide a task distribution method, which can reduce waste of resources and improve the efficiency of task distribution.

In order to solve the above technical problems, embodiments of the present invention provide a task distribution method, including: in response to a task request, acquiring a scheduling task from a preset first message queue; adding the scheduling task to a preset first message queue In the second message queue; process the scheduling task; if it is detected that all the scheduling tasks in the first message queue are taken out, exchange the first message queue with the second message queue.

Embodiments of the present invention also provide a task distribution system, the task distribution system includes a task distribution module, a task processing module and a queue processing module; the task distribution module is configured to respond to a task request sent by the task processing module, by The queue processing module acquires a scheduling task from the preset first message queue; the queue processing module is used to add the scheduling task to the preset second message queue; the task processing module is used to process The scheduling task; the queue processing module is further configured to exchange the first message queue with the second message queue if it is detected that all the scheduling tasks in the first message queue are taken out.

An embodiment of the present invention also provides an electronic device, including a memory and a processor, the memory stores a computer program, and when the processor runs the program, the processor executes: in response to a task request, acquires a scheduling task from a preset first message queue; Add the scheduling task to the preset second message queue; process the scheduling task; if it is detected that the scheduling tasks in the first message queue are all taken out, combine the first message queue with the second message Queue exchange.

Embodiments of the present invention also provide a non-volatile storage medium for storing a computer-readable program, where the computer-readable program is used for a computer to execute the above task distribution method.

Compared with the prior art, the embodiment of the present invention acquires a scheduling task from a preset first message queue in response to a task request, adds the scheduling task to a preset second message queue, and uses the message Queue to realize task distribution can avoid each process consuming resources that can be used to process scheduling tasks in order to obtain processing tasks, and improve the efficiency of task distribution; design a second message queue to store in a round of scheduling tasks that have been The fetched task can ensure that each grid has only one scheduling task in a scheduling cycle, avoiding the waste of resources caused by repeatedly scheduling the scheduling tasks of each grid in a scheduling cycle. After the tasks are all taken out, the first message queue is exchanged with the second message queue, which can ensure the smooth progress of the next round of task scheduling.

In addition, the above task distribution method is applied to a task distribution system including a task distribution module, a task processing module and a queue processing module; in response to a task request, acquiring a scheduling task from a preset first message queue, specifically: a task distribution module In response to the task request sent by the task processing module, obtain a scheduling task from the preset first message queue through the queue processing module; add the scheduling task to the preset second message queue, specifically: the queue processing module will schedule The task is added to the preset second message queue; the processing of the scheduling task is specifically, the task processing module processes the scheduling task; if it is detected that the scheduling tasks in the first message queue are all taken out, the first message queue and the second message queue are Specifically, if the queue processing module detects that all the scheduling tasks in the first message queue are taken out, the identities of the first message queue and the second message queue are exchanged. Provide a task distribution module to complete the distribution of process tasks. The task distribution module receives the task request sent by the task processing module, and sends the obtained scheduling task to the task processing module, so as to avoid each task processing module consuming the original available processing tasks for obtaining processing tasks. Resources for processing scheduled tasks.

In addition, the number of the task distribution modules is multiple and a task distribution module cluster is formed; the task distribution module responding to the task request is one of the task distribution module clusters; the task distribution system further includes a selection module, before the task distribution module responds to the task request sent by the task processing module, and before the scheduling task fetched from the preset first message queue by the queue processing module, further comprising: the selection module is based on A preset assignment principle assigns the task request to the task distribution module. Multiple task distribution modules form a task distribution module cluster. The selection module selects a task distribution module for task distribution, directly distributes tasks to the task acquisition module through the task distribution module, and gathers multiple task distribution modules to form tasks. The distribution module cluster facilitates the unified management of the task distribution module, and makes it easier to update the software and hardware of the task distribution module.

In addition, the above allocation principle is a load balancing principle. According to the load balancing principle, the task distribution module is selected to perform the current task distribution work, so that the load of each task distribution module is relatively balanced, and the resources in the task distribution module cluster are utilized more repeatedly.

In addition, a plurality of task distribution modules in the above-mentioned task distribution module cluster are selected in turn. The target task distribution module is selected by the task processing module, and each task processing module is selected in turn, which can achieve load balance as much as possible from the perspective of the task processing module.

In addition, the number of the above-mentioned task distribution modules and the task processing modules are equal and in one-to-one correspondence; the task distribution module responds to the task request sent by the task processing module, through the queue processing module, from a preset number of Acquiring a scheduling task from a message queue, specifically, the task distribution module acquires a scheduling task from a preset first message queue through the queue processing module in response to a task request sent by the corresponding task processing module . A corresponding task distribution module is set for each task processing module to make task distribution more targeted.

Description of drawings

1 is a flowchart of a task distribution method according to a first embodiment of the present invention;

FIG. 2 is a schematic structural diagram of the connection relationship between the modules according to the first embodiment of the present invention;

3 is a flowchart of a task distribution method according to a second embodiment of the present invention;

4 is a schematic structural diagram of a connection relationship between modules according to a second embodiment of the present invention;

5 is a schematic structural diagram of a task distribution system according to a third embodiment of the present invention;

FIG. 6 is a schematic structural diagram of an electronic device according to a fourth embodiment of the present invention.

Detailed ways

In order to make the objectives, technical solutions and advantages of the embodiments of the present invention clearer, the various embodiments of the present invention will be described in detail below with reference to the accompanying drawings. However, those of ordinary skill in the art can appreciate that, in the various embodiments of the present invention, many technical details are set forth in order for the reader to better understand the present application. However, even without these technical details and various changes and modifications based on the following embodiments, the technical solutions claimed in the present application can be realized. The following divisions of the various embodiments are for the convenience of description, and should not constitute any limitation on the specific implementation of the present invention, and the various embodiments may be combined with each other and referred to each other on the premise of not contradicting each other.

In the field of food delivery, each delivery area can be divided into grids, and there are multiple order tasks in each grid. In actual implementation, multiple task processing modules will be designed to process the For order tasks, each grid is regarded as a scheduling task, and the task processing module can process a grid scheduling task in one processing cycle.

The first embodiment of the present invention relates to a task distribution method, as shown in FIG. 1 , the method includes:

Step S101, in response to the task request, acquire a scheduling task from a preset first message queue.

Specifically, this solution is applied to a task distribution system including a task distribution module, a task processing module and a queue processing module. In the task distribution system, a first message queue can be preset to store the scheduling tasks of the grid. The scheduling tasks and their arrangement order stored in the first message queue module are processed by the first activated task processing module. The message queue module is initialized. When the task processing module in the task distribution system detects that its own tasks to be processed are not enough, it can send a task request to the task distribution module. The task distribution module responds to this request and receives the task request sent by the task processing module through a data interface. The scheduling task is obtained from the first message queue after the initialization is completed through the queue processing module. It should be noted that this scheduling task is a scheduling task taken from the head of the first message queue. In this embodiment, a task distribution module is provided to complete the distribution of process tasks, the task distribution module receives the task request sent by the task processing module, and sends the obtained scheduling task to the task processing module, so as to prevent each task processing module from obtaining Processing tasks consumes resources that can be used to process scheduling tasks, and at the same time, the assignment of scheduling tasks is concentrated in the task distribution module, which can improve the efficiency of task distribution.

Step S102, adding the scheduling task to the preset second message queue.

Specifically, when the scheduling task is obtained from the first message queue, the queue processing module will add the scheduling task obtained from the first scheduling task queue to the second message queue. The scheduling task fetched from the head of the first message queue is placed at the tail of the second message queue, so that the storage order of messages in the second message queue can be guaranteed to be consistent with the first message queue.

In a specific example, the first message queue is message queue A, and the second message queue is message queue B. In the process of obtaining the scheduling task by the task distribution module, the processing center in the message queue module will take out a scheduling task from the head of the message queue A, send the scheduling task to the task distribution module, and put the scheduling task in the message queue At the end of B, after one round of scheduling is completed, there is no scheduling task in message queue A, and the processing center controls the exchange of queue A and queue B. In this way, in the next round of scheduling, the message queue B will be sent from the head of the message queue B. The department obtains the scheduled task and puts it at the tail of the message queue A.

Step S103, processing the scheduling task.

Specifically, after obtaining the scheduling task from the message queue module, the task processing module can send the scheduling task to the task requesting module that sends the task request through the data interface, and then the task requesting module sends the scheduling task.

In a specific example, the scheduling task stored in the message queue can be the number of each grid. During the process of processing the task, the task processing module can find the corresponding grid according to this number, and store the order task in the database of the order task. Find order tasks in this grid and process them. Only the grid number is used to represent the scheduling task, so that the message queue does not need to manage the specific order tasks in the grid.

Step S104: If it is detected that all the scheduling tasks in the first message queue are taken out, the first message queue is exchanged with the second message queue.

Specifically, the queue processing module will monitor the first message queue and the second message queue, and after detecting that the scheduling tasks in the first message queue have been taken out, exchange the first message queue with the second message queue, and also exchange the first message queue with the second message queue. It is to exchange the first address of the first message queue with the first address of the second message queue, so that the next task distribution module can obtain tasks from the first message queue (because the first message queue is the original second message queue, which contains all scheduled tasks). In this implementation manner, the second message queue is designed to store the tasks that have been acquired in one round of scheduling, which can ensure that the scheduling tasks of each grid are only scheduled once in one scheduling period, avoiding the need for scheduling tasks in one scheduling period. The waste of resources caused by the repeated scheduling of the scheduling tasks of each grid.

In this embodiment, the number of task processing modules and task distribution modules are equal and in one-to-one correspondence, and each task distribution module is integrated with its corresponding task processing module to form a cluster process for processing scheduling tasks; each task distribution module Receive the task request sent by its corresponding task processing module; obtain a scheduling task from the preset first message queue through the queue processing module, and after obtaining the scheduling task, the task distribution module will only dispatch the obtained scheduling task. The task is sent to the corresponding task processing module. In this embodiment, a corresponding task distribution module is set for each task processing module, so that the task distribution is more targeted.

The implementation details of the order scheduling method in this embodiment will be specifically described below. The following content is only provided for the convenience of understanding, and is not necessary for implementing this solution.

Taking each task processing module corresponding to a task distribution module as an example, the connection relationship between the modules is shown in Figure 2. Each task distribution module is integrated with its corresponding task processing module to form a cluster process that processes scheduling tasks. .In the message queue A of the message queue module, the scheduling tasks of three grids are stored. Starting from the head of the queue, the numbers corresponding to grid 3, grid 1, and grid 2 are stored respectively. When the task processing module 1 detects that its pending task queue is not full, it sends a task request to the corresponding task distribution module 1, and the task distribution module 1 obtains the scheduling task from the message queue module. This scheduling task is created by the message queue module. The processing center in the message queue A takes out the scheduling task of grid 3 from the head of the message queue A; after the task distribution module 1 obtains the scheduling task, it sends the scheduling task to the task processing module 1; the task processing module 1 is on the grid 3 When the scheduling task of the Grid 3 performs task processing, find out the order task in grid 3 in the database storing the order task and process it.

Compared with the prior art, this embodiment obtains a scheduling task from a preset first message queue in response to a task request, adds the scheduling task to a preset second message queue, and uses the message queue to implement the task It can prevent each process from consuming resources that can be used to process scheduling tasks in order to obtain processing tasks, and improve the efficiency of task distribution; design a second message queue to store the messages that have been called in a round of scheduling tasks. It can ensure that in a scheduling cycle, each grid has only one scheduling task, avoiding the waste of resources caused by repeatedly scheduling the scheduling tasks of each grid in a scheduling cycle, and the tasks in the first message queue are less After that, the first message queue is exchanged with the second message queue, which can ensure the smooth progress of the next round of task scheduling.

The second embodiment of the present invention relates to a task distribution method. This embodiment is substantially the same as the first embodiment. The main difference is that, in this embodiment, the task distribution module and the task processing module are no longer in a one-to-one correspondence. A plurality of task distribution modules form a task distribution module cluster. The flowchart of this embodiment is shown in FIG. 3 , which will be described in detail below.

In this embodiment, the task distribution system further includes a selection module. The task distribution module mentioned in the first embodiment responds to the task request sent by the task processing module, and sends the message from the preset first message queue through the queue processing module. The following step S301 is also included before the scheduling task retrieved from the .

Step S301, the selection module allocates the task request to the task distribution module based on a preset allocation principle.

Specifically, when a task processing module detects that its pending task queue is not full, it can send a task request to the task distribution module cluster, and the task distribution module cluster sends the received task request to a target task distribution module , the target task distribution module receives the task request and performs the next step of processing. The target task distribution module can be selected by the selection module in the task distribution module cluster. The selection module selects a task distribution module from multiple task distribution modules according to the principle of load balancing as the target task distribution unit for receiving the task request. The selection module in the task distribution module cluster selects the task distribution module to perform the current task distribution work according to the load balancing principle, so that the load of each task distribution module is relatively balanced, and the resources in the task distribution module cluster are utilized more repeatedly.

In addition, the target task distribution module can also be selected by the task processing module, and each task distribution module in the task distribution module cluster can be selected by the task processing module in turn as the task distribution module that receives the task request. The target task distribution module is selected by the task processing module, and each task processing module is selected in turn, which can realize load balancing from the perspective of the task processing module.

It should be noted that the task processing module can obtain the identification information corresponding to each task distribution module in the task distribution module cluster in advance, and when selecting the target task distribution module, select a target identification information from the obtained identification information, The task distribution module corresponding to the target identification information is used as the target task distribution module. Moreover, in the specific implementation, each task distribution module can run on the same server, and can also run on different task distribution servers; when each task distribution module runs on different servers, the The identification information may be the IP address of the corresponding task distribution server.

Step S302, in response to the task request, obtain a scheduling task from a preset first message queue.

Step S303, adding the scheduling task to the preset second message queue.

Step S304, processing the scheduling task.

Step S305, if it is detected that all the scheduling tasks in the first message queue are taken out, the first message queue is exchanged with the second message queue.

Steps S302 to S305 are substantially the same as steps S101 to S104 in the first embodiment of the present invention, and to avoid repetition, they will not be repeated here.

In an example, the connection relationship between the various modules in this implementation manner is shown in FIG. 4 , and each task distribution module (only three are shown in the figure, but may actually be multiple) form a task distribution module cluster , and each task processing module (only three are drawn in the figure, in fact there may be more than one) form a task processing module cluster. When a task processing module in the task processing module cluster detects that its pending task queue is not full, it sends a task request to the task distribution module cluster. After the task distribution module cluster receives the task request, the target The task distribution module obtains the scheduling task from the message queue module, and sends the obtained scheduling task to the task processing module.

Compared with the first-generation embodiment, this embodiment integrates multiple task distribution modules to form a task distribution module cluster, which facilitates unified management of the task distribution modules and makes it easier to update the software and hardware of the task distribution modules.

The third embodiment of the present invention relates to a task distribution system. As shown in FIG. 5 , the task distribution system includes: a task distribution module 501 , a task processing module 502 and a queue processing module 503 ; the task distribution module 501 is used to respond to the task The task request sent by the processing module 502 obtains a scheduling task from the preset first message queue through the queue processing module 503; the queue processing module 503 is used to add the scheduling task to the preset second message queue; the task processing module 502 is used to process the scheduling task; the queue processing module 503 is further used to exchange the identities of the first message queue and the second message queue if it is detected that all the scheduling tasks in the first message queue are taken out.

In one example, the number of the above-mentioned task distribution modules 501 is multiple and forms a cluster of task distribution modules 501; the task distribution module 501 responding to the task request is one of the task distribution modules 501 cluster; the task distribution system further includes a selection module, Before the scheduling task fetched from the preset first message queue by the queue processing module 503 in response to the task request sent by the task processing module 502, the task distribution module 501 further includes: the selection module assigns the task based on the preset allocation principle The request is assigned to the task distribution module 501 .

In one example, the above allocation principle is a load balancing principle.

In one example, multiple task distribution modules 501 in the above-mentioned cluster of task distribution modules 501 are selected in turn.

In one example, the number of task distribution modules 501 and task processing modules 502 are equal and in one-to-one correspondence; Specifically, the task distribution module 501 obtains a scheduling task from the preset first message queue through the queue processing module 503 in response to the task request sent by the corresponding task processing module 502 .

It is not difficult to find that this embodiment is a system example corresponding to any of the first to second embodiments, and this embodiment can be implemented in cooperation with any of the first to second embodiments. The related technical details mentioned in the first to second embodiments are still valid in this embodiment, and are not repeated here in order to reduce repetition. Correspondingly, the relevant technical details mentioned in this embodiment can also be applied to the first embodiment to the second embodiment.

It is worth mentioning that each unit involved in this embodiment is a logical unit. In practical applications, a logical unit may be a physical unit, a part of a physical unit, or multiple physical units. A composite implementation of the unit. In addition, in order to highlight the innovative part of the present invention, this embodiment does not introduce units that are not closely related to solving the technical problem proposed by the present invention, but this does not mean that there are no other units in this embodiment.

The fourth embodiment of the present invention relates to an electronic device. As shown in FIG. 6 , the electronic device 600 includes: at least one processor 601; and, a memory 602 communicatively connected to the at least one processor 601; A communication component 603 connected in communication, the communication component 603 receives and transmits data under the control of the processor 601; wherein, the memory 602 stores instructions executable by the at least one processor 601, and the instructions are executed by the at least one processor 601 to achieve: Receive the task request sent by the task processing module; obtain the scheduling task from the preset message queue module; and send the obtained scheduling task to the task processing module.

Specifically, the terminal device 600 includes: one or more processors 601 and a memory 602, and one processor 601 is taken as an example in FIG. 6 . The processor 601 and the memory 602 may be connected by a bus or in other ways, and the connection by a bus is taken as an example in FIG. 6 . As a non-volatile computer-readable storage medium, the memory 602 can be used to store non-volatile software programs, non-volatile computer-executable programs and modules. The processor 601 executes various functional applications and data processing of the device by running the non-volatile software programs, instructions and modules stored in the memory 602, that is, the above-mentioned task distribution method is implemented.

The memory 602 may include a storage program area and a storage data area, wherein the storage program area may store an operating system, an application program required by at least one function; the storage data area may store an option list and the like. Additionally, memory 602 may include high-speed random access memory, and may also include non-volatile memory, such as at least one magnetic disk storage device, flash memory device, or other non-volatile solid state storage device. In some embodiments, memory 602 may optionally include memory 602 located remotely from processor 601, and these remote memories 602 may be connected to external devices via a network. Examples of such networks include, but are not limited to, the Internet, an intranet, a local area network, a mobile communication network, and combinations thereof.

One or more modules are stored in the memory 602, and when executed by one or more processors 601, execute the task distribution method in the above-mentioned first embodiment or the second embodiment.

It is worth mentioning that each unit involved in this embodiment is a logical unit. In practical applications, a logical unit may be a physical unit, a part of a physical unit, or multiple physical units. A composite implementation of the unit. In addition, in order to highlight the innovative part of the present invention, this embodiment does not introduce units that are not closely related to solving the technical problem proposed by the present invention, but this does not mean that there are no other units in this embodiment.

The fifth embodiment of the present invention relates to a non-volatile storage medium for storing a computer-readable program, and the computer-readable program is used for a computer to execute some or all of the above method embodiments.

That is, those skilled in the art can understand that all or part of the steps in the method for implementing the above embodiments can be completed by instructing the relevant hardware through a program, and the program is stored in a storage medium and includes several instructions to make a device ( It may be a single chip microcomputer, a chip, etc.) or a processor (processor) to execute all or part of the steps of the methods of the various embodiments of the present application. The aforementioned storage medium includes: U disk, removable hard disk, Read-Only Memory (ROM, Read-Only Memory), Random Access Memory (RAM, Random Access Memory), magnetic disk or optical disk and other media that can store program codes.

Those skilled in the art can understand that the above-mentioned embodiments are specific examples for realizing the present invention, and in practical applications, various changes in form and details can be made without departing from the spirit and the spirit of the present invention. scope.

The embodiment of the present application discloses A1. A task distribution method, comprising:

In response to the task request, obtain a scheduling task from the preset first message queue;

adding the scheduling task to a preset second message queue;

processing the scheduled task;

If it is detected that all the scheduling tasks in the first message queue are taken out, the first message queue is exchanged with the second message queue.

A2. The task distribution method as described in A1, the task distribution method is applied to a task distribution system comprising a task distribution module, a task processing module and a queue processing module;

The obtaining a scheduling task from the preset first message queue in response to the task request is specifically: the task distribution module responds to the task request sent by the task processing module, and sends the scheduled task from the preset first message queue through the queue processing module. Obtain a scheduling task from the first message queue of ;

The adding the scheduling task to the preset second message queue is specifically: the queue processing module adds the scheduling task to the preset second message queue;

The processing of the scheduling task is specifically: the task processing module processes the scheduling task;

If it is detected that all the scheduling tasks in the first message queue are taken out, the first message queue is exchanged with the second message queue, specifically, if the queue processing module detects that the scheduling tasks in the first message queue are All scheduled tasks are taken out, and the first message queue is exchanged with the second message queue.

A3. The task distribution method according to A2, wherein the number of the task distribution modules is multiple and a task distribution module cluster is formed; the task distribution module responding to the task request is one of the task distribution module clusters ;

The task distribution system further includes a selection module, before the task distribution module responds to the task request sent by the task processing module, and before the scheduling task fetched from the preset first message queue by the queue processing module, Also includes:

The selection module allocates the task request to the task distribution module based on a preset allocation principle.

A4. The task distribution method according to A3, wherein the distribution principle is a load balancing principle.

A5. The task distribution method as described in A3,

A plurality of task distribution modules in the task distribution module cluster are selected in turn.

A6. The task distribution method according to A2, wherein the task distribution modules and the task processing modules are equal in number and correspond one-to-one;

The task distribution module obtains a scheduling task from the preset first message queue through the queue processing module in response to the task request sent by the task processing module, specifically, the task distribution module responds to the corresponding The task request sent by the task processing module is used to obtain a scheduling task from the preset first message queue through the queue processing module.

The embodiment of the present application discloses B1. A task distribution system, the task distribution system includes a task distribution module, a task processing module and a queue processing module;

The task distribution module is configured to acquire a scheduling task from a preset first message queue through the queue processing module in response to a task request sent by the task processing module;

The queue processing module is configured to add the scheduling task to a preset second message queue;

The task processing module is used to process the scheduling task;

The queue processing module is further configured to exchange the identities of the first message queue and the second message queue if it is detected that all the scheduling tasks in the first message queue have been taken out.

The embodiment of the present application discloses C1. An electronic device, comprising a memory and a processor, the memory stores a computer program, and the processor executes the program when running the program:

In response to the task request, obtain a scheduling task from the preset first message queue;

adding the scheduling task to a preset second message queue;

processing the scheduled task;

If it is detected that all the scheduling tasks in the first message queue are taken out, the first message queue is exchanged with the second message queue.

C2. The electronic device as described in C1, the electronic device comprises a task distribution module, a task processing module and a queue processing module;

The obtaining a scheduling task from the preset first message queue in response to the task request is specifically: the task distribution module responds to the task request sent by the task processing module, and sends the scheduled task from the preset first message queue through the queue processing module. Obtain a scheduling task from the first message queue of ;

The adding the scheduling task to the preset second message queue is specifically: the queue processing module adds the scheduling task to the preset second message queue;

The processing of the scheduling task is specifically: the task processing module processes the scheduling task;

If it is detected that the scheduling tasks in the first message queue are all taken out, the identities of the first message queue and the second message queue are exchanged, specifically, if the queue processing module detects the first message All scheduling tasks in the queue are taken out, and the identities of the first message queue and the second message queue are exchanged.

C3. The electronic device according to C2, wherein the number of the task distribution modules is multiple and a task distribution module cluster is formed; the task distribution module responding to the task request is one of the task distribution module clusters;

The task distribution system further includes a selection module, before the task distribution module responds to the task request sent by the task processing module, and before the scheduling task fetched from the preset first message queue by the queue processing module, Also includes:

The selection module allocates the task request to the task distribution module based on a preset allocation principle.

C4. The electronic device according to C3, wherein the distribution principle is a load balancing principle.

C5. The electronic device according to C3, wherein a plurality of task distribution modules in the task distribution module cluster are selected in turn.

C6. The electronic device according to C2, wherein the task distribution module and the task processing module are equal in number and in one-to-one correspondence;

The task distribution module obtains a scheduling task from the preset first message queue through the queue processing module in response to the task request sent by the task processing module, specifically, the task distribution module responds to the corresponding The task request sent by the task processing module is used to obtain a scheduling task from the preset first message queue through the queue processing module.

The embodiments of the present application disclose D1. A non-volatile storage medium for storing a computer-readable program, where the computer-readable program is used for a computer to execute the task distribution method described in any one of A1 to A6.

Claims (10)

1. A method for task distribution, comprising:

responding to a task request, and acquiring a scheduling task from a preset first message queue;

adding the scheduling task into a preset second message queue;

processing the scheduling task;

and if the scheduling tasks in the first message queue are all detected to be taken out, exchanging the first message queue with the second message queue.

2. The task distribution method according to claim 1, wherein the task distribution method is applied to a task distribution system including a task distribution module, a task processing module, and a queue processing module;

the method for responding to the task request and acquiring a scheduling task from a preset first message queue specifically comprises the following steps: the task distribution module responds to a task request sent by the task processing module and obtains a scheduling task from a preset first message queue through the queue processing module;

the adding the scheduling task to a preset second message queue specifically includes: the queue processing module adds the scheduling task to a preset second message queue;

the step of processing the scheduling task specifically includes that the task processing module processes the scheduling task;

and if it is detected that all scheduling tasks in the first message queue are taken out, exchanging the first message queue with the second message queue, specifically, if it is detected that all scheduling tasks in the first message queue are taken out, exchanging the first message queue with the second message queue by the queue processing module.

3. The task distribution method according to claim 2, wherein the number of the task distribution modules is plural and forms a task distribution module cluster; the task distribution module responding to the task request is one of the task distribution module clusters;

the task distribution system further includes a selection module, and before the task distribution module responds to the task request sent by the task processing module, and the scheduling task called from the preset first message queue through the queue processing module, the selection module further includes:

and the selection module distributes the task request to the task distribution module based on a preset distribution principle.

4. A task distribution method according to claim 3, wherein said distribution principle is a load balancing principle.

5. The task distribution method according to claim 3,

a plurality of task distribution modules in the task distribution module cluster are selected in turn.

6. The task distribution method according to claim 2, wherein the number of the task distribution modules is equal to that of the task processing modules, and the task distribution modules correspond to the task processing modules one to one;

the task distribution module responds to the task request sent by the task processing module and obtains a scheduling task from a preset first message queue through the queue processing module, specifically, the task distribution module responds to the corresponding task request sent by the task processing module and obtains a scheduling task from a preset first message queue through the queue processing module.

7. A task distribution system is characterized by comprising a task distribution module, a task processing module and a queue processing module;

the task distribution module is used for responding to a task request sent by the task processing module and acquiring a scheduling task from a preset first message queue through the queue processing module;

the queue processing module is used for adding the scheduling task to a preset second message queue;

the task processing module is used for processing the scheduling task;

the queue processing module is further configured to interchange the identities of the first message queue and the second message queue if it is detected that all scheduling tasks in the first message queue are taken out.

8. An electronic device comprising a memory and a processor, the memory storing a computer program, the processor executing the program to perform:

responding to a task request, and acquiring a scheduling task from a preset first message queue;

adding the scheduling task into a preset second message queue;

processing the scheduling task;

and if the scheduling tasks in the first message queue are all detected to be taken out, exchanging the first message queue with the second message queue.

9. The electronic device of claim 8, wherein the electronic device comprises a task distribution module, a task processing module, and a queue processing module;

the method for responding to the task request and acquiring a scheduling task from a preset first message queue specifically comprises the following steps: the task distribution module responds to a task request sent by the task processing module and obtains a scheduling task from a preset first message queue through the queue processing module;

the adding the scheduling task to a preset second message queue specifically includes: the queue processing module adds the scheduling task to a preset second message queue;

the step of processing the scheduling task specifically includes that the task processing module processes the scheduling task;

the method further includes, if it is detected that all scheduling tasks in the first message queue are taken out, exchanging identities of the first message queue and the second message queue, specifically, if it is detected that all scheduling tasks in the first message queue are taken out, exchanging identities of the first message queue and the second message queue by the queue processing module.

10. A non-volatile storage medium storing a computer-readable program for causing a computer to execute the task distribution method according to any one of claims 1 to 6.

Images