CN115248817A - Task processing method, apparatus, electronic device and readable storage medium - Google Patents

Abstract

The application relates to the technical field of task processing, and discloses a task processing method, a task processing device, an electronic device and a readable storage medium, wherein the task processing method comprises the following steps: receiving a processing request aiming at a task to be processed, which is sent by a terminal; the processing request carries the repeated sending times of the processing request; if the repeated sending times meet the preset conditions, acquiring a processing result aiming at the task to be processed; and if the processing result is that the task to be processed is successfully processed, returning a processing success status message to the terminal. The task processing method can avoid repeated processing of the tasks to be processed, improve task processing efficiency and save processing resources of the server.

Description

Task processing method, apparatus, electronic device and readable storage medium

technical field

The present application relates to the technical field of task processing, and in particular, the present application relates to a task processing method, apparatus, electronic device, and readable storage medium.

Background technique

With the continuous development of information technology, more and more businesses involve interactive processing, for example, data interaction between systems.

In the current interaction between systems, repeated interactions may occur. For example, the server may have successfully processed the task processing request sent by the terminal, but the terminal may send the task processing request to the server again, causing the server to process the task repeatedly. The task processing efficiency is reduced, and the server processing resources are wasted.

SUMMARY OF THE INVENTION

The purpose of this application is to solve at least one of the above-mentioned technical defects, and the following technical solutions are specially proposed:

In a first aspect, a task processing method is provided, including:

Receiving the processing request sent by the terminal for the task to be processed; the processing request carries the number of repeated transmissions of the processing request;

If the number of repeated sending meets the preset condition, obtain the processing result for the task to be processed;

If the processing result is that the pending task has been successfully processed, a processing success status message is returned to the terminal.

In an optional embodiment of the first aspect, the processing request also carries a unique identification code corresponding to the task to be processed; obtaining a processing result for the task to be processed includes:

Query the processing result for the task to be processed in the preset database based on the unique identification code;

The database stores a unique identification code and a processing result corresponding to each processed task, and each unique identification code is associated with the processing result of the processed task corresponding to the unique identification code.

In an optional embodiment of the first aspect, it also includes:

If any of the following situations occur, the task to be processed is processed:

The number of repeated sending does not meet the preset conditions;

The processing result for the pending task is not obtained;

The processing result obtained for the pending task is unsuccessful processing.

In an optional embodiment of the first aspect, it also includes:

After the to-be-processed task is processed, the unique identification code of the to-be-processed task and the processing result for the to-be-processed task are written into the database to update the database.

In an optional embodiment of the first aspect, it also includes:

If the processing result of the pending task fails to be written into the database, a corresponding status message is returned to the terminal.

In an optional embodiment of the first aspect, the number of times of repeated sending meeting the preset condition includes:

The number of repeated transmissions is greater than the preset number of times.

In a second aspect, a task processing method is provided, including:

Send the processing request for the pending task to the server; the processing request carries the number of repeated sending of the processing request;

The processing success status message returned by the receiving server when the processing result is that the pending task has been processed successfully.

In an optional embodiment of the second aspect, it also includes:

Determines the number of times the processing request for the pending task has been sent, and based on the number of sent times, determines the number of re-sends.

In an optional embodiment of the second aspect, it also includes:

Generate a unique identifier for the pending task and add the unique identifier to the processing request.

In a third aspect, a task processing device is provided, including:

a first receiving module, configured to receive a processing request sent by the terminal for the task to be processed; the processing request carries the number of times of repeated sending of the processing request;

an obtaining module, configured to obtain the processing result for the task to be processed if the number of repeated sending meets the preset condition;

The first returning module is configured to return a processing success status message to the terminal if the processing result is that the to-be-processed task has been successfully processed.

In an optional embodiment of the third aspect, the processing request also carries a unique identification code corresponding to the task to be processed; when the acquisition module acquires the processing result for the task to be processed, it is specifically used for:

Query the processing result for the task to be processed in the preset database based on the unique identification code;

The database stores a unique identification code and a processing result corresponding to each processed task, and each unique identification code is associated with the processing result of the processed task corresponding to the unique identification code.

In an optional embodiment of the third aspect, a processing module is further included, configured to process the to-be-processed task if any of the following situations occurs:

The number of repeated sending does not meet the preset conditions;

The processing result for the pending task is not obtained;

The processing result obtained for the pending task is unsuccessful processing.

In an optional embodiment of the third aspect, a writing module is also included for:

After the to-be-processed task is processed, the unique identification code of the to-be-processed task and the processing result for the to-be-processed task are written into the database to update the database.

In an optional embodiment of the third aspect, a second return module is further included for:

If the processing result of the pending task fails to be written into the database, a corresponding status message is returned to the terminal.

In an optional embodiment of the third aspect, the number of times of repeated sending meeting the preset condition includes:

The number of repeated transmissions is greater than the preset number of times.

In a fourth aspect, a task processing device is provided, including:

The sending module is used to send the processing request for the task to be processed to the server; the processing request carries the number of times of repeated sending of the processing request;

The second receiving module is configured to receive a processing success status message returned by the server when the processing result is that the to-be-processed task has been successfully processed.

In an optional embodiment of the fourth aspect, it further includes a determining module for:

Determines the number of times the processing request for the pending task has been sent, and based on the number of sent times, determines the number of re-sends.

In an optional embodiment of the fourth aspect, a generating module is also included for:

Generate a unique identifier for the pending task and add the unique identifier to the processing request.

In a fifth aspect, an electronic device is provided, including a memory, a processor, and a computer program stored in the memory and running on the processor. The processor implements the task processing method shown in the first aspect of the present application when the processor executes the program.

In a sixth aspect, an electronic device is provided, including a memory, a processor, and a computer program stored in the memory and running on the processor. The processor implements the task processing method shown in the second aspect of the present application when the processor executes the program.

In a seventh aspect, a computer-readable storage medium is provided, where a computer program is stored on the computer-readable storage medium, and when the program is executed by a processor, the task processing method shown in the first aspect of the present application is implemented.

In an eighth aspect, a computer-readable storage medium is provided, where a computer program is stored on the computer-readable storage medium, and when the program is executed by a processor, the task processing method shown in the second aspect of the present application is implemented.

The beneficial effects brought by the technical solution provided by the application are:

The processing request sent by the terminal carries the number of repeated transmissions for the task to be processed. The server combines the number of repeated transmissions and the processing result of the task to be processed to determine whether the current processing is repeated processing. If the number of repeated transmissions meets the preset conditions, and the processing result If it has been successfully processed, the server does not need to process the pending task, and directly returns a successfully processed status message to the terminal, which can avoid repeated processing of pending tasks, improve task processing efficiency, and save server processing resources.

Further, after each task is processed by the server, it obtains the processing result of the task, associates the processing result with the unique identification code of the task, and stores it in a preset database, so as to facilitate the processing of the task to be processed next time. During processing, the corresponding processing result is queried through the unique identification code, so as to improve the query efficiency.

Further, if the processing result fails to be written into the database, the corresponding status message is directly returned to the terminal, so that the terminal can directly receive the corresponding processing result, avoid re-sending the processing request for repeated processing, and further save the processing resources of the server.

Additional aspects and advantages of the present application will be set forth in part in the following description, which will become apparent from the following description, or may be learned by practice of the present application.

Description of drawings

The above and/or additional aspects and advantages of the present application will become apparent and readily understood from the following description of embodiments taken in conjunction with the accompanying drawings, wherein:

1 is an application scenario diagram of a task processing method provided by an embodiment of the present application;

2 is a schematic flowchart of a task processing method provided by an embodiment of the present application;

3 is a schematic diagram of a task processing solution provided by an embodiment of the present application;

4 is a schematic diagram of a task processing solution provided by an example of this application;

5 is a schematic flowchart of a task processing method provided by an embodiment;

FIG. 6 is a schematic structural diagram of a task processing apparatus provided by an embodiment of the present application;

FIG. 7 is a schematic structural diagram of a task processing apparatus provided by an embodiment of the present application;

FIG. 8 is a schematic structural diagram of an electronic device for task processing provided by an embodiment of the present application.

Detailed ways

Embodiments of the present application are described in detail below, examples of which are illustrated in the accompanying drawings, wherein the same or similar reference numerals refer to the same or similar elements or elements having the same or similar functions throughout. The embodiments described below with reference to the accompanying drawings are exemplary and are only used to explain the present application, but not to be construed as a limitation on the present application.

It will be understood by those skilled in the art that the singular forms "a", "an", "the" and "the" as used herein can include the plural forms as well, unless expressly stated otherwise. It should be further understood that the word "comprising" used in the specification of this application refers to the presence of features, integers, steps, operations, elements and/or components, but does not exclude the presence or addition of one or more other features, integers, steps, operations, elements, components and/or groups thereof. It will be understood that when we refer to an element as being "connected" or "coupled" to another element, it can be directly connected or coupled to the other element or intervening elements may also be present. Furthermore, "connected" or "coupled" as used herein may include wirelessly connected or wirelessly coupled. As used herein, the term "and/or" includes all or any element and all combination of one or more of the associated listed items.

In order to make the objectives, technical solutions and advantages of the present application clearer, the embodiments of the present application will be further described in detail below with reference to the accompanying drawings.

The solutions provided by the embodiments of the present application relate to task processing technologies, which are specifically described by the following embodiments.

The technical solutions of the present application and how the technical solutions of the present application solve the above-mentioned technical problems will be described in detail below with specific examples. The following specific embodiments may be combined with each other, and the same or similar concepts or processes may not be repeated in some embodiments. The embodiments of the present application will be described below with reference to the accompanying drawings.

As shown in FIG. 1 , the task processing method of the present application can be applied to the scenario shown in FIG. 1 . Specifically, the terminal 101 determines the number of times of repeated sending of the processing request for the task to be processed, and sends the processing request for the task to be processed. The request is sent to the server 102, and the processing request carries the number of repeated transmissions of the processing request; if the number of repeated transmissions is greater than the preset number, the server 102 obtains the processing result for the task to be processed from the preset database; If the processing result is that the to-be-processed task has been successfully processed, the server 102 returns a processing success status message to the terminal 101 .

In the scenario shown in FIG. 1, the above task processing method can be performed in the terminal and the server. In other scenarios, it can also be performed in the terminal and the terminal, the server and the server, and can also be performed in different software in the same terminal. . For example, terminal A may send a processing request for the to-be-processed task to terminal B, and terminal B processes the to-be-processed task.

Those skilled in the art can understand that the "terminal" used here can be a mobile phone, a tablet computer, a PDA (Personal Digital Assistant, personal digital assistant), MID (Mobile Internet Device, mobile Internet device), etc.; It can be implemented by an independent server or a server cluster composed of multiple servers.

A possible implementation manner is provided in the embodiment of the present application. As shown in FIG. 2 , a task processing method is provided. Taking the method applied to the server shown in FIG. 1 as an example, the following steps may be included:

Step S201, receiving a processing request sent by the terminal for the task to be processed.

The processing request carries the number of times of repeated sending of the processing request.

Among them, the number of repeated sending is the number of times of sending the processing request for the task to be processed for the first time, and the number of redundant sending. For example, if the processing request for the task to be processed is sent 2 times, the number of repeated sending is 1; The processing request of the task is only sent once, and the number of repeated sending is 0.

Specifically, before sending the processing request, the terminal may determine the number of times of sending the task to be processed, and determine the number of times of repeated sending of the processing request according to the number of times that the task to be processed has been sent.

Step S202, if the number of repeated sending times meets a preset condition, obtain a processing result for the to-be-processed task.

In some embodiments, the preset condition may be that the number of repeated sending times is greater than the preset number of times, and the preset number of times may be determined based on the preset number of times the server needs to process the task. For example, if the server only needs to process the task once, then The preset number of times is 0, that is, if the number of repeated transmissions is greater than 0, it is considered that the server has received a processing request once.

Specifically, if the number of repeated transmissions is greater than the preset number of times, it is necessary to determine whether the processing result for the task to be processed is successfully processed.

In other implementations, the preset condition may also be that the number of repeated transmissions is equal to the preset number of times, for example, the preset number of times is 0, as long as the number of repeated transmissions is 0, the server needs to process the task to be processed; as long as the number of repeated transmissions is not 0 0, the service does not need to process the pending task.

Step S203, if the processing result is that the task to be processed has been successfully processed, a processing success status message is returned to the terminal.

Specifically, if the task to be processed has been successfully processed, the server does not need to repeatedly process the task to be processed, and the terminal does not need to repeatedly send a processing request. The server can directly return a processing success status message to the terminal. After the terminal receives the processing success status message , no longer send processing requests for pending tasks to the server.

If the pending task is not successfully processed, the server needs to process the pending task.

The above embodiments will be further described below with reference to examples.

As shown in Figure 3, the server receives the processing request sent by the terminal, and the processing request carries the number of repeated transmissions; the server determines whether the number of repeated transmissions is greater than the preset number of times; if so, it queries the processing result of the task to be processed, and determines whether the processing result is If it has been processed successfully, if it is, return a processing success status message to the terminal; if not, process the task to be processed.

In the above embodiment, the processing request sent by the terminal carries the number of repeated transmissions for the task to be processed, and the server determines whether the current processing is repeated processing based on the number of repeated transmissions and the processing result of the task to be processed, and if the number of repeated transmissions meets the preset value. condition, and the processing result is successfully processed, the server does not need to process the pending task, and directly returns a successfully processed status message to the terminal, which can avoid repeated processing of pending tasks, improve task processing efficiency, and save server processing. resource.

A possible implementation manner is provided in the embodiment of the present application, and the processing request also carries a unique identification code corresponding to the task to be processed; the obtaining of the processing result for the task to be processed in step S202 may include:

Based on the unique identification code, the processing result for the to-be-processed task is queried in the preset database.

The database stores a unique identification code and a processing result corresponding to each processed task, and each unique identification code is associated with the processing result of the processed task corresponding to the unique identification code.

Specifically, after each task is processed by the server, the server obtains the processing result of the task, associates the processing result with the unique identification code of the task, and stores it in a preset database.

For example, UUID (Universally Unique Identifier, Universal Unique Identifier) can be used to represent the unique identifier, and after each task is processed, the UUID is written into the database, such as redis (a distributed memory database), Set the key value (key) to UUID, and set the value of the processing result to 0 or 1. For example, if the processing is successful, the value is set to 0, and if the processing fails, the value is set to 1, so that each processed task is stored in the redis database. UUID and value are used to represent the corresponding unique identification code and the corresponding processing result.

In the above embodiment, after each task is processed by the server, the server obtains the processing result of the task, associates the processing result with the unique identification code of the task, and stores it in a preset database so as to be processed next time. When the task is processed, the corresponding processing result is queried through the unique identification code, which improves the query efficiency.

A possible implementation is provided in the embodiment of the present application, which further includes:

If any of the following situations occur, the task to be processed is processed:

(1) The number of repeated transmissions does not meet the preset conditions;

(2) The processing result for the task to be processed is not obtained;

(3) It is obtained that the processing result for the task to be processed is unsuccessful processing.

Among them, the number of repeated sending does not meet the preset conditions, it may be that the number of repeated sending is less than or equal to the preset number, or the number of repeated sending is not equal to the preset number, then the server needs to process the task to be processed, for example, the preset number of times is 0, the number of repeated sending is 0, and the server has not yet processed the pending task, it needs to be processed.

If the processing result for the to-be-processed task is not queried, the server has not successfully completed the processing of the to-be-processed task, and needs to process the to-be-processed task;

A possible implementation is provided in the embodiment of the present application, which further includes:

After the to-be-processed task is processed, the unique identification code of the to-be-processed task and the processing result for the to-be-processed task are updated and written into the database.

Specifically, after each task is processed by the server, the server obtains the processing result of the task, associates the processing result with the unique identification code of the task, and stores it in a preset database.

If the processing result for the task has been stored in the database, the processing result of this time is updated to the stored result.

For example, the key is UUID stored in the database for task C, and the processing result value is 1, that is, the processing fails; if the processing result is successful this time, the stored processing result value is updated to 1.

A possible implementation is provided in the embodiment of the present application, which further includes:

If the processing result of the pending task fails to be written into the database, a corresponding status message is returned to the terminal.

Wherein, corresponding to different processing results, the status message includes a processing success status message and a processing failure status message; if the processing is successful, a processing success status message is returned; if the processing fails, a processing failure status message is returned.

Specifically, returning a corresponding status message to the terminal may include:

(1) If the task to be processed is successfully processed, a processing success status message is returned to the terminal.

Specifically, if the task to be processed is successfully processed and the processing result of the task to be processed fails to be written into the database, a processing success status message will be returned to the terminal. Even if the corresponding processing result cannot be stored in the database, the terminal will no longer send it. Processing requests to the server for pending tasks.

(2) If the processing of the task to be processed fails, a processing failure status message is returned to the terminal.

Specifically, if the processing of the pending task fails, and the processing result of the pending task fails to be written into the database, a processing failure status message is returned to the terminal. Even if the corresponding processing result cannot be stored in the database, the terminal will re-send it. Processing requests for pending tasks are sent to the server until the pending tasks are processed successfully.

Specifically, the server may also send a writing exception prompt message to the maintenance terminal, or warn the terminal, so as to deal with the current writing exception.

In the above embodiment, if the processing result fails to be written into the database, the corresponding status message is directly returned to the terminal, so that the terminal can directly receive the corresponding processing result, avoid re-sending the processing request for repeated processing, and further save the processing resources of the server.

In order to better understand the above task processing method, as shown in FIG. 4 , an example of the task processing method of the present invention is described in detail below:

In an example, the task processing method provided by this application may include the following steps:

1) The server receives the processing request sent by the client, and the processing request carries the number of times of repeated sending of the processing request for the task to be processed, and the number of repeated sending is represented by the serialld shown in the figure;

2) The server judges whether the repeated sending times is equal to 0, if yes, then enters step 5); if not, then enters step 3);

3) Obtain the processing result of the task to be processed, that is, the value of the corresponding UUID in the query redis database shown in the figure; if it is successfully obtained and the value is 0 (indicating that the task has been successfully processed), then go to step 4); if If the acquisition fails, or the acquired value is not 0 (indicating that the task was not successfully processed), then go to step 5);

4) Return the processing success status message to the client, for example, it can be represented by the status code 200 shown in the figure;

5) Process the tasks to be processed;

6) judge whether the processing of the task to be processed is successful; if so, enter step 7); if not, enter step 9);

7) Write the UUID corresponding to the task to be processed into the redis database, and set the value to 0;

8) If writing to the redis database fails, return a processing success status message to the client, for example, it can be represented by status code 200;

9) Write the UUID corresponding to the task to be processed into the redis database, and set the value to 1;

10) If the writing to the redis database fails, a processing failure status message is returned to the client, for example, it can be represented by status code 500.

In the above task processing method, the processing request sent by the terminal carries the number of repeated transmissions for the task to be processed. If the conditions are set, and the processing result is successfully processed, the server does not need to process the pending task, and directly returns the successfully processed status message to the terminal, which can avoid repeated processing of pending tasks, improve task processing efficiency, and save server time. Process resources.

Further, after each task is processed by the server, it obtains the processing result of the task, associates the processing result with the unique identification code of the task, and stores it in a preset database, so as to facilitate the processing of the task to be processed next time. During processing, the corresponding processing result is queried through the unique identification code, so as to improve the query efficiency.

Further, if the processing result fails to be written into the database, the corresponding status message is directly returned to the terminal, so that the terminal can directly receive the corresponding processing result, avoid re-sending the processing request for repeated processing, and further save the processing resources of the server.

The above embodiments describe the task processing method of the present application from the perspective of the server, and the following describes the task processing method of the present application from the perspective of the terminal.

A possible implementation manner is provided in the embodiment of the present application. As shown in FIG. 5 , a task processing method is provided. Taking the method applied to the terminal shown in FIG. 1 as an example, the following steps may be included:

Step S501, sending a processing request for the to-be-processed task to the server.

The processing request carries the number of times of repeated sending of the processing request.

Specifically, the processing request is used to enable the server to obtain the processing result for the to-be-processed task when the number of repeated sending times is greater than the preset number of times.

Among them, the number of repeated sending is the number of times of sending the processing request for the task to be processed for the first time, and the number of redundant sending. For example, if the processing request for the task to be processed is sent 2 times, the number of repeated sending is 1; The processing request of the task is only sent once, and the number of repeated sending is 0.

Specifically, before sending the processing request, the terminal may determine the number of times of sending the task to be processed, and determine the number of times of repeated sending of the processing request according to the number of times that the task to be processed has been sent.

In some embodiments, the preset condition may be that the number of repeated sending times is greater than the preset number of times, and the preset number of times may be determined based on the preset number of times the server needs to process the task. For example, if the server only needs to process the task once, then The preset number of times is 0, that is, if the number of repeated transmissions is greater than 0, it is considered that the server has received a processing request once.

Specifically, if the number of repeated transmissions is greater than the preset number of times, it is necessary to determine whether the processing result for the task to be processed is successfully processed.

In other implementations, the preset condition may also be that the number of repeated transmissions is equal to the preset number of times, for example, the preset number of times is 0, as long as the number of repeated transmissions is 0, the server needs to process the task to be processed; as long as the number of repeated transmissions is not 0 0, the service does not need to process the pending task.

Step S502, receiving a processing success status message returned by the server when the processing result is that the to-be-processed task has been successfully processed.

Specifically, if the task to be processed has been successfully processed, the server does not need to repeatedly process the task to be processed, and the terminal does not need to repeatedly send a processing request. The server can directly return a processing success status message to the terminal. After the terminal receives the processing success status message , no longer send processing requests for pending tasks to the server.

If the pending task is not successfully processed, the server needs to process the pending task.

A possible implementation manner is provided in the embodiment of the present application. Before sending the processing request for the to-be-processed task to the server in step S501, it may further include:

Determines the number of times the processing request for the pending task has been sent, and based on the number of sent times, determines the number of re-sends.

Specifically, the number of times of sending can be reduced by 1, that is, the number of times of repeated sending can be obtained.

A possible implementation manner is provided in the embodiment of the present application. Before sending the processing request for the to-be-processed task to the server in step S501, it may further include:

Generate a unique identifier for the pending task and add the unique identifier to the processing request.

Specifically, a UUID can be used to represent the unique identification code for the task to be processed.

In the specific implementation process, after processing each task, write the UUID into the database, such as redis (a distributed memory database), set the key value (key) as the UUID, and set the processing result value as 0 or 1, if the processing is successful, the value is set to 0, and if the processing fails, the value is set to 1, so that each processed task stores the corresponding UUID and value in the redis database to indicate the corresponding unique identification code and corresponding processing result.

The task processing method described from the perspective of the terminal in this embodiment corresponds to the task processing method described from the perspective of the server in the above embodiment. Therefore, the details of the task processing method in this embodiment will not be repeated here.

A possible implementation manner is provided in the embodiment of the present application. As shown in FIG. 6, a task processing apparatus 60 is provided. The task processing apparatus 60 may include: a first receiving module 601, an obtaining module 602, and a first returning Module 603, where,

The first receiving module 601 is configured to receive a processing request sent by a terminal for a task to be processed; the processing request carries the number of times of repeated sending of the processing request;

an obtaining module 602, configured to obtain a processing result for the task to be processed if the number of repeated sending times meets a preset condition;

The first returning module 603 is configured to return a processing success status message to the terminal if the processing result is that the to-be-processed task has been successfully processed.

A possible implementation manner is provided in the embodiment of the present application, and the processing request also carries a unique identification code corresponding to the task to be processed; when acquiring the processing result for the task to be processed, the acquiring module 602 is specifically used for:

Query the processing result for the task to be processed in the preset database based on the unique identification code;

The database stores a unique identification code and a processing result corresponding to each processed task, and each unique identification code is associated with the processing result of the processed task corresponding to the unique identification code.

A possible implementation manner is provided in the embodiment of the present application, which further includes a processing module, configured to process the task to be processed if any of the following situations occurs:

The number of repeated sending does not meet the preset conditions;

The processing result for the pending task is not obtained;

The processing result obtained for the pending task is unsuccessful processing.

A possible implementation is provided in the embodiment of the present application, which further includes a writing module for:

After the to-be-processed task is processed, the unique identification code of the to-be-processed task and the processing result for the to-be-processed task are updated and written into the database.

A possible implementation is provided in the embodiment of the present application, which further includes a second return module for:

If the processing result of the pending task fails to be written into the database, a corresponding status message is returned to the terminal.

A possible implementation manner is provided in the embodiment of the present application, and the number of times of repeated transmission meeting the preset condition includes:

The number of repeated transmissions is greater than the preset number of times.

In the above-mentioned task processing device, the processing request sent by the terminal carries the number of repeated transmissions for the task to be processed, and the server determines whether the current processing is repeated processing based on the number of repeated transmissions and the processing result of the task to be processed. If the conditions are set, and the processing result is successfully processed, the server does not need to process the pending task, and directly returns the successfully processed status message to the terminal, which can avoid repeated processing of pending tasks, improve task processing efficiency, and save server time. Process resources.

Further, after each task is processed by the server, it obtains the processing result of the task, associates the processing result with the unique identification code of the task, and stores it in a preset database, so as to facilitate the processing of the task to be processed next time. During processing, the corresponding processing result is queried through the unique identification code, so as to improve the query efficiency.

Further, if the processing result fails to be written into the database, the corresponding status message is directly returned to the terminal, so that the terminal can directly receive the corresponding processing result, avoid re-sending the processing request for repeated processing, and further save the processing resources of the server.

A possible implementation manner is provided in the embodiment of the present application. As shown in FIG. 7 , a task processing apparatus 70 is provided. The task processing apparatus 70 may include: a sending module 701 and a second receiving module 702, wherein,

A sending module 701, configured to send a processing request for the task to be processed to the server; the processing request carries the number of times of repeated sending of the processing request;

The second receiving module 702 is configured to receive a processing success status message returned by the server when the processing result is that the to-be-processed task has been successfully processed.

A possible implementation is provided in the embodiment of the present application, which further includes a determination module for:

Determines the number of times the processing request for the pending task has been sent, and based on the number of sent times, determines the number of re-sends.

A possible implementation is provided in the embodiment of the present application, which further includes a generating module for:

Generate a unique identifier for the pending task and add the unique identifier to the processing request.

The task processing apparatus in the embodiments of the present disclosure can execute a task processing method provided by the embodiments of the present disclosure, and the implementation principle is similar. The actions performed by each module in the task processing apparatus in the embodiments of the present disclosure are the same as Corresponding to the steps in the task processing method in each embodiment of the present disclosure, for the detailed functional description of each module of the task processing apparatus, please refer to the description in the corresponding task processing method shown above, which will not be repeated here. .

Based on the same principles as the methods shown in the embodiments of the present disclosure, the embodiments of the present disclosure also provide an electronic device, which may include but is not limited to: a processor and a memory; a memory for storing a computer An operation instruction; a processor, configured to execute the task processing method shown in the embodiment by invoking the computer operation instruction. Compared with the prior art, the task processing method in the present application can avoid repeated processing of tasks to be processed, improve task processing efficiency, and save processing resources of the server at the same time.

In an optional embodiment, an electronic device is provided. As shown in FIG. 8 , the electronic device 4000 shown in FIG. 8 includes: a processor 4001 and a memory 4003 . The processor 4001 is connected to the memory 4003, for example, through the bus 4002. Optionally, the electronic device 4000 may also include a transceiver 4004 . It should be noted that, in practical applications, the transceiver 4004 is not limited to one, and the structure of the electronic device 4000 does not constitute a limitation to the embodiments of the present application.

The processor 4001 may be a CPU (Central Processing Unit, central processing unit), a general-purpose processor, a DSP (Digital Signal Processor, data signal processor), an ASIC (Application Specific Integrated Circuit, an application-specific integrated circuit), an FPGA (Field Programmable Gate Array, Field Programmable Gate Array) or other programmable logic devices, transistor logic devices, hardware components, or any combination thereof. It may implement or execute the various exemplary logical blocks, modules and circuits described in connection with this disclosure. The processor 4001 may also be a combination for realizing computing functions, such as a combination of one or more microprocessors, a combination of a DSP and a microprocessor, and the like.

The bus 4002 may include a path to transfer information between the components described above. The bus 4002 may be a PCI (Peripheral Component Interconnect, Peripheral Component Interconnect Standard) bus or an EISA (Extended Industry Standard Architecture, Extended Industry Standard Architecture) bus or the like. The bus 4002 can be divided into an address bus, a data bus, a control bus, and the like. For ease of presentation, only one thick line is used in FIG. 8, but it does not mean that there is only one bus or one type of bus.

The memory 4003 can be a ROM (Read Only Memory, read only memory) or other types of static storage devices that can store static information and instructions, a RAM (Random Access Memory, random access memory) or other types that can store information and instructions. A dynamic storage device can also be an EEPROM (Electrically Erasable Programmable Read Only Memory), a CD-ROM (Compact Disc Read Only Memory, a CD-ROM) or other CD-ROM storage, CD-ROM storage (including compressed CDs, Laser Disc, Optical Disc, Digital Versatile Disc, Blu-ray Disc, etc.), magnetic disk storage medium or other magnetic storage device, or any other capable of carrying or storing desired program code in the form of instructions or data structures and capable of being accessed by a computer medium, but not limited to this.

The memory 4003 is used for storing the application program code for executing the solution of the present application, and the execution is controlled by the processor 4001 . The processor 4001 is configured to execute the application program code stored in the memory 4003 to implement the content shown in the foregoing method embodiments.

Among them, electronic devices include but are not limited to: mobile phones, notebook computers, digital broadcast receivers, PDAs (personal digital assistants), PADs (tablet computers), PMPs (portable multimedia players), in-vehicle terminals (such as in-vehicle navigation terminals), etc. Mobile terminals such as digital TVs, desktop computers, etc., as well as stationary terminals. The electronic device shown in FIG. 8 is only an example, and should not impose any limitation on the function and scope of use of the embodiments of the present disclosure.

Embodiments of the present application provide a computer-readable storage medium, where a computer program is stored on the computer-readable storage medium, and when the computer program runs on the computer, the computer can execute the corresponding content in the foregoing method embodiments. Compared with the prior art, the task processing method in the present application can avoid repeated processing of tasks to be processed, improve task processing efficiency, and save processing resources of the server at the same time.

It should be understood that although the various steps in the flowchart of the accompanying drawings are sequentially shown in the order indicated by the arrows, these steps are not necessarily executed in sequence in the order indicated by the arrows. Unless explicitly stated herein, the execution of these steps is not strictly limited to the order and may be performed in other orders. Moreover, at least a part of the steps in the flowchart of the accompanying drawings may include multiple sub-steps or multiple stages, and these sub-steps or stages are not necessarily executed at the same time, but may be executed at different times, and the execution sequence is also It does not have to be performed sequentially, but may be performed alternately or alternately with other steps or at least a portion of sub-steps or stages of other steps.

It should be noted that the computer-readable medium mentioned above in the present disclosure may be a computer-readable signal medium or a computer-readable storage medium, or any combination of the above two. The computer-readable storage medium can be, for example, but not limited to, an electrical, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus or device, or a combination of any of the above. More specific examples of computer readable storage media may include, but are not limited to, electrical connections with one or more wires, portable computer disks, hard disks, random access memory (RAM), read only memory (ROM), erasable Programmable read only memory (EPROM or flash memory), fiber optics, portable compact disk read only memory (CD-ROM), optical storage devices, magnetic storage devices, or any suitable combination of the foregoing. In this disclosure, a computer-readable storage medium may be any tangible medium that contains or stores a program that can be used by or in conjunction with an instruction execution system, apparatus, or device. In the present disclosure, however, a computer-readable signal medium may include a data signal propagated in baseband or as part of a carrier wave with computer-readable program code embodied thereon. Such propagated data signals may take a variety of forms, including but not limited to electromagnetic signals, optical signals, or any suitable combination of the foregoing. A computer-readable signal medium can also be any computer-readable medium other than a computer-readable storage medium that can transmit, propagate, or transport the program for use by or in connection with the instruction execution system, apparatus, or device . Program code embodied on a computer readable medium may be transmitted using any suitable medium including, but not limited to, electrical wire, optical fiber cable, RF (radio frequency), etc., or any suitable combination of the foregoing.

The above-mentioned computer-readable medium may be included in the above-mentioned electronic device; or may exist alone without being assembled into the electronic device.

The aforementioned computer-readable medium carries one or more programs, and when the aforementioned one or more programs are executed by the electronic device, causes the electronic device to execute the methods shown in the foregoing embodiments.

Embodiments of the present application provide a computer program product or computer program, where the computer program product or computer program includes computer instructions, and the computer instructions are stored in a computer-readable storage medium. The processor of the computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that when the computer device executes, the following conditions are realized:

receiving a processing request for the task to be processed sent by the terminal; the processing request carries the number of times of repeated sending of the processing request;

If the number of times of repeated sending meets a preset condition, obtaining a processing result for the to-be-processed task;

If the processing result is that the to-be-processed task has been successfully processed, a processing success status message is returned to the terminal.

Embodiments of the present application provide a computer program product or computer program, where the computer program product or computer program includes computer instructions, and the computer instructions are stored in a computer-readable storage medium. The processor of the computer device reads the computer instructions from the computer-readable storage medium, and the processor executes the computer instructions, so that when the computer device executes, the following conditions are realized:

Send a processing request for the task to be processed to the server; the processing request carries the number of times of repeated sending of the processing request;

Receive a processing success status message returned by the server when the processing result is that the to-be-processed task has been successfully processed.

Computer program code for carrying out operations of the present disclosure may be written in one or more programming languages, including object-oriented programming languages—such as Java, Smalltalk, C++, but also conventional Procedural programming language - such as the "C" language or similar programming language. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer, or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a local area network (LAN) or a wide area network (WAN), or may be connected to an external computer (eg, using an Internet service provider through Internet connection).

The flowchart and block diagrams in the Figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code that contains one or more logical functions for implementing the specified functions executable instructions. It should also be noted that, in some alternative implementations, the functions noted in the blocks may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It is also noted that each block of the block diagrams and/or flowchart illustrations, and combinations of blocks in the block diagrams and/or flowchart illustrations, can be implemented in dedicated hardware-based systems that perform the specified functions or operations , or can be implemented in a combination of dedicated hardware and computer instructions.

The modules involved in the embodiments of the present disclosure may be implemented in software or hardware. Wherein, the name of the module does not constitute a limitation of the module itself under certain circumstances, for example, the first receiving module may also be described as "a module for receiving processing requests".

The above description is merely a preferred embodiment of the present disclosure and an illustration of the technical principles employed. Those skilled in the art should understand that the scope of the disclosure involved in the present disclosure is not limited to the technical solutions formed by the specific combination of the above-mentioned technical features, and should also cover, without departing from the above-mentioned disclosed concept, the technical solutions formed by the above-mentioned technical features or Other technical solutions formed by any combination of its equivalent features. For example, a technical solution is formed by replacing the above features with the technical features disclosed in the present disclosure (but not limited to) with similar functions.

Claims (13)

1. a task processing method, is characterized in that, comprises: receiving a processing request for the task to be processed sent by the terminal; the processing request carries the number of times of repeated sending of the processing request; If the number of times of repeated sending meets a preset condition, obtaining a processing result for the to-be-processed task; If the processing result is that the to-be-processed task has been successfully processed, a processing success status message is returned to the terminal. 2. The task processing method according to claim 1, wherein the processing request also carries a unique identification code corresponding to the task to be processed; the acquisition of the processing result for the task to be processed, include: query the processing result for the to-be-processed task in a preset database based on the unique identification code; Wherein, the database stores a unique identification code and a processing result corresponding to each processed task, and each unique identification code is associated with the processing result of the processed task corresponding to the unique identification code. 3. task processing method according to claim 1, is characterized in that, also comprises: If any of the following situations occurs, the to-be-processed task is processed: The number of repeated transmissions does not meet the preset condition; The processing result for the task to be processed is not obtained; The acquired processing result for the to-be-processed task is unsuccessful processing. 4. task processing method according to claim 3, is characterized in that, also comprises: After the to-be-processed task is processed, the unique identification code of the to-be-processed task and the processing result for the to-be-processed task are written into the database to update the database. 5. task processing method according to claim 4, is characterized in that, also comprises: If the processing result of the task to be processed fails to be written into the database, a corresponding status message is returned to the terminal. 6. The task processing method according to claim 1, wherein the repeated sending times conforming to a preset condition comprises: The number of repeated transmissions is greater than the preset number of times. 7. A task processing method, comprising: Send a processing request for the task to be processed to the server; the processing request carries the number of times of repeated sending of the processing request; Receive a processing success status message returned by the server when the processing result is that the to-be-processed task has been successfully processed. 8. The task processing method according to claim 7, wherein before the sending the processing request for the task to be processed to the server, the method further comprises: The number of times the processing request for the task to be processed has been sent is determined, and the number of times of repeated sending is determined based on the number of times of sending. 9. The task processing method according to claim 7, wherein before the sending the processing request for the task to be processed to the server, the method further comprises: A unique identification code for the task to be processed is generated, and the unique identification code is added to the processing request. 10. A task processing device, comprising: a first receiving module, configured to receive a processing request sent by a terminal for a task to be processed; the processing request carries the number of times of repeated sending of the processing request; an obtaining module, configured to obtain a processing result for the task to be processed if the number of times of repeated sending meets a preset condition; The returning module is configured to return a processing success status message to the terminal if the processing result is that the to-be-processed task has been successfully processed. 11. A task processing device, comprising: a sending module, configured to send a processing request for the task to be processed to the server; the processing request carries the number of times of repeated sending of the processing request; The second receiving module is configured to receive a processing success status message returned by the server when the processing result is that the to-be-processed task has been successfully processed. 12. An electronic device comprising a memory, a processor and a computer program stored on the memory and running on the processor, wherein the processor implements any one of claims 1-9 when executing the program The described task processing method. 13. A computer-readable storage medium, wherein a computer program is stored on the computer-readable storage medium, and when the program is executed by a processor, the task processing method according to any one of claims 1-9 is implemented.

Images