CN112905314A

CN112905314A - Asynchronous processing method and device, electronic equipment, storage medium and road side equipment

Info

Publication number: CN112905314A
Application number: CN202110111209.5A
Authority: CN
Inventors: 张建军
Original assignee: Beijing Baidu Netcom Science and Technology Co Ltd
Current assignee: Apollo Zhilian Beijing Technology Co Ltd
Priority date: 2021-01-27
Filing date: 2021-01-27
Publication date: 2021-06-04

Abstract

The application discloses an asynchronous processing method, an asynchronous processing device, electronic equipment, a storage medium, roadside equipment and a cloud control platform, and relates to information flow, artificial intelligence and automatic driving in the computer and data processing technology. The method comprises the following steps: the method comprises the steps of obtaining a plurality of tasks to be executed, distributing task identifiers for each task to be executed, executing the plurality of tasks to be executed by adopting a plurality of threads, obtaining a target task execution result which is corresponding to a target task to be executed and carries the target task identifier if any thread finishes executing the target task to be executed, executing one task to be executed by one thread, obtaining target expiration time information of the target task to be executed, generating an asynchronous processing result of the target task to be executed according to the target task execution result and the target expiration time information, and outputting the asynchronous processing result by combining the expiration time information, so that the richness, diversity and reliability of the output asynchronous processing result can be improved.

Description

Asynchronous processing method and device, electronic equipment, storage medium and road side equipment

Technical Field

The present application relates to information flow, artificial intelligence, and automatic driving in computer and data processing technologies, and in particular, to an asynchronous processing method, an asynchronous processing device, an electronic device, a storage medium, a roadside device, and a cloud control platform.

Background

The processing mode of the task may include a synchronous processing mode and an asynchronous processing mode, the synchronous processing mode may be understood as a communication mode in which the sender sends data and then sends the next data after the receiver sends a response back, and the asynchronous processing mode may be understood as a communication mode in which the sender sends data and then sends the next data after the receiver does not send a response back.

In the prior art, the asynchronous processing mode is generally implemented by the following method: asynchronous processing is realized by adopting a mode of matching a task queue and a thread pool, and the output of an asynchronous processing result is usually realized by adopting a mode of writing code programs such as semaphores or condition variables.

However, the way of writing a code program may cause problems of relatively great difficulty and high complexity.

Disclosure of Invention

The application provides an asynchronous processing method and device for reducing complexity of asynchronous processing, electronic equipment, storage media, roadside equipment and a cloud control platform.

According to a first aspect of the present application, there is provided an asynchronous processing method, including:

acquiring a plurality of tasks to be executed, and allocating a task identifier to each task to be executed;

executing a plurality of tasks to be executed by adopting a plurality of threads, and obtaining a target task execution result which is corresponding to a target task to be executed and carries a target task identifier if any thread finishes executing the target task to be executed, wherein one task to be executed is executed by one thread;

acquiring target time-out information of the target task to be executed;

and generating an asynchronous processing result of the target task to be executed according to the target task execution result and the target expiration time information.

According to a second aspect of the present application, there is provided an asynchronous processing apparatus comprising:

the system comprises a first acquisition unit, a second acquisition unit and a processing unit, wherein the first acquisition unit is used for acquiring a plurality of tasks to be executed;

the distribution unit is used for distributing task identifiers for each task to be executed;

the execution unit is used for executing a plurality of tasks to be executed by adopting a plurality of threads, and obtaining a target task execution result which is corresponding to the target task to be executed and carries a target task identifier if any thread finishes executing the target task to be executed, wherein one task to be executed is executed by one thread;

the second acquisition unit is used for acquiring target overdue time information of the target task to be executed;

and the generating unit is used for generating an asynchronous processing result of the target task to be executed according to the target task execution result and the target timeout information.

According to a third aspect of the present application, there is provided an electronic device comprising:

at least one processor; and

a memory communicatively coupled to the at least one processor; wherein the content of the first and second substances,

the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of the first aspect as described above.

According to a fourth aspect of the present application, there is provided a non-transitory computer readable storage medium having stored thereon computer instructions for causing the computer to perform the method of the first aspect.

According to a fifth aspect of the present application, there is provided a computer program product comprising: a computer program, stored in a readable storage medium, from which at least one processor of an electronic device can read the computer program, execution of the computer program by the at least one processor causing the electronic device to perform the method of the first aspect.

According to a sixth aspect of the present application, there is provided a roadside apparatus including the electronic apparatus as described in the third aspect above.

According to a seventh aspect of the present application, there is provided a cloud control platform including the electronic device according to the third aspect.

It should be understood that the statements in this section do not necessarily identify key or critical features of the embodiments of the present application, nor do they limit the scope of the present application. Other features of the present application will become apparent from the following description.

Drawings

The drawings are included to provide a better understanding of the present solution and are not intended to limit the present application. Wherein:

FIG. 1 is a schematic diagram according to a first embodiment of the present application;

FIG. 2 is a schematic diagram according to a second embodiment of the present application;

FIG. 3 is a schematic illustration according to a third embodiment of the present application;

FIG. 4 is a schematic illustration of a first list according to the present application;

FIG. 5 is a scene diagram of an asynchronous processing method that can implement the embodiments of the present application

FIG. 6 is a schematic illustration according to a fourth embodiment of the present application;

FIG. 7 is a schematic illustration according to a fifth embodiment of the present application;

FIG. 8 is a schematic illustration according to a sixth embodiment of the present application;

fig. 9 is a block diagram of an electronic device for implementing the asynchronous processing method of the embodiment of the present application.

Detailed Description

The following description of the exemplary embodiments of the present application, taken in conjunction with the accompanying drawings, includes various details of the embodiments of the application for the understanding of the same, which are to be considered exemplary only. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the present application. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.

The application provides an asynchronous processing method, an asynchronous processing device, electronic equipment, a storage medium, roadside equipment and a cloud control platform, which are applied to information flow, artificial intelligence and automatic driving in the technical field of computers and data processing, so that the complexity of asynchronous processing is improved and reduced.

Fig. 1 is a schematic diagram according to a first embodiment of the present application, and as shown in fig. 1, an asynchronous processing method according to the embodiment of the present application may include:

s101: and acquiring a plurality of tasks to be executed.

For example, the execution main body of this embodiment may be an asynchronous processing device, where the asynchronous processing device may be a server (including a cloud server and a local server), a computer, a terminal device, a processor, a chip, and the like, and this embodiment is not limited.

In one example, the task to be executed acquired by the asynchronous processing device may be an execution request sent by the external device.

For example, the external device may be a user equipment, the asynchronous processing device may be a server, and the asynchronous processing device may receive a task to be executed sent by the user equipment, where the task to be executed may be, for example, a task of opening an application program. To open the application, the server may need to execute a plurality of tasks to be executed, for example, taking the application as a communication application, the plurality of tasks to be executed may include: a task of acquiring contact information, a task of acquiring historical communication records and the like.

The asynchronous processing device and the external device can be in wired connection or in wireless connection.

In another example, the task to be executed acquired by the asynchronous processing device may be an execution request actively triggered by the asynchronous processing device.

For example, the asynchronous processing device may be used to support system update of the external device, and the asynchronous processing device may generate a task to be executed periodically or aperiodically and execute the task to be executed, thereby completing update of the system of the external device.

Specifically, the asynchronous processing device may be a vehicle-road cooperative management platform, a central subsystem, an edge computing platform, a roadside device, and the like, and taking the roadside device as an example, the roadside device may communicate with the vehicle and complete updating of an automatic driving control system of the vehicle.

In a system architecture of intelligent transportation vehicle-road cooperation, the road side equipment comprises road side sensing equipment with a computing function and road side computing equipment connected with the road side sensing equipment, the road side sensing equipment (such as a road side camera) is connected to the road side computing equipment (such as a Road Side Computing Unit (RSCU)), the road side computing equipment is connected to a server, and the server can communicate with an automatic driving vehicle or an auxiliary driving vehicle in various modes; or the roadside sensing device comprises a calculation function, and the roadside sensing device is directly connected to the server. The above connections may be wired or wireless.

S102: and allocating a task identifier for each task to be executed.

In this embodiment, each task to be executed has a task identifier, and the task identifier may be used to distinguish different tasks to be executed.

S103: and executing a plurality of tasks to be executed by adopting a plurality of threads, and obtaining a target task execution result which corresponds to the target task to be executed and carries the target task identifier if any thread finishes executing the target task to be executed.

Wherein a task to be executed is executed by a thread.

For example, a thread may be run in the asynchronous processing device, and the thread may execute a task to be executed to obtain a task execution result.

That is, in this embodiment, the asynchronous processing device may execute one or more tasks to be executed through a thread, and obtain a corresponding task execution result.

It should be noted that, in this embodiment, the asynchronous processing apparatus does not need to wait for the previous thread to complete the task to be executed, and then execute another task to be executed by using the next thread.

For example, the asynchronous processing device executes the task a to be executed by using the thread 1, and can continue to execute the task b to be executed by using the thread 2 without waiting until the thread 1 executes the task a to be executed, and so on.

In this embodiment, each task execution result may carry a task identifier of a corresponding task to be executed. For example, if the target task identifier of the target task a to be executed is a ', and the target task execution result of the target task a to be executed is the target task execution result a, the target task execution result a carries the target task identifier a'.

The target task to be executed is any one of a plurality of tasks to be executed.

S104: and acquiring target overdue time information of the target task to be executed.

By way of example, the expiration time information may be understood as information exceeding a feedback time of a task execution result of the task to be executed.

For example, if the preset time for executing the task a to be executed to obtain the task execution result A is T1, T2 may be set as the expiration time information of the task a to be executed, and T2 ≧ T1.

S105: and generating an asynchronous processing result of the target task to be executed according to the target task execution result and the target time-out information.

Based on the above analysis, the present embodiment provides an asynchronous processing method, which includes: the method comprises the steps of obtaining a plurality of tasks to be executed, allocating task identifiers to each task to be executed, executing the tasks to be executed by adopting a plurality of threads, obtaining a target task execution result which is corresponding to a target task execution task and carries the target task identifier if any thread finishes executing the target task to be executed, wherein one task to be executed is executed by one thread, obtaining target expiration time information of the target task to be executed, and generating an asynchronous processing result of the target task to be executed according to the target task execution result and the target expiration time information. And the target expiration time information is combined to generate the asynchronous processing result, so that the richness and diversity of the generated asynchronous processing result can be improved, and the accuracy and reliability of the asynchronous processing result can be improved.

Fig. 2 is a schematic diagram according to a second embodiment of the present application, and as shown in fig. 2, an asynchronous processing method according to the embodiment of the present application may include:

s201: and acquiring a plurality of tasks to be executed.

For example, the description about S201 may refer to S101, and is not described herein again.

S202: and allocating a task identifier for each task to be executed and generating a second list comprising each task to be executed.

Exemplarily, the second list may be understood as a thread security task queue, where the thread security task queue includes each task to be executed, and in the thread security task queue, the task identifier allocated by the asynchronous processing device to the task a to be executed is task _ id _1, the task identifier allocated to the task b to be executed is task _ id _2, and so on, which is not listed here one by one.

S203: a first list is constructed that includes expiration time information for a first task to be performed.

In some embodiments, S203 may include the steps of:

step 1: and determining the expiration time information of each task to be executed.

For example, the description about the information of the expiration time may refer to the above embodiments, and will not be described herein.

Step 2: and constructing a hash mapping table comprising the task identifier and the expiration time information of each task to be executed.

Wherein the first list comprises a hash mapping table.

It should be noted that, in this embodiment, by constructing the hash mapping table, when the expiration time information of each task to be executed is determined based on the hash mapping table in the following, the technical effect of improving the efficiency of determining the expiration time information of the task to be executed can be improved.

For example, the hash mapping table may be used to represent a mapping relationship between the task identifier and the expiration time information, and accordingly, the asynchronous processing device may construct, for each to-be-executed task, the hash mapping table that represents a mapping relationship between the identifier of each to-be-executed task and the expiration time information, and if the asynchronous processing device determines the task identifier of a certain to-be-executed task, the expiration time information corresponding to the task identifier may be determined based on the mapping relationship.

It should be noted that, in this embodiment, the mapping relationship between the task identifier and the expiration time information is represented by the hash mapping table, so that a technical effect of conveniently and quickly determining the expiration time information corresponding to the task identifier based on the mapping relationship can be achieved.

S204: and executing a plurality of tasks to be executed by adopting a plurality of threads, acquiring and executing a plurality of tasks to be executed from the second list, and obtaining a target task execution result which corresponds to the target task to be executed and carries the target task identifier if any thread finishes executing the target task to be executed.

In some embodiments, the second list is a first-in first-out task list, and accordingly, the thread may sequentially extract and execute the tasks to be executed from the second list, and obtain task execution results corresponding to the executed tasks.

It should be noted that, in the present embodiment, by extracting and executing the tasks to be executed on a first-in first-out basis, the technical effects of the order and reliability of the execution of each task to be executed can be improved.

In some embodiments, the asynchronous processing device may bind a target task execution result of the target to-be-executed task and a target task identifier of the target to-be-executed task, so that the target task execution result carries the target task identifier of the target to-be-executed task corresponding to the target task execution result.

It is worth to say that the target task execution result and the target task identifier are combined in a binding mode, so that the target task execution result and the target task identifier can be conveniently and quickly combined, and the technical effects of improving the accuracy and reliability of output when the target task execution result is fed back can be achieved.

In some embodiments, the number of the threads may be multiple, and the number of the tasks to be executed may also be multiple, and when the number of the threads is multiple and the number of the tasks to be executed is also multiple, the asynchronous processing device may divide different tasks to be executed into different threads based on the task identifier, and may conveniently synchronize the task execution result of the corresponding task to be executed by using the task identifier.

In some embodiments, a thread pool may be constructed by the asynchronous processing device and the asynchronous processing results generated and output in conjunction with the thread pool. The thread in the thread pool can actively pull the task to be executed in the second list, and can be in a dormant state after the execution is finished, and the thread is awakened when waiting for the task to be executed, so that the technical effect of reasonably utilizing thread resources is realized.

S205: and inquiring target time-out information of the target task to be executed from the first list according to the target task identifier.

By combining the above analysis, it can be known that the first list includes the expiration time information of each task to be executed, and after the asynchronous processing device determines the target task execution result, the asynchronous processing device may query the first list to obtain the target expiration time information of the target task to be executed.

It should be noted that, in this embodiment, by setting a first list storing the expiration time information of different tasks to be executed and determining the expiration time information of each task to be executed in combination with the first list, the technical effect of quickly and conveniently determining the expiration time information of each task to be executed can be achieved.

In conjunction with the above analysis, if a hash mapping table may be included in the first list, and the hash mapping table may be used to characterize a mapping relationship between the task identifier and the expiration time information, then in some embodiments, S205 may include: and inquiring target time-out information of the target task to be executed from the hash mapping table according to the target task identifier.

For example, if the target task identifier is task _ id _1, the target task identifier task _ id _1 may be obtained by querying from the hash mapping table based on the target task identifier task _ id _1, and the target timeout time information corresponding to the target task identifier task _ id _1 is determined according to the mapping relationship.

It should be noted that, in this embodiment, the target task execution result carries the target task identifier, so that the target task identifier carried by the target task execution result is obtained from the hash mapping table, and the target expiration time information corresponding to the target task identifier can improve the technical effects of convenience, accuracy, and reliability of determining the expiration time information.

S206: and generating an asynchronous processing result of the target task to be executed according to the target task execution result and the target time-out information.

In an example, the description about S206 may refer to the description about S104, and is not repeated here.

In another example, S206 may include the steps of:

step 1: determining the type of the target task to be executed according to the target timeout information of the target task to be executed, wherein the type of the target task to be executed comprises the following steps: an expiration type and a normal type.

As understood in conjunction with the expiration time information in the above example, in the present embodiment, for the target task to be executed, the asynchronous processing device may determine that the target task to be executed is of an expiration type or a normal type based on the expiration time information of the target task to be executed.

For example, for a target task a to be executed, if the target timeout time information of the target task a to be executed, which is acquired by the asynchronous processing device, is Ta, and the asynchronous processing device determines that the time for the thread to execute the target task a to be executed is T (a + x), and x is a positive number greater than 0, the asynchronous processing device may determine that the type of the target task a to be executed is a timeout type; on the contrary, if the asynchronous processing device determines that the time for the thread to execute the target task a is less than Ta, the asynchronous processing device may determine that the type of the target task a to be executed is a normal type.

Step 2: and generating an asynchronous processing result of the target task to be executed according to the execution result of the target task and the type of the target task to be executed.

It should be noted that, in this embodiment, the asynchronous processing result generated by the asynchronous processing apparatus includes two dimensions of content, where the content in one dimension is the task execution result, and the content in the other dimension is the type of the task to be executed, so that the diversity and richness of the asynchronous processing result can be improved, and the accuracy and reliability of the asynchronous processing result can be improved.

In some embodiments, step 2 may include the following sub-steps:

substep 1: and filling parameters of the preset callback function according to the target task execution result and the type of the target task to be executed to obtain the filled callback function.

Illustratively, the parameters of the callback function include: correspondingly, if the target task a is targeted, the asynchronous processing device may fill the target task identifier with task _ id _1, may fill the task type of the target task a to be executed with 1 or 0 (where 1 may represent an overdue type, and 0 may represent a normal type), and may fill the target task execution result (such as an obtained result of the communication record).

Substep 2: and determining and outputting an asynchronous processing result according to the filled callback function.

It should be noted that, in this embodiment, the parameter of the callback function is filled, so as to generate the asynchronous processing result of the target task to be executed based on the filled callback function, since the parameter of the filled callback function includes the task identifier, the accuracy and reliability of outputting the asynchronous processing result can be achieved, and since the parameter of the filled callback function includes the task type, the technical effect of diversity and richness of the content of the asynchronous processing result can be improved.

Fig. 3 is a schematic diagram according to a third embodiment of the present application, and as shown in fig. 3, an asynchronous processing method according to the embodiment of the present application may include:

s301: and acquiring a plurality of tasks to be executed.

For example, the description about S301 may refer to S101, which is not described herein again.

S302: a first list is constructed that includes a hash map table and a linked list.

For example, fig. 4 is a schematic diagram of a first list in the embodiment of the present application, and as shown in fig. 4, the first list may include a linked list and a hash mapping table, and a method for constructing the first list including the linked list and the hash mapping table may specifically include the following steps:

step 1: and allocating a task identifier for each task to be executed, and determining the corresponding time-out information of each task to be executed.

Step 2: and encapsulating each task to be executed based on each task to be executed identifier and the expiration time information to obtain a task encapsulation structure.

Illustratively, the task wrapper structure includes two dimensions of content, where the content of one dimension is a task identifier, the content of the other dimension is expiration time information, and the expiration time information may be represented by a hash value obtained by performing a hash calculation on the expiration time.

And step 3: and constructing a linked list comprising the task identifier of each task to be executed according to the task encapsulation structure. The structure of the linked list can be seen in fig. 4.

And 4, step 4: and constructing a hash mapping table comprising a hash mapping relation according to the task packaging structure. The structure of the hash mapping table can also refer to fig. 4.

In some embodiments, the hash map may store the task identifier and the expiration time information in a key-value pair (key-value) storage manner. Wherein, the key may be a task identifier, and the value may be expiration time information.

The asynchronous processing device can realize the increase and decrease of keys. And when the environment is a multi-thread environment, the asynchronous processing device can adopt a mutual exclusion lock protection mode to ensure the safety of each thread.

That is to say, in this embodiment, the first list may include contents of two dimensions, the content of one dimension is a hash mapping table, the content of the other dimension is a linked list, the hash mapping table may represent a mapping relationship between the task identifier and the expiration time information, and the linked list may represent the task identifier of the task to be executed.

S303: and traversing the task identifier of each task to be executed in the linked list based on a preset time interval.

Exemplarily, in conjunction with the first list as shown in fig. 4, the asynchronous processing device may traverse the task _ id _1 to the task _ id _ n based on a preset time interval.

The preset time interval may be set by the asynchronous processing device based on a requirement, a history, a test, and the like, which is not limited in this embodiment.

In some embodiments, the asynchronous processing device may set a timer and may poll for expired tasks to be performed based on the timer.

S304: and determining the time information of the overdue time of each task to be executed according to the task identifier of each task to be executed in the linked list.

In some embodiments, S304 may specifically include: and determining a task identifier which is the same as the task identifier of each task to be executed in the linked list in the hash mapping table, and determining the expiration time information which is corresponding to the task identifier which is the same as the task identifier of each task to be executed in the linked list in the hash mapping table from the hash mapping table.

Illustratively, in combination with the first list shown in fig. 4, taking the task id as task _ id _1 in the linked list as an example, the asynchronous processing device obtains the task _ id _1 from the hash mapping table, and obtains the expiration time information 1606897969 having a hash mapping relationship with the task _ id _1 from the hash mapping table.

It should be noted that, in this embodiment, by determining the expiration time information by combining the hash mapping table and the linked list, the technical effects of accuracy and reliability of the determined expiration time information can be improved.

S305: and determining the type of each task to be executed according to the information of the time out of date of each task to be executed.

Wherein, the type of each task to be executed comprises: an expiration type and a normal type.

For example, the description about the expiration type and the normal type may refer to the above embodiments, and details are not repeated here.

S306: and if the type of any task to be executed in each task to be executed is the overdue exception, generating an asynchronous processing result of any task to be executed based on the task identifier of any task to be executed and the type of any task to be executed.

Illustratively, the asynchronous processing device may sequentially traverse based on the linked list, for example, in combination with the schematic diagram of the linked list shown in fig. 4, the asynchronous processing device traverses the linked list to obtain a task identifier taskid _1, and obtains expiration time information 1606897469 having a mapping relationship with taskid _1 from the hash mapping table based on the taskid _1, and determines whether the task to be executed is an expiration type or a normal type based on the expiration time information, and if the type of the task to be executed is an expiration type, the asynchronous processing device may generate an asynchronous processing result of any task to be executed based on the task identifier taskid _1 and the expiration type; on the contrary, if the type of the task to be executed is the normal type, the asynchronous processing device may continue to traverse the next task to be executed, such as the task to be executed of the task identification task _ id _2 in the linked list, and the task identification task _ id _2 obtains the timeout time information having a mapping relationship with the task _ id _2 from the hash mapping table, and so on, which is not described herein one by one until the task identification task _ id _ n is traversed, and then start the next round of traversal.

It should be noted that, in this embodiment, by combining the linked list and the hash mapping table to generate the asynchronous processing result, time for traversing the hash mapping table can be saved, and efficiency for querying the linked list can be increased, thereby achieving technical effects of generating the asynchronous processing result and saving time resources.

In some embodiments, regarding the implementation principle that the asynchronous processing device generates the asynchronous processing result of any task to be executed based on the task identifier of any task to be executed and the type of any task to be executed, reference may be made to the description of S206 above, and details are not described here.

It should be noted that the second embodiment and the third embodiment may be combined into a new embodiment, for example, the asynchronous processing device may generate and output the asynchronous processing result based on the task execution result of the thread and the mode of the periodic query, and the implementation principles thereof do not interfere with each other, and are not described herein again.

It should be noted that the asynchronous processing method of this embodiment may be applied to a scene of interaction between two different devices, such as a scene of interaction between an upper computer and a lower computer, and may also be applied to a scene of execution of tasks such as update in a program of an asynchronous processing apparatus.

For example, the asynchronous processing method of the present embodiment may be applied to an application scenario as shown in fig. 5, where fig. 5 is an interaction scenario between two different devices.

As shown in fig. 5, a client of a communication application is provided in the user device 501, and the user 502 can communicate with other users based on the communication application provided in the user device 501.

The user 502 may instruct the user device 501 to open the communication application by touch or voice.

Accordingly, the user device 501 may initiate a task to be performed to the server 503. The server 503 may be an asynchronous processing device, or an asynchronous processing device may be disposed in the server 503.

Accordingly, the server 503 receives the task to be executed initiated by the user equipment 501, and may execute the method according to any of the above embodiments, and sends the asynchronous processing result to the user equipment 501.

Accordingly, the user device 501 receives the asynchronous processing result sent by the server 503 and may display a page of the communication application, such as a display including contact information and a historical communication record, based on the asynchronous processing result.

Fig. 6 is a schematic diagram according to a fourth embodiment of the present application, and as shown in fig. 6, an asynchronous processing apparatus 600 of the embodiment of the present application includes:

a first obtaining unit 601, configured to obtain a plurality of tasks to be executed.

An allocating unit 602, configured to allocate a task identifier for each task to be executed.

The execution unit 603 is configured to execute a plurality of to-be-executed tasks by using a plurality of threads, and obtain a target task execution result carrying a target task identifier, which corresponds to the target to-be-executed task, if any thread finishes executing the target to-be-executed task.

Wherein a task to be executed is executed by a thread.

A second obtaining unit 604, configured to obtain target expiration time information of the target task to be executed.

The generating unit 605 is configured to generate an asynchronous processing result of the target task to be executed according to the target task execution result and the target timeout information.

Fig. 7 is a schematic diagram according to a fifth embodiment of the present application, and as shown in fig. 7, an asynchronous processing apparatus 700 according to the embodiment of the present application includes:

a first obtaining unit 701, configured to obtain a plurality of tasks to be executed.

An allocating unit 702, configured to allocate an identifier for each task to be executed.

The first determining unit 703 is configured to determine the expiration time information corresponding to each to-be-executed task.

A constructing unit 704, configured to construct a first list based on the task identifier of each to-be-executed task and the expiration time information corresponding to each to-be-executed task.

In some embodiments, the first list includes a hash mapping table, and the hash mapping table is used for representing a mapping relationship between the task identifier and the expiration time information; the constructing unit 704 is configured to construct, for each to-be-executed task, a hash mapping table representing a mapping relationship between a task identifier and expiration time information of each to-be-executed task.

An adding unit 705, configured to add a plurality of to-be-executed tasks to the second list according to a preset execution time.

The second list is a first-in first-out task list.

The execution unit 706 is configured to execute the multiple tasks to be executed by using multiple threads according to a first-in first-out order of the tasks to be executed in the second list, and obtain a target task execution result corresponding to the target task to be executed if any of the threads finishes executing the target task to be executed.

A binding unit 707 for binding both the target task identifier and the target task execution result.

The second obtaining unit 708 is configured to obtain target expiration time information of the target task to be executed.

In some embodiments, the second obtaining unit 708 is configured to query the first list for the expiration time information of each task to be executed.

The first list stores different information of the overdue time of the task to be executed.

In some embodiments, the first list includes a hash mapping table, and the hash mapping table is used for representing a mapping relationship between the task identifier and the expiration time information; the second obtaining unit 708 is configured to query, according to a target task identifier carried in a target task execution result, target timeout time information of a target task to be executed from the hash mapping table.

The generating unit 709 is configured to generate an asynchronous processing result of the target task to be executed according to the target task execution result and the target timeout information.

As shown in fig. 7, in some embodiments, the generating unit 709 includes:

a first determining subunit 7091, configured to determine, according to the target expiration time information, a type of the target task to be executed, where the type of the target task to be executed includes: an expiration type and a normal type.

The generating subunit 7092 is configured to generate an asynchronous processing result of the target task to be executed according to the target task execution result and the type of the target task to be executed.

In some embodiments, generating subunit 7092 comprises:

and the filling module is used for filling the parameters of the preset callback function according to the target task execution result and the type of the target task to be executed to obtain the filled callback function.

And the determining module is used for determining the asynchronous processing result of the target task to be executed according to the filled callback function.

Fig. 8 is a schematic diagram according to a sixth embodiment of the present application, and as shown in fig. 8, an asynchronous processing apparatus 800 according to the embodiment of the present application includes:

a first obtaining unit 801, configured to obtain a plurality of tasks to be executed.

An allocating unit 802, configured to allocate an identifier for each to-be-executed task.

The first determining unit 803 is configured to determine expiration time information corresponding to each task to be executed.

The constructing unit 804 is configured to construct a first list based on the identifier of each to-be-executed task and the expiration time information corresponding to each to-be-executed task.

In some embodiments, the first list includes: the system comprises a linked list and a Hash mapping table, wherein the linked list comprises a task identifier of each task to be executed, and the Hash mapping table is used for representing the mapping relation between the task identifier and the expiration time information.

And the traversing unit 805 is configured to traverse the task identifier of each to-be-executed task in the linked list based on a preset time interval.

The second determining unit 806 is configured to determine, according to the task identifier of each to-be-executed task in the linked list, the expiration time information of each to-be-executed task.

As can be seen in fig. 8, in some embodiments, the second determining unit 806 includes:

the second determining subunit 8061 is configured to determine, in the hash mapping table, a task identifier that is the same as the task identifier of each to-be-executed task in the linked list.

A third determining subunit 8062, configured to determine, from the hash mapping table, expiration time information corresponding to a task identifier that is the same as a task identifier of each to-be-executed task in the linked list in the hash mapping table.

A third determining unit 807, configured to determine a type of each task to be executed according to the expiration time information associated with each task to be executed, where the type of each task to be executed includes: an expiration type and a normal type.

A generating unit 808, configured to generate an asynchronous processing result of any task to be executed based on the task identifier of any task to be executed and the type of any task to be executed if the type of any task to be executed in each task to be executed is an out-of-date exception

It should be noted that the sixth embodiment can be combined with the fifth embodiment to obtain a new embodiment, which is not described herein again.

According to an embodiment of the present application, an electronic device and a readable storage medium are also provided.

There is also provided, in accordance with an embodiment of the present application, a computer program product, including: a computer program, stored in a readable storage medium, from which at least one processor of the electronic device can read the computer program, the at least one processor executing the computer program causing the electronic device to perform the solution provided by any of the embodiments described above.

FIG. 9 illustrates a schematic block diagram of an example electronic device 900 that can be used to implement embodiments of the present application. Electronic devices are intended to represent various forms of digital computers, such as laptops, desktops, workstations, personal digital assistants, servers, blade servers, mainframes, and other appropriate computers. The electronic device may also represent various forms of mobile devices, such as personal digital processing, cellular phones, smart phones, wearable devices, and other similar computing devices. The components shown herein, their connections and relationships, and their functions, are meant to be examples only, and are not meant to limit implementations of the disclosure described and/or claimed herein.

As shown in fig. 9, the electronic apparatus 900 includes a computing unit 901, which can perform various appropriate actions and processes in accordance with a computer program stored in a Read Only Memory (ROM)902 or a computer program loaded from a storage unit 908 into a Random Access Memory (RAM) 903. In the RAM 903, various programs and data required for the operation of the device 900 can also be stored. The calculation unit 901, ROM 902, and RAM 903 are connected to each other via a bus 904. An input/output (I/O) interface 905 is also connected to bus 904.

A number of components in the device 900 are connected to the I/O interface 905, including: an input unit 906 such as a keyboard, a mouse, and the like; an output unit 907 such as various types of displays, speakers, and the like; a storage unit 908 such as a magnetic disk, optical disk, or the like; and a communication unit 909 such as a network card, a modem, a wireless communication transceiver, and the like. The communication unit 909 allows the device 900 to exchange information/data with other devices through a computer network such as the internet and/or various telecommunication networks.

The computing unit 901 may be a variety of general and/or special purpose processing components having processing and computing capabilities. Some examples of the computing unit 901 include, but are not limited to, a Central Processing Unit (CPU), a Graphics Processing Unit (GPU), various dedicated Artificial Intelligence (AI) computing chips, various computing units running machine learning model algorithms, a Digital Signal Processor (DSP), and any suitable processor, controller, microcontroller, and so forth. The calculation unit 901 performs the respective methods and processes described above, such as the asynchronous processing method. For example, in some embodiments, the asynchronous processing method may be implemented as a computer software program tangibly embodied in a machine-readable medium, such as storage unit 908. In some embodiments, part or all of the computer program may be loaded and/or installed onto device 900 via ROM 902 and/or communications unit 909. When the computer program is loaded into RAM 903 and executed by computing unit 901, one or more steps of the asynchronous processing method described above may be performed. Alternatively, in other embodiments, the computing unit 901 may be configured to perform the asynchronous processing method by any other suitable means (e.g., by means of firmware).

Various implementations of the systems and techniques described here above may be implemented in digital electronic circuitry, integrated circuitry, Field Programmable Gate Arrays (FPGAs), Application Specific Integrated Circuits (ASICs), Application Specific Standard Products (ASSPs), system on a chip (SOCs), load programmable logic devices (CPLDs), computer hardware, firmware, software, and/or combinations thereof. These various embodiments may include: implemented in one or more computer programs that are executable and/or interpretable on a programmable system including at least one programmable processor, which may be special or general purpose, receiving data and instructions from, and transmitting data and instructions to, a storage system, at least one input device, and at least one output device.

Program code for implementing the methods of the present disclosure may be written in any combination of one or more programming languages. These program codes may be provided to a processor or controller of a general purpose computer, special purpose computer, or other programmable data processing apparatus, such that the program codes, when executed by the processor or controller, cause the functions/operations specified in the flowchart and/or block diagram to be performed. The program code may execute entirely on the machine, partly on the machine, as a stand-alone software package partly on the machine and partly on a remote machine or entirely on the remote machine or server.

In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.

To provide for interaction with a user, the systems and techniques described here can be implemented on a computer having: a display device (e.g., a CRT (cathode ray tube) or LCD (liquid crystal display) monitor) for displaying information to a user; and a keyboard and a pointing device (e.g., a mouse or a trackball) by which a user can provide input to the computer. Other kinds of devices may also be used to provide for interaction with a user; for example, feedback provided to the user can be any form of sensory feedback (e.g., visual feedback, auditory feedback, or tactile feedback); and input from the user may be received in any form, including acoustic, speech, or tactile input.

The systems and techniques described here can be implemented in a computing system that includes a back-end component (e.g., as a data server), or that includes a middleware component (e.g., an application server), or that includes a front-end component (e.g., a user computer having a graphical user interface or a web browser through which a user can interact with an implementation of the systems and techniques described here), or any combination of such back-end, middleware, or front-end components. The components of the system can be interconnected by any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include: local Area Networks (LANs), Wide Area Networks (WANs), and the Internet.

The computer system may include clients and servers. A client and server are generally remote from each other and typically interact through a communication network. The relationship of client and server arises by virtue of computer programs running on the respective computers and having a client-server relationship to each other. The Server can be a cloud Server, also called a cloud computing Server or a cloud host, and is a host product in a cloud computing service system, so as to solve the defects of high management difficulty and weak service expansibility in the traditional physical host and VPS service ("Virtual Private Server", or simply "VPS"). The server may also be a server of a distributed system, or a server incorporating a blockchain.

According to another aspect of the embodiments of the present application, there is also provided a roadside device including the electronic device according to the above embodiments.

According to another aspect of the embodiment of the present application, an embodiment of the present application further provides a cloud control platform, including the electronic device according to the above embodiment.

It should be understood that various forms of the flows shown above may be used, with steps reordered, added, or deleted. For example, the steps described in the present application may be executed in parallel, sequentially, or in different orders, and the present invention is not limited thereto as long as the desired results of the technical solutions disclosed in the present application can be achieved.

The above-described embodiments should not be construed as limiting the scope of the present application. It should be understood by those skilled in the art that various modifications, combinations, sub-combinations and substitutions may be made in accordance with design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present application shall be included in the protection scope of the present application.

Claims

1. An asynchronous processing method, comprising:

acquiring target time-out information of the target task to be executed;

2. The method of claim 1, wherein obtaining target timeout information for the target task to be performed comprises:

and inquiring the overdue time information of the target task to be executed from a first list, wherein the first list stores different overdue time information of the task to be executed.

3. The method according to claim 2, wherein the first list includes a hash mapping table, and the hash mapping table is used for characterizing a mapping relationship between the task identifier and the expiration time information; the querying the information of the overdue time of the target task to be executed from the first list comprises:

and inquiring target time-out information of the target task to be executed from the hash mapping table according to the target task identifier carried in the target task execution result.

4. The method of claim 1, wherein generating an asynchronous processing result of the target task to be executed according to the target task execution result and the target timeout information comprises:

determining the types of the target tasks to be executed according to the target expiration time information, wherein each type of the tasks to be executed comprises: an expiration type and a normal type;

and generating an asynchronous processing result of the target task to be executed according to the target task execution result and the type of the target task to be executed.

5. The method of claim 4, wherein generating the asynchronous processing result of the target task to be executed according to the target task execution result and the type of the target task to be executed comprises:

filling parameters of a preset callback function according to the target task execution result and the type of the target task to be executed to obtain the filled callback function;

and determining the asynchronous processing result of the target task to be executed according to the filled callback function.

6. The method of claim 2, further comprising, prior to querying the first list for expiration time information for the target task to be performed:

determining the corresponding time-out information of each task to be executed;

and constructing the first list based on the task identification of each task to be executed and the corresponding expiration time information of each task to be executed.

7. The method of claim 6, wherein the first list comprises a hash map, and the hash map is used for characterizing a mapping relationship between task identifiers and expiration time information; constructing the first list based on the task identifier of each task to be executed and the corresponding expiration time information of each task to be executed, wherein the method comprises the following steps:

and aiming at each task to be executed, constructing a Hash mapping table representing the mapping relation between the task identifier and the expiration time information of each task to be executed.

8. The method according to claim 7, wherein the first list further includes a linked list, and the linked list includes a task identifier of each task to be executed; the method further comprises the following steps:

traversing the task identifier of each task to be executed in the linked list based on a preset time interval;

determining the time information of the overdue time of each task to be executed according to the task identifier of each task to be executed in the linked list;

determining the type of each task to be executed according to the information of the expiration time of each task to be executed, wherein the type of each task to be executed comprises the following steps: an expiration type and a normal type;

and if the type of any task to be executed in each task to be executed is an overdue type, generating an asynchronous processing result of the any task to be executed based on the task identifier of the any task to be executed and the type of the any task to be executed.

9. The method of claim 8, wherein determining expiration time information corresponding to each of the tasks to be executed according to the task identifier of each of the tasks to be executed in the linked list comprises:

and determining a task identifier which is the same as the task identifier of each task to be executed in the linked list in the hash mapping table, and determining the expiry time information which is corresponding to the task identifier which is the same as the task identifier of each task to be executed in the linked list in the hash mapping table from the hash mapping table.

10. The method according to any one of claims 1 to 9, wherein the executing a plurality of the tasks to be executed by using a plurality of threads, and obtaining a target task execution result carrying a target task identifier corresponding to a target task to be executed if any thread finishes executing the target task to be executed, includes:

executing a plurality of tasks to be executed by adopting a plurality of threads, and obtaining a target task execution result corresponding to the target task to be executed if any thread finishes executing the target task to be executed;

and binding the target task execution result and the target task identifier.

11. The method according to any one of claims 1 to 9, further comprising, after assigning a task identity to each of the tasks to be executed:

adding a plurality of tasks to be executed into a second list according to preset execution time;

and executing a plurality of the tasks to be executed by adopting a plurality of threads, wherein the steps comprise: and executing a plurality of tasks to be executed by adopting a plurality of threads according to the first-in first-out sequence of the tasks to be executed in a second list.

12. An asynchronous processing device comprising:

the execution unit is used for executing a plurality of tasks to be executed by adopting a plurality of threads, and obtaining a target task execution result which is corresponding to each task to be executed and carries a target task identifier if any thread finishes executing a target task to be executed, wherein one task to be executed is executed by one thread;

13. The apparatus according to claim 12, wherein the second obtaining unit is configured to query expiration time information of the target task to be executed from a first list, where the first list stores expiration time information of different tasks to be executed.

14. The apparatus according to claim 13, wherein the first list includes a hash map, and the hash map is used to characterize a mapping relationship between the task identifier and the expiration time information; and the second obtaining unit is used for inquiring the target expiration time information of the target task to be executed from the hash mapping table according to the target task identifier carried in the target task execution result.

15. The apparatus of claim 12, wherein the generating unit comprises:

a first determining subunit, configured to determine, according to the target expiration time information, a type of the target task to be executed, where the type of the target task to be executed includes: an expiration type and a normal type;

and the generating subunit is used for generating an asynchronous processing result of the target task to be executed according to the target task execution result and the type of the target task to be executed.

16. The apparatus of claim 15, wherein the generating subunit comprises:

the filling module is used for filling parameters of a preset callback function according to the target task execution result and the type of the target task to be executed to obtain the filled callback function;

17. The apparatus of claim 13, further comprising:

the first determining unit is used for determining the corresponding expiration time information of each task to be executed;

and the construction unit is used for constructing the first list based on the task identifier of each task to be executed and the corresponding expiration time information of each task to be executed.

18. The apparatus according to claim 17, wherein the first list includes a hash map, and the hash map is used to characterize a mapping relationship between task identifiers and expiration time information; the construction unit is used for constructing a hash mapping table representing the mapping relation between the task identifier and the expiration time information of each task to be executed aiming at each task to be executed.

19. The apparatus according to claim 18, wherein the first list further includes a linked list, and the linked list includes a task identifier of each task to be executed; further comprising:

the traversal unit is used for traversing the task identifier of each task to be executed in the linked list based on a preset time interval;

the second determining unit is used for determining the time-out information of each task to be executed according to the task identifier of each task to be executed in the linked list;

a third determining unit, configured to determine a type of each to-be-executed task according to the time out information associated with each to-be-executed task, where the type of each to-be-executed task includes: an expiration type and a normal type;

the generating unit is configured to generate an asynchronous processing result of any task to be executed based on the task identifier of the any task to be executed and the type of the any task to be executed if the type of any task to be executed in each task to be executed is an overdue type.

20. The apparatus of claim 19, wherein the second determining unit comprises:

the second determining subunit is configured to determine a task identifier that is the same as a task identifier of each to-be-executed task in the linked list in the hash mapping table;

and the third determining subunit is configured to determine, from the hash mapping table, expiration time information corresponding to a task identifier in the hash mapping table, where the task identifier is the same as the task identifier of each to-be-executed task in the linked list.

21. The apparatus of any of claims 12 to 20, further comprising:

the execution unit is used for executing a plurality of tasks to be executed by adopting a plurality of threads, and obtaining a target task execution result corresponding to the target task to be executed if any thread finishes executing the target task to be executed;

and the binding unit is used for binding the target task execution result and the target task identifier.

22. The apparatus of any of claims 13 to 20, further comprising:

the adding unit is used for adding the tasks to be executed into a second list according to preset execution time;

and the execution unit is used for executing the tasks to be executed by adopting a plurality of threads according to the first-in first-out sequence of the tasks to be executed in the second list.

23. An electronic device, comprising:

at least one processor; and

the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of claims 1-11.

24. A non-transitory computer readable storage medium having stored thereon computer instructions for causing the computer to perform the method of any one of claims 1-11.

25. A computer program product comprising a computer program which, when executed by a processor, implements the method according to any one of claims 1-11.

26. A roadside apparatus comprising the electronic apparatus of claim 23.

27. A cloud controlled platform comprising the electronic device of claim 23.