CN104571958A - Task execution method and task execution device - Google Patents

Abstract

An embodiment of the present invention provides a task execution method and device, wherein the method specifically includes: receiving tasks from multiple application modules; writing the tasks into a buffer; and reading the tasks from the buffer , and utilize a single thread to perform said tasks. The embodiments of the present invention can effectively save system resources such as thread resources. Moreover, using a single thread to execute the task can avoid problems such as object confusion caused by multiple threads jointly operating an object.

Description

A task execution method and device

technical field

The present invention relates to the technical field of network communication, in particular to a task execution method and device.

Background technique

The server's log is a database that records the information of the server at all times. Logs can be divided into application logs, security logs, and system logs according to their content. Among them, the application program log is mainly used to record the running information of the application program on the server, and the security log is mainly used to record all the behavior information of the server user during the login process, such as when and which web page is accessed, whether there is a favorite web page, etc.; the system The log is mainly used to record the running status of the server system program.

In the existing solution, the operation of writing logs to the disk of the server is performed by each application module. For example, the application modules corresponding to each application program respectively write the operation information of the corresponding application program into the application program log. The modules are respectively used to write certain behavior information generated by the user into the security log and so on.

The above solution for performing log writing operations has the advantage of light coupling. However, multiple application modules need to occupy corresponding system resources, and when multiple application modules write logs to the server's disk at the same time, it is easy to cause disk confusion.

Contents of the invention

In view of the above problems, the present invention is proposed to provide a task execution method and device that overcome the above problems or at least partly solve the above problems.

According to one aspect of the present invention, a task execution method is provided, including:

Receive tasks from multiple application modules;

write said tasks to a buffer; and

The task is read from the buffer and executed with a single thread.

Optionally, the step of writing the task into the buffer includes:

writing the tasks into a buffer in the order in which they were received; and/or

writing the task into a buffer according to the priority of the task; and/or

Writing the task into the buffer according to the priority of the application module corresponding to the task; and/or

Write the task into the buffer according to the attribute information of the task.

Optionally, the step of reading the task from the buffer includes:

reading said tasks from said buffer in the order in which said tasks were written; and/or

reading the task from the buffer according to the priority of the task; and/or

Reading the task from the buffer according to the priority of the application module corresponding to the task; and/or

Read the task from the buffer according to the attribute information of the task.

Optionally, the buffer includes: a memory buffer and/or a persistent buffer.

Optionally, the step of writing the task into the buffer includes:

Writing the task loop to the buffer.

Optionally, the buffer is a persistent buffer, and the persistent buffer includes a unit block;

Then described method also comprises:

After writing the task into the unit block in the persistent buffer according to the order in which the task is received, generating a corresponding first verification parameter for the content in the unit block;

After reading the task from the unit block, generating a corresponding second verification parameter for the read task;

judging whether the second verification parameter is consistent with the first verification parameter;

Execute the read task when the second verification parameter is consistent with the first verification parameter;

When the second verification parameter is inconsistent with the first verification parameter, the read task is discarded.

Optionally, the task information includes: a task data frame, wherein the task data frame is an encapsulation frame corresponding to a subpackage, the subpackage is obtained by decomposing a data packet, and the task data frame includes: a subpackage Number in the packet, subpacket data, and end-of-packet identifier.

According to another aspect of the present invention, a task performance device is provided, comprising:

a receiving module, configured to receive tasks from multiple application modules;

a write module for writing the task into a buffer; and

The execution module is used to read the task from the buffer and execute the task with a single thread.

Optionally, the writing module includes:

First write to the submodule. for writing the tasks into a buffer in the order in which they are received; and/or

The second writes to the submodule. for writing the task into a buffer according to the priority of the task; and/or

The third writes to the submodule. For writing the task into the buffer according to the priority of the application module corresponding to the task; and/or

The fourth writing submodule is used to write the task into the buffer according to the attribute information of the task.

Optionally, the execution module includes:

The first reading submodule is used to read the tasks from the buffer according to the order in which the tasks are written; and/or

The second reading submodule is used to read the task from the buffer according to the priority of the task; and/or

The third reading submodule is configured to read the task from the buffer according to the priority of the application module corresponding to the task; and/or

The fourth reading submodule is configured to read the task from the buffer according to the attribute information of the task.

According to a task execution method and device provided by an embodiment of the present invention, write tasks from multiple application modules into a buffer, read the tasks from the buffer, and execute the tasks using a single thread; Compared with the existing solution in which multiple application modules occupy multiple thread resources to perform the task, the embodiment of the present invention uses a single thread to perform the task, which can effectively save system resources such as thread resources. Moreover, using a single thread to execute the task can avoid problems such as object confusion caused by multiple threads jointly operating an object.

The above description is only an overview of the technical solution of the present invention. In order to understand the technical means of the present invention more clearly, it can be implemented according to the contents of the description, and in order to make the above and other purposes, features and advantages of the present invention more obvious and easy Understand, the specific embodiment of the present invention is enumerated below.

Description of drawings

Various other advantages and benefits will become apparent to those of ordinary skill in the art upon reading the following detailed description of the alternative embodiments. The drawings are only for purposes of illustrating alternative embodiments and are not to be considered as limiting the invention. Also throughout the drawings, the same reference numerals are used to designate the same components. In the attached picture:

FIG. 1 shows a schematic flowchart of steps of a task execution method according to an embodiment of the present invention;

Fig. 2 shows a schematic structural diagram of a buffer according to an embodiment of the present invention; and

Fig. 3 shows a schematic structural diagram of a task execution device according to an embodiment of the present invention.

Detailed ways

Exemplary embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. Although exemplary embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be limited to the embodiments set forth herein. Rather, these embodiments are provided for more thorough understanding of the present disclosure and to fully convey the scope of the present disclosure to those skilled in the art.

Referring to FIG. 1 , it shows a schematic flow chart of the steps of a task execution method according to an embodiment of the present invention, which may specifically include the following steps:

Step 101, receiving tasks from multiple application modules;

Step 102, writing the task into a buffer; and

Step 103, read the task from the buffer, and execute the task with a single thread.

In the embodiment of the present invention, the tasks of multiple application modules may involve the same operation, such as the operation of writing logs to the disk, etc.; they may also involve different operations, such as the operation of reading data from the database and writing data to the database. Operation, etc., the embodiment of the present invention does not limit specific tasks and task sources.

In an application example of the present invention, the tasks can be numbered according to the order in which they are received, and then the tasks are written into the buffer according to the order of numbering, and the buffer is scanned to read from the Read the task in the above buffer, and execute the task with a single thread, so as to ensure the fast execution of the task.

In the embodiment of the present invention, the buffer can be used to store tasks from multiple application modules. Referring to FIG. 2 , it shows a schematic structural diagram of a buffer according to an embodiment of the present invention, which may specifically include a write pointer and a read pointer, wherein the write pointer may be used to write task 1, task 2, task 3..., etc. Into the buffer, the read pointer can be used to read tasks from the buffer, in practical applications, the reading of tasks can be realized through the read pointer, and the read tasks can be executed by using a single thread. It should be noted that the reading operation of the task may also be performed by a single thread, and the embodiment of the present invention does not limit the execution subject of the reading operation of the task.

Taking the above-mentioned operation of writing logs to the disk of the server as an example, the embodiment of the present invention may receive corresponding log writing tasks from application modules corresponding to application programs, application modules set for websites, etc., and write the tasks into Buffer, read the task from the buffer, and use a single thread to execute the task; Compared with the existing solution where multiple application modules occupy multiple thread resources to perform the log writing task, the present invention implements For example, using a single thread to execute the log writing task can effectively save system resources such as thread resources, and using a single thread to execute the task can avoid problems such as disk confusion during multi-threaded execution of the task.

In summary, the embodiment of the present invention writes tasks from multiple application modules into a buffer, reads the tasks from the buffer, and executes the tasks using a single thread; The application module occupies multiple thread resources to execute the task, and the embodiment of the present invention uses a single thread to execute the task, which can effectively save system resources such as thread resources. Moreover, using a single thread to execute the task can avoid problems such as object confusion caused by multiple threads jointly operating an object.

In an optional embodiment of the present invention, the execution order of the tasks may be controlled by controlling the order in which the tasks are written into the buffer, and correspondingly, the step of writing the tasks into the buffer, Specifically can include:

writing the tasks into a buffer in the order in which they were received; and/or

writing the task into a buffer according to the priority of the task; and/or

Writing the task into the buffer according to the priority of the application module corresponding to the task; and/or

Write the task into the buffer according to the attribute information of the task.

Among them, the receiving order of tasks is the order in which tasks are received from the corresponding application modules, and the latest received tasks are first written into the buffer; The higher the priority, the corresponding task is written into the buffer; usually, the higher the priority of the task corresponding to the application module, the higher the priority of the task is written into the buffer; the attribute information of the task can specifically include: task complexity, execution time and other information, in order to prevent tasks with a long execution time from affecting the execution of other tasks with a short execution time, in an application example of the present invention, tasks with a short execution time can be written first, and tasks with a long execution time can be delayed .

Several schemes for writing the task into the buffer have been introduced above, and it can be understood that those skilled in the art can adopt any of the above writing schemes according to actual needs, or use a combination of the above several writing schemes , for example, weighted average of task information such as task receiving order, task priority, task corresponding application module priority and task attribute information, and write the task into the buffer according to the weighted average result, etc., the actual In general, it is feasible for those skilled in the art to control the execution order of the tasks by controlling the order in which the tasks are written into the buffer. The embodiment of the present invention is specific to writing the tasks into the buffer The programs are not limited.

In another optional embodiment of the present invention, the execution order of the tasks can be controlled by controlling the order in which the tasks are read from the buffer, and correspondingly, the reading from the buffer The steps of the task may specifically include:

reading said tasks from said buffer in the order in which said tasks were written; and/or

reading the task from the buffer according to the priority of the task; and/or

Reading the task from the buffer according to the priority of the application module corresponding to the task; and/or

Read the task from the buffer according to the attribute information of the task.

It can be understood that those skilled in the art can adopt any of the above-mentioned reading schemes according to actual needs, or use a combination of the above-mentioned several reading schemes, for example, the writing order of tasks, the priority of tasks, and the corresponding tasks The task information such as the priority of the application module and the attribute information of the task is written into the buffer, and the task information is first read from the buffer, and the writing order of the task, the priority of the task, the priority and Information such as the attribute information of the task is weighted averaged, and read from the buffer according to the weighted average result, etc. In fact, those skilled in the art control the order in which the tasks are read from the buffer. The reading scheme of the execution order of the above tasks is feasible, and the embodiment of the present invention does not limit the specific scheme of reading the tasks from the buffer.

In a specific implementation, the buffer may specifically include: a memory buffer and/or a persistent buffer. Wherein, the memory buffer has the advantage of fast reading and writing speed; the persistent buffer can persist data in the file, so as to ensure that the data will not be lost after restarting the synchronization operation. In a specific implementation, the memory buffer can be implemented with data structures such as a queue and a linked list, and the embodiment of the present invention does not limit the specific data structure of the memory buffer.

In an optional embodiment of the present invention, the step of writing the task into the buffer may specifically include: cyclically writing the task into the buffer. In this optional embodiment, the buffer can be recycled when the writing speed is fast, so as to achieve the effect of saving cache resources. In a specific implementation, in order to avoid the problem of data loss caused by the writing speed exceeding the reading speed, before the multiple tasks are cyclically written into the buffer, the write pointer and the read pointer can be compared. If the position pointed to exceeds the position pointed to by the read pointer, then write the task into other buffers, if the position pointed to by the write pointer does not exceed the position pointed to by the read pointer, then write the task into the buffer cyclically district.

In another optional embodiment of the present invention, the buffer may be a persistent buffer, and the persistent buffer may further include a unit block;

Then described method can also comprise:

After writing the task into the unit block in the persistent buffer according to the order in which the task is received, generating a corresponding first verification parameter for the content in the unit block;

After reading the task from the unit block, generating a corresponding second verification parameter for the read task;

judging whether the second verification parameter is consistent with the first verification parameter;

Execute the read task when the second verification parameter is consistent with the first verification parameter;

When the second verification parameter is inconsistent with the first verification parameter, the read task is discarded.

When data is stored in persistent buffers such as SSDs (Solid State Drives), since the lifespan of flash memory blocks (blocks) in SSDs is limited, some bad flash memory blocks will inevitably appear in SSDs. Once the flash memory blocks become If there is a bad block, the data in the flash memory block will be unavailable.

In order to avoid the unavailability of the data in the bad block and cause the unavailability of the data of the entire flash memory block, after the multiple tasks are written into the unit block in the persistent buffer in this optional embodiment, the content in the unit block can be generated. Corresponding first verification parameters, in this way, after reading the subtasks and their corresponding task information from the unit block, generate corresponding second verification parameters for the read tasks, by judging the first Whether the first check parameter is consistent with the second check parameter determines whether the unit block is damaged. After it is determined that the unit block is damaged, only the data of the unit block is unavailable, and other data (such as those in the unit block) The data of other unit blocks of the same flash memory block) can also be used normally, so the reliability of stored data can be improved.

In a specific implementation, authentication algorithms such as MD5 (Information Digest Algorithm 5, Message-Digest Algorithm 5), DSA (Digital Signature Algorithm, Digital Signature Algorithm) can be used to generate the first verification parameter and the second verification parameter. The embodiment of the invention does not limit the specific method for generating the first verification parameter and the second verification parameter.

In addition, those skilled in the art can determine the size of the unit block according to the actual situation, the size of the unit block can be smaller than the size of the flash memory block, for example, the size of the flash memory block in SLC (Single Layer Cell, Single Layer Cell) is 128kb , then, the size of the unit block may be 32kb, etc., and the embodiment of the present invention does not limit the size of the unit block.

In yet another optional embodiment of the present invention, the task information may specifically include: a task data frame, wherein the task data frame may be an encapsulation frame corresponding to a subpacket, and the subpacket is a basis data packet After being decomposed, the task data frame may specifically include: the number of the subpacket in the data packet, subpackage data, and an end identifier of the data packet. In this optional embodiment, when the data packet corresponding to the subtask is relatively large (such as 128kb) and does not meet the transmission requirements, the data packet can be decomposed into multiple subpackages (32kb), and encapsulated in the task data frame of each subpackage The number of the subpacket in the data packet, the data of the subpacket, the end identifier of the data packet and other information can ensure the integrity of the data packet transmission.

It should be noted that, in order to improve data security, before writing the plurality of subtasks and their corresponding task information into the buffer in this embodiment of the present invention, each subtask and its corresponding task information may be encrypted, and, After a single thread reads subtasks and their corresponding task information from the buffer, the read content can be decrypted. The embodiment of the present invention does not limit the specific encryption algorithm and decryption algorithm.

Referring to FIG. 3 , it shows a schematic structural diagram of a task execution device according to an embodiment of the present invention, which may specifically include the following modules:

A receiving module 301, configured to receive tasks from multiple application modules;

A writing module 302, configured to write the task into a buffer; and

The execution module 303 is configured to read the task from the buffer and execute the task with a single thread.

In a specific implementation, the buffer may specifically include: a memory buffer and/or a persistent buffer.

In an optional embodiment of the present invention, the writing module 302 may be specifically configured to write the task cycle into the buffer.

In another optional embodiment of the present invention, the buffer may be a persistent buffer, and the persistent buffer may further include a unit block;

The device may also include:

The first generation module is configured to generate a corresponding first verification parameter for the content in the unit block after writing the task into the unit block in the persistent buffer according to the order in which the tasks are received;

A second generating module, configured to generate a corresponding second verification parameter for the read task after reading the task from the unit block;

A judging module, configured to judge whether the second verification parameter is consistent with the first verification parameter;

A first execution module, configured to execute the read task when the second verification parameter is consistent with the first verification parameter; and

A discarding module, configured to discard the read task when the second verification parameter is inconsistent with the first verification parameter.

In yet another optional embodiment of the present invention, the information of the task may specifically include: a task data frame, wherein the task data frame may be an encapsulation frame corresponding to a subpackage, and the subpackage is a basis data packet After being decomposed, the task data frame may specifically include: the number of the subpacket in the data packet, subpackage data, and the end identifier of the data packet.

As for the device embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and for related parts, please refer to the part of the description of the method embodiment.

The algorithms and displays presented herein are not inherently related to any particular computer, virtual system, or other device. Various generic systems can also be used with the teachings based on this. The structure required to construct such a system is apparent from the above description. Furthermore, the present invention is not specific to any particular programming language. It should be understood that various programming languages can be used to implement the content of the present invention described herein, and the above description of specific languages is for disclosing the best mode of the present invention.

In the description provided herein, numerous specific details are set forth. However, it is understood that embodiments of the invention may be practiced without these specific details. In some instances, well-known methods, structures and techniques have not been shown in detail in order not to obscure the understanding of this description.

Similarly, it should be appreciated that in the foregoing description of exemplary embodiments of the invention, in order to streamline this disclosure and to facilitate an understanding of one or more of the various inventive aspects, various features of the invention are sometimes grouped together in a single embodiment, figure, or its description. This method of disclosure, however, is not to be interpreted as reflecting an intention that the claimed invention requires more features than are expressly recited in each claim. Rather, as the following claims reflect, inventive aspects lie in less than all features of a single foregoing disclosed embodiment. Thus, the claims following the Detailed Description are hereby expressly incorporated into this Detailed Description, with each claim standing on its own as a separate embodiment of this invention.

Those skilled in the art can understand that the modules in the device in the embodiment can be adaptively changed and arranged in one or more devices different from the embodiment. Modules or units or components in the embodiments may be combined into one module or unit or component, and furthermore may be divided into a plurality of sub-modules or sub-units or sub-assemblies. All features disclosed in this specification (including accompanying claims, abstract and drawings), as well as any method or method so disclosed, may be used in any combination, unless at least some of such features and/or processes or units are mutually exclusive. or all processes or units of equipment. Each feature disclosed in this specification (including accompanying claims, abstract and drawings) may be replaced by alternative features serving the same, equivalent or similar purpose, unless expressly stated otherwise.

Furthermore, those skilled in the art will understand that although some embodiments described herein include some features included in other embodiments but not others, combinations of features from different embodiments are meant to be within the scope of the invention. and form different embodiments. For example, in the following claims, any of the claimed embodiments may be used in any combination.

The various component embodiments of the present invention may be implemented in hardware, or in software modules running on one or more processors, or in a combination thereof. Those skilled in the art should understand that a microprocessor or a digital signal processor (DSP) may be used in practice to implement some or all functions of some or all components in the task execution method and apparatus according to the embodiments of the present invention. The present invention can also be implemented as an apparatus or an apparatus program (for example, a computer program and a computer program product) for performing a part or all of the methods described herein. Such a program for realizing the present invention may be stored on a computer-readable medium, or may be in the form of one or more signals. Such a signal may be downloaded from an Internet platform, or provided on a carrier signal, or provided in any other form.

It should be noted that the above-mentioned embodiments illustrate rather than limit the invention, and that those skilled in the art will be able to design alternative embodiments without departing from the scope of the appended claims. In the claims, any reference signs placed between parentheses shall not be construed as limiting the claim. The word "comprising" does not exclude the presence of elements or steps not listed in a claim. The word "a" or "an" preceding an element does not exclude the presence of a plurality of such elements. The invention can be implemented by means of hardware comprising several distinct elements, and by means of a suitably programmed computer. In a unit claim enumerating several means, several of these means can be embodied by one and the same item of hardware. The use of the words first, second, and third, etc. does not indicate any order. These words can be interpreted as names.

The invention discloses A1. A task execution method, comprising:

Receive tasks from multiple application modules;

write said tasks to a buffer; and

The task is read from the buffer and executed with a single thread.

A2, the method as described in A1, the described step of writing described task into buffer zone, comprises:

writing the tasks into a buffer in the order in which they were received; and/or

writing the task into a buffer according to the priority of the task; and/or

Writing the task into the buffer according to the priority of the application module corresponding to the task; and/or

Write the task into the buffer according to the attribute information of the task.

A3. The method as described in A1, the step of reading the task from the buffer comprises:

reading said tasks from said buffer in the order in which said tasks were written; and/or

reading the task from the buffer according to the priority of the task; and/or

Reading the task from the buffer according to the priority of the application module corresponding to the task; and/or

Read the task from the buffer according to the attribute information of the task.

A4. The method described in A1 or A2 or A3, wherein the buffer includes: a memory buffer and/or a persistent buffer.

A5. The method as described in A1 or A2 or A3, the step of writing the task into the buffer includes:

Writing the task loop to the buffer.

A6, the method as described in A4, the buffer is a persistent buffer, and the persistent buffer includes a unit block;

Then described method also comprises:

After writing the task into the unit block in the persistent buffer according to the order in which the task is received, generating a corresponding first verification parameter for the content in the unit block;

After reading the task from the unit block, generating a corresponding second verification parameter for the read task;

judging whether the second verification parameter is consistent with the first verification parameter;

Execute the read task when the second verification parameter is consistent with the first verification parameter;

When the second verification parameter is inconsistent with the first verification parameter, the read task is discarded.

A7, the method as described in A1 or A2 or A3, the information of the task includes: a task data frame, wherein the task data frame is an encapsulation frame corresponding to a subpackage, and the subpackage is obtained by decomposing a data packet, The task data frame includes: the number of the subpacket in the data packet, the subpacket data and the end mark of the data packet.

The present invention also discloses B8, a task performing device, comprising:

a receiving module, configured to receive tasks from multiple application modules;

a write module for writing the task into a buffer; and

The execution module is used to read the task from the buffer and execute the task with a single thread.

B9, the device as described in B8, the writing module includes:

First write to the submodule. for writing the tasks into a buffer in the order in which they are received; and/or

The second writes to the submodule. for writing the task into a buffer according to the priority of the task; and/or

The third writes to the submodule. For writing the task into the buffer according to the priority of the application module corresponding to the task; and/or

The fourth writing submodule is used to write the task into the buffer according to the attribute information of the task.

B10, the device as described in B8, the execution module includes:

The first reading submodule is used to read the tasks from the buffer according to the order in which the tasks are written; and/or

The second reading submodule is used to read the task from the buffer according to the priority of the task; and/or

The third reading submodule is used to read the task from the buffer according to the priority of the application module corresponding to the task; and/or

The fourth reading submodule is configured to read the task from the buffer according to the attribute information of the task.

B11, the device as described in B8 or B9 or B10, described buffer comprises: memory buffer and/or persistent buffer.

B12. The device as described in B8 or B9 or B10, the writing module is specifically configured to write the task into the buffer cyclically.

B13. The device as described in B11, the buffer is a persistent buffer, and the persistent buffer includes a unit block;

The device then also includes:

The first generation module is configured to generate a corresponding first verification parameter for the content in the unit block after writing the task into the unit block in the persistent buffer according to the order in which the tasks are received;

A second generating module, configured to generate a corresponding second verification parameter for the read task after reading the task from the unit block;

A judging module, configured to judge whether the second verification parameter is consistent with the first verification parameter;

A first execution module, configured to execute the read task when the second verification parameter is consistent with the first verification parameter; and

A discarding module, configured to discard the read task when the second verification parameter is inconsistent with the first verification parameter.

B14, the device as described in B8 or B9 or B10, the information of the task includes: a task data frame, wherein the task data frame is an encapsulation frame corresponding to a subpackage, and the subpackage is obtained by decomposing a data packet, The task data frame includes: the number of the subpacket in the data packet, the subpacket data and the end mark of the data packet.

Claims (10)

1. a task executing method, comprising:

Receive the task from multiple application module;

By described task write buffer zone; And

From described buffer zone, read described task, and utilize the described task of single-threaded execution.

2. the method for claim 1, is characterized in that, described by the step of described task write buffer zone, comprising:

According to the reception order of described task, by described task write buffer zone; And/or

According to the priority of described task, by described task write buffer zone; And/or

According to the priority of the corresponding application module of described task, by described task write buffer zone; And/or

According to the attribute information of described task, by described task write buffer zone.

3. the method for claim 1, is characterized in that, the described step reading described task from described buffer zone, comprising:

According to the write sequence of described task, from described buffer zone, read described task; And/or

According to the priority of described task, from described buffer zone, read described task; And/or

According to the priority of the corresponding application module of described task, from described buffer zone, read described task; And/or

According to the attribute information of described task, from described buffer zone, read described task.

4. the method as described in claim 1 or 2 or 3, it is characterized in that, described buffer zone comprises: core buffer and/or lasting buffer zone.

5. the method as described in claim 1 or 2 or 3, is characterized in that, described by the step of described task write buffer zone, comprising:

Described duty cycle is write described buffer zone.

6. method as claimed in claim 4, it is characterized in that, described buffer zone is lasting buffer zone, and described lasting buffer zone comprises units chunk;

Then described method also comprises:

In the reception order according to described task, after units chunk in the described lasting buffer zone of described task write, generate corresponding first checking parameter for content in described units chunk;

After read described task from described units chunk, generate corresponding second checking parameter for read task;

Judge that whether described second checking parameter is consistent with described first checking parameter;

When described second checking parameter is consistent with described first checking parameter, perform reading of task;

Described second checking parameter and described first checking parameter inconsistent time, abandon read task.

7. the method as described in claim 1 or 2 or 3, it is characterized in that, the information of described task comprises: task data frame, wherein, described task data frame is encapsulated frame corresponding to attached bag, described attached bag obtains for decomposing according to packet, and described task data frame comprises: attached bag numbering in the packet, subpacket data and packet terminate mark.

8. a task execution device, comprising:

Receiver module, for receiving the task from multiple application module;

Writing module, for writing buffer zone by described task; And

Execution module, for reading described task from described buffer zone, and utilizes the described task of single-threaded execution.

9. device as claimed in claim 8, it is characterized in that, said write module, comprising:

First write submodule.For the reception order according to described task, by described task write buffer zone; And/or

Second write submodule.For the priority according to described task, by described task write buffer zone; And/or

3rd write submodule.For the priority according to the corresponding application module of described task, by described task write buffer zone; And/or

4th write submodule, for the attribute information according to described task, by described task write buffer zone.

10. device as claimed in claim 8, it is characterized in that, described execution module, comprising:

First reading submodule, for the write sequence according to described task, reads described task from described buffer zone; And/or

Second reading submodule, for the priority according to described task, reads described task from described buffer zone; And/or

Third reading gets submodule, for the priority according to the corresponding application module of described task, from described buffer zone, reads described task; And/or

4th reading submodule, for the attribute information according to described task, reads described task from described buffer zone.