CN110147273A - A kind of task executing method and device - Google Patents
A kind of task executing method and device Download PDFInfo
- Publication number
- CN110147273A CN110147273A CN201910413986.8A CN201910413986A CN110147273A CN 110147273 A CN110147273 A CN 110147273A CN 201910413986 A CN201910413986 A CN 201910413986A CN 110147273 A CN110147273 A CN 110147273A
- Authority
- CN
- China
- Prior art keywords
- task
- digraph
- execution
- executes
- predefined task
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Debugging And Monitoring (AREA)
Abstract
The invention discloses a kind of task executing method and device, wherein method are as follows: the first processing equipment obtains predefined task；The predefined task includes N number of step；N is the integer greater than 1；First processing equipment generates the corresponding execution digraph of the predefined task according to existing dependence between N number of step；It is described to execute the digraph that digraph is the execution sequence for indicating that N number of step is determined according to the dependence, if any two step of the dependence is not present in N number of step, the digraph indicates that any two step executes parallel；The step of first processing equipment is indicated according to the execution digraph executes sequence, executes the predefined task and improves the efficiency of financial transaction when this method is applied to the field financial technology (Fintech).
Description
Technical field
The present invention relates to task processing and the financial technology field (Fintech) more particularly to a kind of task executing method and
Device.
Background technique
With the development of computer technology, more and more technology (big data, distribution, block chain Blockchain, people
Work intelligence etc.) it applies in financial field, traditional financial industry gradually changes to financial technology (Finteh).Currently, financial section
In skill field, in order to realize some demand or purpose, the series of instructions combination that processing equipment needs to be implemented, referred to as one is appointed
Business.For example, the combination of data insertion and data modification, referred to as a data processing are carried out to a tables of data in database
Task.One task includes one or more steps.
In the prior art, during due to financial transaction, task execution requires have higher stability and reliability, therefore
It needs a step to connect a step successively to execute down, until all steps execute completion.Obviously, this step executive mode
Under, each step will could execute after previous step is finished, and the waiting time is more long, once previous step executes
It unsuccessfully re-executes, the longer time can be wasted.Since in this way, the execution time of entire task is longer, and execution efficiency is lower.
Therefore, in the prior art, the execution time of task is longer, lower execution efficiency is a urgent problem to be solved.
Summary of the invention
The embodiment of the present application provides a kind of task executing method and device, solves the execution time of task in the prior art
Problem longer, execution efficiency is lower.
The embodiment of the present application provides a kind of task executing method, comprising: the first processing equipment obtains predefined task；It is described
Predefined task includes N number of step；N is the integer greater than 1；First processing equipment exists according between N number of step
Dependence, generate the corresponding execution digraph of the predefined task；The execution digraph is to indicate N number of step
Suddenly the digraph of the execution sequence determined according to the dependence, if there is no the dependences in N number of step
Any two step, then the digraph indicates that any two step executes parallel；First processing equipment is according to institute
It states the step of executing digraph instruction and executes sequence, execute the predefined task.
Optionally, first step is either step in N number of step, and first processing equipment is held in the following way
The row first step: if the first step only includes a sub-steps, the sub-step is directly executed；If the first step
Suddenly include M sub-steps, then execute the M sub-steps parallel, M is the integer greater than 1.
Optionally, the method also includes: if in the predefined task it is undefined exist with the first step described in
The first step is first carried out when then first processing equipment executes the predefined task in any step of dependence
Suddenly.
Optionally, the method also includes: first processing equipment determines the predefined task in preset duration
Whether heartbeat data is had sent, if it is not, and determining that the operating status of the predefined task is then to set to second processing in operation
Preparation send the notification message of predefined task described in instruction trustship.
Optionally, the method also includes: if first processing equipment determine in N number of step exist execute failure
At least two steps, then execute parallel again it is described execute failure at least two steps.
In the embodiment of the present application, step can be executed by defining the execution digraph in predefined task, institute
The digraph for executing that digraph is the execution sequence for indicating that N number of step is determined according to the dependence is stated, if the N
Any two step of the dependence is not present in a step, then the digraph indicates that any two step is parallel
It executes.In addition, the execution digraph also indicates existing dependence between N number of step, thus ensure that task by
It is normally handled according to default execution precedence.Therefore, there is overlapping in the execution time of each step in any two step, and
It is not influenced between each other by whether executing failure, to be shortened whole under the premise of the predefined task of guarantee is stablized and executed
The execution time of a task, improve the execution efficiency of task.
The embodiment of the present application provides a kind of task execution device, comprising: module is obtained, for obtaining predefined task；Institute
Stating predefined task includes N number of step；N is the integer greater than 1；Processing module, for according to existing between N number of step
Dependence generates the corresponding execution digraph of the predefined task；The execution digraph is to indicate N number of step
According to the digraph for the execution sequence that the dependence determines, if appointing there is no the dependence in N number of step
It anticipates two steps, then the digraph indicates that any two step executes parallel；According to the execution digraph instruction
Step executes sequence, executes the predefined task.
Optionally, first step is either step in N number of step, and the processing module is specifically used for: according to following
Mode executes the first step: if the first step only includes a sub-steps, directly executing the sub-step；If described
First step includes M sub-steps, then executes the M sub-steps parallel, and M is the integer greater than 1.
Optionally, the processing module is also used to: if undefined in the predefined task exist with the first step
Any step of the dependence, then be first carried out the first step when executing the predefined task.
Optionally, the processing module is also used to: determining whether the predefined task has sent the heart in preset duration
Hop count evidence, if it is not, and determining that the operating status of the predefined task is then to send instruction trustship to pre-configuration equipment in operation
The notification message of the predefined task.
Optionally, the processing module is also used to: being executed if first processing equipment determines to exist in N number of step
At least two steps of failure then execute at least two steps for executing failure parallel again.
The embodiment of the present application provides a kind of computer equipment, including program or instruction, when described program or instruction are performed
When, a kind of task executing method such as provided by the embodiments of the present application and optional method are performed.
The embodiment of the present application provides a kind of storage medium, including program or instruction, when described program or instruction be performed,
A kind of task executing method such as provided by the embodiments of the present application and optional method are performed.
Detailed description of the invention
Fig. 1 is a kind of schematic diagram of predefined task in the embodiment of the present application；
Fig. 2 is a kind of flow diagram of task executing method in the embodiment of the present application；
Fig. 3 is a kind of structural schematic diagram of task execution device in the embodiment of the present application.
Specific embodiment
In order to better understand the above technical scheme, below in conjunction with Figure of description and specific embodiment to above-mentioned
Technical solution is described in detail, it should be understood that the specific features in the embodiment of the present application and embodiment are to the application skill
The detailed description of art scheme, rather than the restriction to technical scheme, in the absence of conflict, the embodiment of the present application
And the technical characteristic in embodiment can be combined with each other.
With the development of computer technology, more and more technology (big data, distribution, block chain Blockchain, people
Work intelligence etc.) it applies in financial field, traditional financial industry gradually changes to financial technology (Finteh).Currently, financial section
In skill field, in order to realize that some demand or purpose, processing equipment generally require to execute series of steps, this series of steps
Combination, referred to as a task.For example, the tables of data A in database is revised as to the task of tables of data B, including to data
Table carries out the series of steps of data insertion and data modification, and entire task is properly termed as a data processing task.For another example, will
Running log of one computer within the scope of certain time length collects, and counts to these running logs, to this
The operation conditions of platform computer is analyzed, and entire task is properly termed as a log statistic task.
At present execute task mode be each step in serial execution task, i.e. a step connect a step according to
It is secondary to execute down, until all steps execute completion.For example, task one has 5 steps: Step 1: Step 2: step
Three, Step 4: step 5, regardless of Step 1: Step 2: the Step 3: Step 4: successive execution that whether it is necessary or not between step 5
The constraint relationship all can serially execute step 1 to step 5.Wherein, necessary successive execution the constraint relationship refers to that two steps are held
The orbution successively executed that must comply with when row, as modified certain data in tables of data, it is necessary to first search and locate and arrive this
Then data is modified again.Obviously, under this serial mode for executing step, each step will be in previous step
It could be executed after being finished, the waiting time is more long, once the execution of previous step unsuccessfully needs to re-execute, will waste more
For a long time.Since in this way, the execution time of entire task is longer, and when especially step is more, execution efficiency is lower.
For this purpose, the application is real in order to which the execution time for solving the problems, such as task in the prior art is longer, execution efficiency is lower
It applies example and provides a kind of task executing method.
The embodiment of the present application provides a kind of task processing model based on digraph.Digraph: mathematically, a figure
(Graph) it is the method for indicating the relationship between object and object, is the basic research object of graph theory.One figure look like by
What the straight line or curve (referred to as side) of these dots of some dots (referred to as vertex or node) and connection formed.If to figure
Each edge provides a direction, then obtained figure is known as digraph.
Before task execution, need first to be defined task, particularly may be divided into three parts: task definition, step are fixed
The task model of one digraph can be generated according to definition for the definition of justice and step dependence.Wherein, task definition is
Task is named, such as data processing task one, task Q etc., title does not limit character types；Step definition includes to task
In the definition of each step and the specific execution method of each step, some steps can also have including several sub-steps, this
Part also provides in step definition, in addition, can define step name when step defines, realizes class, how to split data, executes
Thread size reads size of data, submits transaction size, log rank etc.；Step dependence are as follows: in N number of step, each
Before executing step, need to obtain the constraint relationship of other step implementing results.Specifically, for any two step: step
Rapid A and step B, if step A and step B meet following either condition, claiming step A and step B, there are dependences: (1) step
Rapid A must first carry out step B, and as step A, step A of next the step of needing to be implemented after step B execution before executing
It needs to execute on the basis of the implementing result of step B, also referred to as step A relies on step B；(2) step B must be first carried out before executing
Step A, and step A execute after next the step of needing to be implemented as step B, step B need step A implementing result
On the basis of execute, referred to as step B depend on step A.Obviously, there can be multiple steps dependent on step A or step B in task
Suddenly.It should be noted that claiming should if a step does not need any other step in execution task before executing in task
Step is the vertex step of task, that is, when execution task the step of first execution.
Illustrate the definition of a task with a specific example:
Task definition: task X.
Step definition: task X includes step X1, step X2, step X3, step X4, step X5, step X6.Wherein, step
X3 includes two sub-steps: step X3-1, step X3-2；Step X6 includes three sub-steps: step X6-1, step X6-2, step
Rapid X6-3.
The definition of step dependence: step X1 is vertex step；Step X2, step X3 needs to be implemented step before executing
X1；Step X4 and step X5 needs to be implemented step X2 before executing；Step X6 execute before need to be implemented step X3, step X4 and
Step X5, therefore step X6 is the last one step that task X is executed.In addition, can be relied on by storing step in the database
Definition table carrys out definition step dependence, must adjust between step if any step dependence, and amendment step is only needed to rely on definition table
, to improve the flexibility of task definition.
Below again by taking Fig. 1 as an example, the task definition in the embodiment of the present application is described in detail.As shown in Figure 1, real for the application
Apply a kind of schematic diagram of task definition in example.Task naming shown in fig. 1 be task Y, including step Y1, step Y2, step Y3,
Step Y4, step Y5, step Y6.According to task definition, a correspondence digraph as shown in Figure 1 is produced.
As shown in Figure 1, step Y1 is the vertex step of task Y；Step Y2, it before step Y3, step Y5 are executed, is required to
Execute step Y1；And in task Y, after step Y2, step Y3 has been executed, next the step of needing to be implemented is step Y4, and is walked
The premise that rapid Y4 is executed is that step Y2, step Y3 have been performed both by；It is next to need to be implemented after step Y4 and step Y5 has been performed both by
The step of be step Y6, and step Y6 execute premise be that step Y4, step Y5 have been performed both by, step Y6 is divided into step Y6-1 again
With step Y6-2.
Below with reference to Fig. 2, the execution step of task Y shown in fig. 1 is described in detail, as shown in Fig. 2, being the embodiment of the present application
A kind of flow diagram of middle task executing method, Fig. 2 shows task executing method can be applied to task Y shown in fig. 1.It needs
It is noted that each step in the process of implementation, both defines execution state, and according to the currently performed shape of step in task
State update execution state, specifically include: in executing failure, being completed, execute, dispatch neutralization it is inactive.With the first processing equipment
For, illustrate the step implementation procedure in predefined task.It should be noted that the first processing equipment can execute instruction to be any
Equipment, without limitation, for example, the first processing equipment be computer equipment；Predefined task is i.e. defined in advance
Task, such as task X and task Y.
First processing equipment executes each step defined in predefined task in the following way:
S201: the first processing equipment obtains predefined task.
The predefined task includes N number of step, and N is the integer greater than 1.
S202: first processing equipment generates described predefined according to existing dependence between N number of step
The corresponding execution digraph of task.
The digraph that executes is to indicate N number of step according to the oriented of the determining execution sequence of the dependence
Figure, if any two step of the dependence is not present in N number of step, the digraph instruction described any two
A step executes parallel.
It is emphasized that Fig. 2 only illustrates the implementation procedure of task by taking the first processing equipment as an example.In fact, each step
Rapid or sub-step can execute in different processing, in order to concurrent processing.To which the quantity of, processing equipment can be with
It is extending transversely, to improve calculation processing ability, therefore, the concurrent processing energy between step and in step is improved to the maximum extent
Power.In addition, task definition can be loaded into memory when system starts in order to improve performance.
S203: the step of first processing equipment is indicated according to the execution digraph executes sequence, executes described pre-
Definition task.
In S201, the first step is either step defined in the predefined task；Forerunner's dependence
Instruction: in the predefined task, and after N number of second step whole successful execution, just allow to execute the first step.
It should be noted that due in predefined task each step both define state, first step execute it is primary after, may
Failure may also be executed by running succeeded, and after first step, which executes, to fail, will retry execution, first step is just jumped after running succeeded
It crosses.
For example, when first step is step Y4 in task Y, then it is step Y2 and step that N, which is 2,2 second steps,
Y3.Can elder generation parallel execution of steps Y2 and step Y3, it is next to need to be implemented after the step Y2 and step Y3 whole successful execution
Step is step Y4, moreover, just allowing to execute step Y4 after step Y2 and step Y3 whole successful execution.In addition, step Y5
It may be a long-time step, step Y2, step Y3 and step Y4 can be executed parallel together with step Y5, and step Y4 is completed
Afterwards, meeting checking procedure Y5 whether complete by successful execution, could start to execute step Y6 later, to improve the effect of task execution
Rate.
In addition, predefined task is in the process of implementation, execution journal can be generated, three parts are divided: task execution log, step
Execution journal, sub-step execution journal.Sub-step log and step log are one-to-many relationships, if step without fractionation, that
Just have a sub-step log, if there is split, then sub-step log have it is a plurality of.It include: first in sub-step execution journal
Data including defining table can define task name, and step name realizes class, how split data, and execution thread size reads data
Size submits transaction size, log rank.And currently processed data slice, item number to be processed, has read item number, has located in total
Manage bar number, ignores item number, handles internet address (Internet protocol, IP), creation time, the time started, when completion
Between etc. information.
In S202, a kind of optional embodiment is, if undefined in the predefined task exist with the first step
Any step of the dependence is first carried out described first when then first processing equipment executes the predefined task
Step.
That is, can be first carried out when executing the predefined task described when first step is vertex step
First step.For example, first step is that step Y1 is first carried out when executing step Y in step Y1.
In S203, a kind of optional embodiment is that first processing equipment executes the first step in the following way
It is rapid:
(1) if the first step only includes a sub-steps, the sub-step is directly executed.
(2) if the first step includes M sub-steps, the M sub-steps are executed parallel, and M is whole greater than 1
Number.
For example, when first step is step Y4 in task Y, Y4 only includes a sub-steps, then directly executes this
Sub-steps；When first step is step Y6 in task Y, M 2, Y6 include 2 sub-steps, then execute this 2 sons parallel
Step.
In S203, a kind of optional embodiment is to execute if first processing equipment determines to exist in N number of step
At least two steps of failure then execute at least two steps for executing failure parallel again.
For example, when first step is step Y4 in task Y, 2 second steps are step Y2 and step Y3, because
This understands parallel execution of steps Y2 and step Y3 again if step Y2 and step Y3 execution is performed both by failure.
For S201 into S203, a kind of optional embodiment is that first processing equipment determines that the predefined task exists
Whether have sent heartbeat data in preset duration, if it is not, and determine that the operating status of the predefined task is in operation, then to
Second processing equipment sends the notification message of predefined task described in instruction trustship.By the above-mentioned means, task can be obtained in time
Operating status, so that the task trustship that will do not operated normally, has saved calculation resources.
Wherein trustship are as follows: because situations such as hardware fault causes task to be in processing when a machine performing tasks, and do not have actually
Processing.Whether b machine according to the heart time that each machine updates judges a machine unavailable, if it exceeds preset duration does not have
Heartbeat, then it is assumed that it is unavailable, then b machine modifies predefined task as the execution of b machine, this task is re-executed, reaching height can
Purpose.It briefly, is exactly that the task of faulty machine can be brought execution by the machine of normal operation.
In S203, when at least one step of the first step there are dependence any one step execute at
Whether after function, can all examine down is the step of the last one at least one described step runs succeeded, if so, described in executing
First step.
The embodiment of the present application has the advantage that (1) is based on digraph and defines task step dependence, and each step is only concerned
It relies on whether step is completed, can start；(2) multiple sub-steps, all sub-steps can be split into single stage according to definition
Then current procedures are completed to complete；(3) it realizes and is separated with configuration, different configuration combinations forms different function combinations.
In the embodiment of the present application, step can be executed by defining the execution digraph in predefined task, institute
The digraph for executing that digraph is the execution sequence for indicating that N number of step is determined according to the dependence is stated, if the N
Any two step of the dependence is not present in a step, then the digraph indicates that any two step is parallel
It executes.In addition, the execution digraph also indicates existing dependence between N number of step, thus ensure that task by
It is normally handled according to default execution precedence.Therefore, there is overlapping in the execution time of each step in any two step, and
It is not influenced between each other by whether executing failure, to be shortened whole under the premise of the predefined task of guarantee is stablized and executed
The execution time of a task, improve the execution efficiency of task.
As shown in figure 3, for a kind of structural schematic diagram of task execution device in the embodiment of the present application.
The embodiment of the present application provides a kind of task execution device, comprising: module 301 is obtained, for obtaining predefined task；
The predefined task includes N number of step；N is the integer greater than 1；Processing module 302, for according between N number of step
Existing dependence generates the corresponding execution digraph of the predefined task；The execution digraph is to indicate the N
The digraph for the execution sequence that a step is determined according to the dependence, if there is no the dependences to close in N number of step
Any two step of system, then the digraph indicates that any two step executes parallel；According to the execution digraph
The step of instruction, executes sequence, executes the predefined task.
Optionally, first step is either step in N number of step, and the processing module 302 is specifically used for: according to
Under type executes the first step: if the first step only includes a sub-steps, directly executing the sub-step；If institute
Stating first step includes M sub-steps, then executes the M sub-steps parallel, and M is the integer greater than 1.
Optionally, the processing module 302 is also used to: if undefined in the predefined task deposit with the first step
In any step of the dependence, then the first step is first carried out when executing the predefined task.
Optionally, the processing module 302 is also used to: determining whether the predefined task has sent in preset duration
Heartbeat data, if it is not, and determining that the operating status of the predefined task is then to send instruction support to pre-configuration equipment in operation
Manage the notification message of the predefined task.
Optionally, the processing module 302 is also used to: being existed in N number of step if first processing equipment determines
At least two steps for executing failure then execute at least two steps for executing failure parallel again.
Finally, it should be noted that it should be understood by those skilled in the art that, embodiments herein can provide as method, be
System or computer program product.Therefore, the application can be used complete hardware embodiment, complete software embodiment or combine software
With the form of the embodiment of hardware aspect.Moreover, it wherein includes that computer can use journey that the application, which can be used in one or more,
The computer implemented in the computer-usable storage medium (including but not limited to magnetic disk storage, optical memory etc.) of sequence code
The form of program product.
The application be referring to according to the present processes, equipment (system) and computer program product flow chart and/or
Block diagram describes.It should be understood that each process that can be realized by computer program instructions in flowchart and/or the block diagram and/or
The combination of process and/or box in box and flowchart and/or the block diagram.It can provide these computer program instructions to arrive
General purpose computer, special purpose computer, Embedded Processor or other programmable data processing devices processor to generate one
Machine, so that being generated by the instruction that computer or the processor of other programmable data processing devices execute for realizing flowing
The device for the function of being specified in journey figure one process or multiple processes and/or block diagrams one box or multiple boxes.
Obviously, those skilled in the art can carry out various modification and variations without departing from the model of the application to the application
It encloses.In this way, if these modifications and variations of the application belong within the scope of the claim of this application and its equivalent technologies, then
The application is also intended to include these modifications and variations.
Claims (10)
1. a kind of task executing method characterized by comprising
First processing equipment obtains predefined task；The predefined task includes N number of step；N is the integer greater than 1；
It is corresponding to generate the predefined task according to existing dependence between N number of step for first processing equipment
Execution digraph；The digraph that executes is to indicate that N number of step executes sequence according to what the dependence determined
Digraph, if any two step of the dependence is not present in N number of step, described in digraph instruction
Any two step executes parallel；
The step of first processing equipment is indicated according to the execution digraph executes sequence, executes the predefined task.
2. the method as described in claim 1, which is characterized in that first step is either step in N number of step, described the
One processing equipment executes the first step in the following way:
If the first step only includes a sub-steps, the sub-step is directly executed；
If the first step includes M sub-steps, the M sub-steps are executed parallel, and M is the integer greater than 1.
3. method according to claim 2, which is characterized in that the method also includes:
If in the predefined task it is undefined with the first step there are any step of the dependence, described the
The first step is first carried out when executing the predefined task in one processing equipment.
4. the method as described in claims 1 to 3 is any, which is characterized in that the method also includes:
First processing equipment determines whether the predefined task has sent heartbeat data in preset duration, if it is not, and
Determine that the operating status of the predefined task is appointed in operation, then to send to predefine described in instruction trustship to second processing equipment
The notification message of business.
5. the method as described in claims 1 to 3 is any, which is characterized in that the method also includes:
It is again parallel if first processing equipment determines at least two steps for existing in N number of step and executing failure
Execute at least two steps for executing failure.
6. a kind of task execution device characterized by comprising
Module is obtained, for obtaining predefined task；The predefined task includes N number of step；N is the integer greater than 1；
Processing module, for generating according to existing dependence between N number of step, the predefined task is corresponding to be held
Row digraph；The digraph that executes is to indicate N number of step having according to the determining execution sequence of the dependence
Xiang Tu, if any two step of the dependence is not present in N number of step, the digraph instruction is described any
Two steps execute parallel；The step of indicating according to the execution digraph executes sequence, executes the predefined task.
7. device as claimed in claim 6, which is characterized in that first step is either step in N number of step, the place
Reason module is specifically used for:
The first step is executed in the following way:
If the first step only includes a sub-steps, the sub-step is directly executed；
If the first step includes M sub-steps, the M sub-steps are executed parallel, and M is the integer greater than 1.
8. device as claimed in claim 7, which is characterized in that the processing module is also used to:
If undefined in the predefined task and first step executes institute there are any step of the dependence
The first step is first carried out when stating predefined task.
9. a kind of computer equipment, which is characterized in that including program or instruction, when described program or instruction are performed, as weighed
Benefit require any one of 1 to 5 described in method be performed.
10. a kind of storage medium, which is characterized in that including program or instruction, when described program or instruction are performed, such as right
It is required that method described in any one of 1 to 5 is performed.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910413986.8A CN110147273A (en) | 2019-05-17 | 2019-05-17 | A kind of task executing method and device |
| PCT/CN2019/110466 WO2020232951A1 (en) | 2019-05-17 | 2019-10-10 | Task execution method and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910413986.8A CN110147273A (en) | 2019-05-17 | 2019-05-17 | A kind of task executing method and device |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110147273A true CN110147273A (en) | 2019-08-20 |
Family
ID=67595550
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910413986.8A Pending CN110147273A (en) | 2019-05-17 | 2019-05-17 | A kind of task executing method and device |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN110147273A (en) |
| WO (1) | WO2020232951A1 (en) |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020232951A1 (en) * | 2019-05-17 | 2020-11-26 | 深圳前海微众银行股份有限公司 | Task execution method and device |
| WO2021047541A1 (en) * | 2019-09-09 | 2021-03-18 | 深圳前海微众银行股份有限公司 | Method and device for obtaining transaction dependency relationship in blockchain |
| TWI732501B (en) * | 2019-08-30 | 2021-07-01 | 開曼群島商創新先進技術有限公司 | Method and device for parallel execution of transactions in block chain, computer readable storage medium and computing equipment |
| WO2021136102A1 (en) * | 2019-12-31 | 2021-07-08 | 京信网络系统股份有限公司 | Chain communication service process control method and apparatus, and device and storage medium |
| CN113238533A (en) * | 2021-05-12 | 2021-08-10 | 广东美房智高机器人有限公司 | System and method for dynamically scheduling and issuing job tasks of mobile robot |
| CN114168582A (en) * | 2021-12-13 | 2022-03-11 | 平安养老保险股份有限公司 | Data verification method, system, device and medium based on data quality rule |
Family Cites Families (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103077006B (en) * | 2012-12-27 | 2015-08-26 | 浙江工业大学 | A kind of Long routine executed in parallel method based on multithreading |
| CN104679763A (en) * | 2013-11-28 | 2015-06-03 | 富士通株式会社 | Device and method for accelerating performing of workflow |
| US20180032568A1 (en) * | 2016-07-29 | 2018-02-01 | Sysomos L.P. | Computing System with Multi-Processor Platform for Accelerating Influence Maximization Computation and Related Methods |
| CN106447173A (en) * | 2016-09-05 | 2017-02-22 | 北京理工大学 | Cloud workflow scheduling method supporting any flow structure |
| CN107633125B (en) * | 2017-09-14 | 2021-08-31 | 北京仿真中心 | Simulation system parallelism identification method based on weighted directed graph |
| CN110147273A (en) * | 2019-05-17 | 2019-08-20 | 深圳前海微众银行股份有限公司 | A kind of task executing method and device |
-
2019
- 2019-05-17 CN CN201910413986.8A patent/CN110147273A/en active Pending
- 2019-10-10 WO PCT/CN2019/110466 patent/WO2020232951A1/en active Application Filing
Cited By (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020232951A1 (en) * | 2019-05-17 | 2020-11-26 | 深圳前海微众银行股份有限公司 | Task execution method and device |
| TWI732501B (en) * | 2019-08-30 | 2021-07-01 | 開曼群島商創新先進技術有限公司 | Method and device for parallel execution of transactions in block chain, computer readable storage medium and computing equipment |
| WO2021047541A1 (en) * | 2019-09-09 | 2021-03-18 | 深圳前海微众银行股份有限公司 | Method and device for obtaining transaction dependency relationship in blockchain |
| WO2021136102A1 (en) * | 2019-12-31 | 2021-07-08 | 京信网络系统股份有限公司 | Chain communication service process control method and apparatus, and device and storage medium |
| CN113238533A (en) * | 2021-05-12 | 2021-08-10 | 广东美房智高机器人有限公司 | System and method for dynamically scheduling and issuing job tasks of mobile robot |
| CN113238533B (en) * | 2021-05-12 | 2022-05-13 | 广东美房智高机器人有限公司 | System and method for dynamically scheduling and issuing job tasks of mobile robot |
| CN114168582A (en) * | 2021-12-13 | 2022-03-11 | 平安养老保险股份有限公司 | Data verification method, system, device and medium based on data quality rule |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2020232951A1 (en) | 2020-11-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110147273A (en) | A kind of task executing method and device | |
| CN110569305B (en) | Block synchronization method, device, medium and computing equipment | |
| US7779298B2 (en) | Distributed job manager recovery | |
| JP5684946B2 (en) | Method and system for supporting analysis of root cause of event | |
| CN111400011B (en) | Real-time task scheduling method, system, equipment and readable storage medium | |
| US9053263B2 (en) | Scheduling discrete event simulation | |
| CN102834806A (en) | System structure managing device, method of managing system structure, and program | |
| CN103164262B (en) | A kind of task management method and device | |
| CN111208975A (en) | Concurrent execution service | |
| CN106095483A (en) | The Automation arranging method of service and device | |
| US9380001B2 (en) | Deploying and modifying a service-oriented architecture deployment environment model | |
| CN106815080A (en) | Distributed diagram data treating method and apparatus | |
| CN111158800A (en) | Method and device for constructing task DAG based on mapping relation | |
| JP2010224894A (en) | Method and program for simulation of hybrid system | |
| CN114510317A (en) | Virtual machine management method, device, equipment and storage medium | |
| CN108536447B (en) | Operation and maintenance management method | |
| CN109995554A (en) | The control method and cloud dispatch control device of multi-stage data center active-standby switch | |
| CN109344059B (en) | Server pressure testing method and device | |
| CN107092528A (en) | A kind of distributed task dispatching method, apparatus and system | |
| CN115617480A (en) | Task scheduling method, device and system and storage medium | |
| CN104699799A (en) | Data transmission method based on cross system | |
| CN112418796B (en) | Sub-process task node activation method and device, electronic equipment and storage medium | |
| Souri | Formal specification and verification of a data replication approach in distributed systems | |
| CN112905386A (en) | Table data backup cleaning method and device based on life cycle | |
| CN111930475B (en) | Method and device for starting ETT operation |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination |