CN109840248A - A kind of work flow optimization method, device and storage medium - Google Patents
A kind of work flow optimization method, device and storage medium Download PDFInfo
- Publication number
- CN109840248A CN109840248A CN201910073267.6A CN201910073267A CN109840248A CN 109840248 A CN109840248 A CN 109840248A CN 201910073267 A CN201910073267 A CN 201910073267A CN 109840248 A CN109840248 A CN 109840248A
- Authority
- CN
- China
- Prior art keywords
- key operation
- key
- predistribution
- time span
- critical path
- 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.)
- Granted
Links
Landscapes
- Debugging And Monitoring (AREA)
Abstract
This specification embodiment provides a kind of work flow optimization method, device and storage medium, it is related to computer field, the described method includes: obtaining the resource data of each operation in initial job stream and the initial job stream to be optimized, determine the critical path and non-key operation set in the initial job stream, according to the front and back in the critical path between operation after relationship, a key operation is chosen from the critical path, according to the key operation, the resource data and system total resources rate of each predistribution operation in the non-key operation set, the concurrent job group of the key operation is determined from the non-key operation set.The handling duration that computer operation process can be shortened by this specification embodiment improves the treatment effeciency of computer.
Description
Technical field
The application belongs to computer field more particularly to a kind of work flow optimization method, device and storage medium.
Background technique
With the continuous development of Internet technology, computer carries more and more independently workings, such as: file closes
And file declustering, DB Backup and interest calculating etc..These operations combine form job stream in a certain order.Currently,
The operation flow step of computer is manually preset according to service logic.By not having influential job parallelism to hold for multiple
Row, can not only be efficiently used computer resource, but also can promote overall treatment efficiency.However, this optimization process need according to
By experienced technical staff, could be completed by the analysis of a large amount of data, feasibility is not high.Further, since computer is whole
Body processing capacity it is limited, it is parallel to execute the effect for only having improving performance in certain processing quantity, when the quantity of processing surpasses
When crossing computer process ability, it cannot achieve the effect that improving performance, or even the resource that will cause between process is fought for, and is made instead
At the reduction for the treatment of effeciency.
In practical applications, with service period dynamic change can occur for the data processing amount that computer undertakes, from theory
Upper theory, the operation flow step of computer are also required to that dynamic change occurs.In order to promote computer disposal efficiency, need constantly to make
Fixed optimal work flow, and identify that with optimization critical path be exactly to formulate the emphasis and difficult point of optimal work flow.Critical path
The processing time largely determine the total duration of flow processing, vital work is played to computer disposal efficiency
With.
In view of the above-mentioned problems, needing to propose a kind of work flow optimization method, device and storage medium, to solve computer
Work flow handles the problems such as time is long, treatment effeciency is low.
Summary of the invention
This specification embodiment is designed to provide a kind of work flow optimization method, device and storage medium, with
The processing time for shortening computer operation process, improve the treatment effeciency of computer.
To achieve the above object, this specification embodiment provides a kind of work flow optimization method, may include:
Obtain the resource data of each operation in initial job stream and the initial job stream to be optimized；Wherein, described
Resource data includes: resources occupation rate, executes time span and resource access data；
Determine the critical path and non-key operation set in the initial job stream；Wherein, the non-key operation set
It closes including the predistribution operation in the initial job stream in addition to the critical path；
According to the front and back in the critical path between operation after relationship, a crucial work is chosen from the critical path
Industry；
It is total according to the resource data of predistribution operation each in the key operation, the non-key operation set and system
Resource utilization determines the concurrent job group of the key operation from the non-key operation set；Wherein, the concurrent job group
Including one or more predistribution operations executed parallel with the key operation.
Further, in other embodiments of the method, critical path in the determination initial job stream,
May include:
According to preset critical path method, the critical path in initial job stream is repeatedly optimized, is obtained described first
Critical path in beginning job stream.
Further, described according to the key operation, the non-key operation in other embodiments of the method
The resource data of each operation and system total resources rate in set determine the key operation from the non-key operation set
Concurrent job group, may include:
Data are accessed according to the resource of predistribution operation each in key operation and non-key operation set, judge each institute
It states and conflicts between predistribution operation and the key operation with the presence or absence of resource occupation；
If there is no resource occupation between each predistribution operation and the key operation to conflict, by each institute
It states predistribution operation and is determined as the operation executed parallel with the key operation, and then obtain the concurrent job of the key operation
Group.
Further, described to be determined as each predistribution operation and institute in other embodiments of the method
The operation that key operation executes parallel is stated, and then obtains the concurrent job group of the key operation, can also include:
Obtain the 5th operation and the 6th operation in concurrent job group；
Judge between the 5th operation and the 6th operation with the presence or absence of front and back after relationship；
If there are front and backs between the 5th operation and the 6th operation after relationship, judge the 5th operation and
Whether the accumulative execution time span of the 6th operation is greater than the first execution time span of key operation；
If the accumulative execution time span of the 5th operation and the 6th operation is not greater than the first of key operation
Time span is executed, then is sequentially executed the 5th operation after relationship according to front and back with the 6th operation, and then obtain institute
State the concurrent job group of key operation.
Further, described according to the key operation, the non-key operation in other embodiments of the method
The resource data of each operation and system total resources rate in set determine the key operation from the non-key operation set
Concurrent job group, can also include:
Cumulative summation is carried out to the resources occupation rate of the first alternative operation each in concurrent job group, obtains key operation
First simultaneous resource rate；
Judge whether the first simultaneous resource rate is greater than the corresponding resources left rate for executing the period of the key operation；
If the first simultaneous resource rate is greater than the resources left rate, by resource occupation in the concurrent job group
The smallest first concurrent job of rate is deleted, the second concurrent job group after being deleted；
Cumulative summation is carried out to the resources occupation rate of the second alternative operation each in the second concurrent job group, obtains institute
State the second simultaneous resource rate of key operation；
Judge whether the second simultaneous resource rate is greater than the resources left rate；
If the second simultaneous resource rate is not greater than the resources left rate, the second concurrent job group is determined
For the concurrent job group of the key operation.
Further, in other embodiments of the method, the second concurrent job group is being determined as the pass
After the concurrent job group of key operation, can also include:
Time span and first is executed by the second of each second alternative operation and executes time span progress size comparison, is sentenced
Whether the first execution time span of breaking, which is greater than described second, executes time span；Wherein, described first time span is executed
For the corresponding time span for executing the period of key operation；
If described first, which executes time span, is greater than the second execution time span, the time is executed to described first
Length and the second execution time span carry out seeking difference operation, obtain third and execute time span；
Judge that the third executes the 4th execution time span whether time span is greater than the first concurrent job；
If the third, which executes time span, is greater than the 4th execution time span, by second concurrent job
Group and first concurrent job are combined, and obtain the concurrent job group of the key operation；Wherein, the described second parallel work
The execution sequence of each second alternative operation in industry group is prior to first concurrent job.
Further, in other embodiments of the method, by each predistribution operation be determined as with it is described
Before the operation that key operation executes parallel, can also include:
According to the front and back in non-key operation set between operation after relationship, judge whether deposit in non-key operation set
After operation before pre-allocating operation；Wherein, before described after operation be operation of the execution sequence prior to the predistribution operation；
If the predistribution made after operation before there is no the predistribution operation in non-key operation set
Industry is determined as the operation executed parallel with key operation.
Further, in other embodiments of the method, by each predistribution operation be determined as with it is described
Before the operation that key operation executes parallel, can also include:
Judge whether the 5th execution time span for pre-allocating operation is greater than the first of key operation and executes time span；
If the described 5th, which executes time span, is greater than the first execution time span, when executing according to the described 5th
Between length determine that the predistribution operation is corresponding and continuously perform the period；
Period, the determining multiple key operations executed with the predistribution job parallelism are continuously performed according to described；Its
In, multiple key operations are continuous in critical path；
Judge that multiple key operations conflict with the predistribution operation with the presence or absence of resource occupation；
Conflict if multiple key operations do not have resource occupation with the predistribution operation, by the predistribution
Operation is determined as the operation executed parallel with the key operation.
Further, in other embodiments of the method, it is determined as and the key by the predistribution operation
After the operation that job parallelism executes, can also include:
According to the resource data of the multiple key operations executed with predistribution job parallelism, in conjunction with the resource of predistribution operation
Data update the corresponding resources left rate for executing the period of multiple key operations.
Further, in other embodiments of the method, the money of each operation in obtaining the initial job stream
Before source data, can also include:
According to the history data of operation each in initial job stream, judge whether each operation is in peak
Phase；
If each operation is in peak period, according to history data, increases for each operation and execute
Time and resources occupation rate allowance.
Further, in other embodiments of the method, according to the key operation, the non-key operation set
The resource data of each operation and system total resources rate in conjunction determine the key operation from the non-key operation set
After concurrent job group, can also include:
The optimum results of third concurrent job each in key operation and concurrent job group are showed into user；
User is received to the operational order of the key operation and each third concurrent job；
According to the operational order, the optimum results of initial job stream are generated.
On the other hand, this specification embodiment provides a kind of work flow optimization device, the apparatus may include:
Module is obtained, can be used for obtaining the money of each operation in initial job stream and the initial job stream to be optimized
Source data；Wherein, the resource data includes: resources occupation rate, executes time span and resource access data；
Determining module, the critical path being determined in the initial job stream and non-key operation set；Wherein,
The non-key operation set includes the predistribution operation in the initial job stream in addition to the critical path；
Module is chosen, can be used for according to the front and back in the critical path between operation after relationship, from the critical path
A key operation is chosen in diameter；
The determining module can be also used for according to each pre- point in the key operation, the non-key operation set
Resource data and system total resources rate with operation determine the parallel work of the key operation from the non-key operation set
Industry group；Wherein, the concurrent job group includes one or more predistribution operations executed parallel with the key operation.
Another aspect, this specification embodiment provide a kind of computer storage medium again, are stored thereon with computer journey
Sequence, the realization when computer program is executed by processor:
Obtain the resource data of each operation in initial job stream and the initial job stream to be optimized；Wherein, described
Resource data includes: resources occupation rate, executes time span and resource access data；
Determine the critical path and non-key operation set in the initial job stream；Wherein, the non-key operation set
It closes including the predistribution operation in the initial job stream in addition to the critical path；
According to the front and back in the critical path between operation after relationship, a crucial work is chosen from the critical path
Industry；
It is total according to the resource data of predistribution operation each in the key operation, the non-key operation set and system
Resource utilization determines the concurrent job group of the key operation from the non-key operation set；Wherein, the concurrent job group
Including one or more predistribution operations executed parallel with the key operation.
A kind of work flow optimization method, device and the storage medium that this specification embodiment provides, by obtaining to excellent
The resource data of each operation in the initial job stream of change and the initial job stream, then determine the pass in the initial job stream
Key path and non-key operation set, according to the front and back in the critical path between operation after relationship, from the critical path
One key operation of middle selection, finally according to predistribution operation each in the key operation, the non-key operation set
Resource data and system total resources rate determine the concurrent job group of the key operation from the non-key operation set.It should
Method can efficiently solve the problems, such as to substantially reduce by brought by artificial setting work flow by software realization
The processing time of computer operation process, improve computer disposal efficiency.
Detailed description of the invention
In order to illustrate the technical solutions in the embodiments of the present application or in the prior art more clearly, to embodiment or will show below
There is attached drawing needed in technical description to be briefly described, it should be apparent that, the accompanying drawings in the following description is only this
The some embodiments recorded in application, for those of ordinary skill in the art, in the premise of not making the creative labor property
Under, it is also possible to obtain other drawings based on these drawings.
Fig. 1 is the method flow schematic diagram for the work flow optimization method that some embodiments of this specification provide；
Fig. 2 is the modular structure schematic diagram for the work flow optimization device that some embodiments of this specification provide；
Fig. 3 is the optimum results schematic diagram for the work flow optimization method that some embodiments of this specification provide；
Fig. 4 is the optimum results schematic diagram for the work flow optimization method that other embodiments of this specification provide；
Fig. 5 is the structural schematic diagram for the computer storage medium that some embodiments of this specification provide.
Specific embodiment
In order to make those skilled in the art better understand the technical solutions in the application, below in conjunction with the application reality
The attached drawing in example is applied, the technical scheme in the embodiment of the application is clearly and completely described, it is clear that described implementation
Example is merely a part but not all of the embodiments of the present application.Based on the embodiment in the application, this field is common
The application protection all should belong in technical staff's every other embodiment obtained without making creative work
Range.
With the continuous development of Internet technology, computer carries more and more independently workings.These operations according to
Certain sequence combines to form job stream.Currently, the operation flow step of computer is manually preset according to service logic.
By not having influential job parallelism to execute for multiple, computer resource can not only be efficiently used, but also whole place can be promoted
Manage efficiency.However, this optimization process is needed by experienced technical staff, it could be complete by the analysis of a large amount of data
At feasibility is not high.Further, since computer entirety ability is limited, it is parallel to execute only in certain processing quantity
There is the effect of improving performance, when the quantity of processing is more than computer process ability, cannot achieve the effect that improving performance, very
It is fought for the resource between the process that will cause, causes the reduction for the treatment of effeciency instead.To solve the above-mentioned problems, by obtaining to excellent
The resource data of each operation in the initial job stream of change and the initial job stream, then determine the pass in the initial job stream
Key path and non-key operation set, according to the front and back in the critical path between operation after relationship, from the critical path
One key operation of middle selection, finally according to predistribution operation each in the key operation, the non-key operation set
Resource data and system total resources rate determine the concurrent job group of the key operation from the non-key operation set, from
And the processing time of computer operation process is shortened, improve computer disposal efficiency.
Fig. 1 is the method flow schematic diagram for the work flow optimization method that some embodiments of this specification provide, this explanation
The work flow optimization method that some embodiments of book provide may include:
S101: the resource data of each operation in initial job stream and the initial job stream to be optimized is obtained, wherein
The resource data includes: resources occupation rate, executes time span and resource access data.
In some embodiments of this specification, the job stream is combined in a certain order by multiple independently workings
Made of.The job stream is executed by following predetermined order, predetermined process target can be completed.The structure of the job stream can
To be tree-shaped or reticular structure, the application to this with no restriction.The initial job stream can be led by Visio document form
Enter, be also possible to other modes importing, the application to this with no restriction.The resource data of each operation in the initial job stream
The form that can be scanning table imports, and is also possible to the mode of hand input-data, the application to this with no restriction.The money
Source occupancy is mean unit resources occupation rate in corresponding each job execution time, the resources occupation rate and described holds
Row time span can be to be obtained according to the average value of history data, and the resource access data are also possible to according to each
The history access resource data of operation obtains.
S102: the critical path and non-key operation set in the initial job stream are determined, wherein the non-key work
Industry set includes the predistribution operation in the initial job stream in addition to the critical path.
It, can be according to preset critical path method, to the pass in initial job stream in some embodiments of this specification
Key path is repeatedly optimized, and the critical path in the initial job stream is obtained.Wherein, the multiple optimization can be primary
Or optimize more than once, the application to this with no restriction.The critical path refer to design in from be input to output pass through
Be delayed longest logical path.In process of optimization, it can be used repeatedly critical path method, until key can not be can be reduced
Until path delay.Critical path is usually the progress active sequences for determining work flow, it is longest path in job stream,
Even if very little, which is floated, may also directly affect the earliest finish time of entire job stream.Can have in one job stream multiple parallel
Critical path, multiple critical paths can carry out certain combination, to realize the shortest activity duration.It is described non-key
Operation set is determined by critical path, once the critical path has determined, correspondingly, in the non-key operation set
Each of non-key operation also determine that.In some specific embodiments, an existing critical path is divided
Analysis, in conjunction with work flow and resource contention table, judges whether the critical path can change or/and compress, if it can,
It then repeatedly optimizes, is changed or/and compressed critical path.
In some embodiments of this specification, it is assumed that have found 3 critical paths from initial job stream, respectively
L1: operation A- > operation B- > operation C, L2: operation E- > operation F- > operation G and L3: operation P- > operation Q- >
Operation R, wherein front and back in every key between operation is determining, but critical path L1, critical path L2 and pass after relationship
The execution sequence of key path L3 is uncertain, that is to say, that can between critical path L1, critical path L2 and critical path L3
It is executed with parallel connection, is also possible to series connection and executes, for example: critical path L1, critical path L2 and critical path L3 parallel connection execute；
Or, critical path L1 and critical path L2 parallel connection execute, and execution of connecting with critical path L3；Or, critical path L1 and key
Path L3 parallel connection executes, and execution of connecting with critical path L2；Or, critical path L1, critical path L2 and critical path L3 two
It is series connection execution etc. between two.By the way that above-mentioned 3 critical paths to be combined according to series connection and/or in parallel execute, altogether may be used
To obtain 13 kinds of different combination critical paths, total execution time by combining this 13 kinds critical path is compared, directly
To finding the shortest combination critical path of a time-consuming.It is worth noting that, by critical path L1, critical path L2 and/or
When critical path L3 parallel connection executes, since computer resource rate occupancy is big, when being performed simultaneously other operations, it is easy to appear money
Source congestion, the execution time delays of the combination critical path after leading in parallel execute, can be by history data, initial
It repeats to use critical path method in job stream, until can not can be reduced critical path delay.
S103: according to the front and back in the critical path between operation after relationship, one is chosen from the critical path
Key operation.
It, can be according to the front and back in the preset critical path between operation after pass in some embodiments of the present application
System sequentially chooses a key operation from the critical path.For example: assuming that a critical path are as follows: operation 1- > operation
2- > operation 3- > operation 4- > operation 5- > operation 6- > operation 7- > operation 8- > operation 9, according between operation
Front and back after relationship, the execution sequence of the execution sequence highest of operation 1, operation 9 is minimum.So choosing a key operation is to make
Industry 1 is operation 2 when the concurrent job group of operation 1 has determined and then chosen next key operation, when the parallel work of operation 2
After industry group has determined, and choosing next key operation is operation 3, after the concurrent job group of operation 3 has determined, and is selected
Taking next key operation is operation 4, after the concurrent job group of operation 4 has determined, and chooses next key operation and is
Operation 5, after the concurrent job group of operation 5 has determined, and choosing next key operation is operation 6, parallel when operation 6
After operation group has determined, and choosing next key operation is operation 7, after the concurrent job group of operation 7 has determined, again
Choosing next key operation is operation 8, after the concurrent job group of operation 8 has determined, finally chooses next crucial work
Industry is operation 9, determines the concurrent job group of operation 9.
S104: according in the key operation, the non-key operation set it is each predistribution operation resource data and
System total resources rate determines the concurrent job group of the key operation from the non-key operation set, wherein described parallel
Operation group includes one or more predistribution operations executed parallel with the key operation.
It optionally, can be according to each in key operation and non-key operation set in some embodiments of the present application
The resource for pre-allocating operation accesses data, judges between each predistribution operation and the key operation with the presence or absence of resource
Conflict is occupied, is conflicted if there is no resource occupation between each predistribution operation and the key operation, it will be each
The predistribution operation is determined as the operation executed parallel with the key operation, and then obtains the parallel work of the key operation
Industry group.
1 resource of table accesses tables of data
In some specific embodiments, as shown in table 1, since operation A and operation B needs while accessing database 2,
So operation A and operation B cannot be executed parallel.It occupies, therefore cannot hold with other job parallelisms since operation C belongs to high CPU again
Row, if run simultaneously, may influence the treatment effeciency of host.Operation A and operation D does not access identical resource simultaneously again,
Therefore it can run simultaneously.It is worth noting that, when two operations read same file simultaneously, it can be by described two operations simultaneously
Row executes.But if an operation is to read the file, and this document or two operations is written simultaneously in while carrying an operation
This document is written, then described two file in parallel cannot be executed.
Optionally, described to be determined as each predistribution operation and the pass in some embodiments of the present application
The operation that key job parallelism executes, and then the concurrent job group of the key operation is obtained, it can be by obtaining concurrent job group
In the 5th operation and the 6th operation, judge between the 5th operation and the 6th operation with the presence or absence of front and back after relationship,
If there are front and backs between the 5th operation and the 6th operation after relationship, the 5th operation and the described 6th are judged
Whether the accumulative execution time span of operation is greater than the first execution time span of key operation, if the 5th operation and institute
The accumulative execution time span for stating the 6th operation is not greater than the first of key operation and executes time span, then by the 5th operation
It is sequentially executed according to front and back after relationship with the 6th operation, and then obtains the concurrent job group of the key operation.
In some specific embodiments, it is assumed that in concurrent job group corresponding to key operation 1, there are operation A, make
Industry B, operation D, operation H and operation T, wherein there are front and backs after relationship between operation A and operation H, that is to say, that operation A is first
It is performed in operation H or operation H is performed prior to operation A.If the execution time span of key operation 1 is 10 minutes, operation A
Execution time span be 5 minutes, the execution time span of operation H is 8 minutes, due to 5+8=13 minute, greater than key operation
1 execution time span, therefore can be according to the front and back between operation A and operation H after relationship, it will be preceding after operation, for example: operation A
Or one of them in operation H, the concurrent job as key operation 1.If the execution time span of key operation 1 is 15 points
Clock, the execution time span of operation A are 5 minutes, and the execution time span of operation H is 8 minutes, due to 5+8=13 points, are less than and close
The execution time span of key operation 1, thus can within the corresponding execution period of key operation 1, according to operation A and operation H it
Between front and back after relationship, after operation or subsequent job before successively executing, for example: first carry out operation A, it is rear to execute operation H；Or, first
Operation H is executed, it is rear to execute operation A.Wherein, the preceding execution sequence after operation executes sequence prior to the subsequent job.
Optionally, described according to the key operation, the non-key operation set in other embodiments of the application
The resource data of each operation and system total resources rate in conjunction determine the key operation from the non-key operation set
Concurrent job group can carry out cumulative summation to the resources occupation rate of the first alternative operation each in concurrent job group, obtain
First simultaneous resource rate of key operation, when judging whether the first simultaneous resource rate is greater than the key operation correspondence execution
Between section resources left rate, then it is tired to being carried out to the resources occupation rate of the second alternative operation each in the second concurrent job group
Add summation, obtain the second simultaneous resource rate of the key operation, finally judges whether the second simultaneous resource rate is greater than institute
Resources left rate is stated, if the second simultaneous resource rate is not greater than the resources left rate, by second concurrent job
Group is determined as the concurrent job group of the key operation.
In some specific embodiments, it is assumed that in concurrent job group corresponding to key operation 1, including operation A, work
Industry B, operation E, operation G, operation M, operation P, operation S and operation T, wherein the resources occupation rate of operation A are as follows: 10%, operation
The resources occupation rate of B is 8%, and the resources occupation rate of operation E is 12%, and the resources occupation rate of operation M is 2%, the resource of operation P
Occupancy is 5%, and the resources occupation rate of operation S is 11% and the resources occupation rate of operation T is 7%, if the key operation 1
The corresponding resources left rate for executing the period is 60%, then according to operation A, operation B, operation E, operation G, operation M, operation P, work
The resources occupation rate of industry S and operation T add up, and the first simultaneous resource rate that obtains is 55%, and it is right to be less than the key operation 1
The resources left rate 60% of period should be executed, then by each operation group in key operation 1 and the concurrent job group, and
Row executes.
Optionally, in other embodiments of the application, the second concurrent job group is being determined as the key
After the concurrent job group of operation, time span and first can also be executed by the second of each second alternative operation and execute the time
Length carries out size comparison, judges whether the first execution time span is greater than described second and executes time span, wherein institute
Stating the first execution time span is the corresponding time span for executing the period of key operation, if the first execution time is long
Degree is greater than described second and executes time span, then executes time span to described first and the second execution time span carries out
Difference operation is sought, third is obtained and executes time span, judges that the third executes whether time span is greater than the first concurrent job
4th executes time span, is greater than the described 4th if the third executes time span and executes time span, by described the
Two concurrent job groups and first concurrent job are combined, and obtain the concurrent job group of the key operation, wherein described
The execution sequence of each second alternative operation in second concurrent job group is prior to first concurrent job.
In some specific embodiments, it is assumed that in concurrent job group corresponding to key operation 1, including operation A, work
Industry B, operation E, operation G, operation M, operation P, operation S and operation T, wherein the resources occupation rate of operation A are as follows: 10%, operation
The resources occupation rate of B is 8%, and the resources occupation rate of operation E is 12%, and the resources occupation rate of operation M is 2%, the resource of operation P
Occupancy is 5%, and the resources occupation rate of operation S is 11% and the resources occupation rate of operation T is 7%, if the key operation 1
The corresponding resources left rate for executing the period is 54%, then according to operation A, operation B, operation E, operation G, operation M, operation P, work
The resources occupation rate of industry S and operation T add up, and the first simultaneous resource rate that obtains is 55%, and it is right to be greater than the key operation 1
The resources left rate 54% of period should be executed, then by key operation 1, operation A, operation B, operation E, operation G, operation P, operation
S and operation T, it is parallel to execute, and due to operation A, operation B, operation E, operation G, operation P, operation S and operation T, respectively with
The accumulative execution time span of operation M is respectively less than the first execution time span of key operation 1, therefore can be by the operation M
It is executed as the concurrent job of key operation 1, and in operation A, operation B, operation E, operation G, operation P, operation S or/and operation T
It is executed after complete, the as crucial work of combination of operation A, operation B, operation E, operation G, operation P, operation S, operation T and operation M
The concurrent job group of industry 1.
Optionally, in other embodiments of the application, it is determined as and the pass by each predistribution operation
It, can also be according to the front and back in non-key operation set between operation after relationship, judgement before the operation that key job parallelism executes
In non-key operation set with the presence or absence of predistribution operation before after operation, wherein it is described before after operation be execution sequence first
In the operation of the predistribution operation, if after operation before there is no the predistribution operation in non-key operation set,
The predistribution operation is then determined as the operation executed parallel with key operation.
In some specific embodiments, it is assumed that in concurrent job group corresponding to key operation 1, including operation A, work
Industry B, operation E, operation G, operation M, operation P, operation S and operation T, when judging whether operation Q can be determined as key operation 1
Concurrent job when, if operation A, operation B, operation E, operation G, operation M, operation P, operation S and operation T are not the work
Industry Q's is preceding when operation, then operation Q can be determined as to the concurrent job of key operation 1.
Optionally, in other embodiments of the application, it is determined as and the pass by each predistribution operation
Before the operation that key job parallelism executes, it can also judge whether the 5th execution time span for pre-allocating operation is greater than crucial work
The first of industry executes time span, if the described 5th executes time span greater than the first execution time span, basis
The 5th execution time span determines that the predistribution operation is corresponding and continuously performs the period, continuously performs further according to described
Period, the determining multiple key operations executed with the predistribution job parallelism, wherein multiple key operations are in key
It is continuously, finally to judge that multiple key operations conflict with the predistribution operation with the presence or absence of resource occupation in path,
Conflict if multiple key operations do not have resource occupation with the predistribution operation, the predistribution operation is determined
For the operation executed parallel with the key operation.
In some specific embodiments, when judging that can operation A execute parallel with key operation 1, it is assumed that operation A
Corresponding 5th execution time span is 20 minutes, and it is 10 minutes that key operation 1 corresponding first, which executes time span, if crucial
There is no resource occupation conflict in operation 1 and operation A, and operation A is greater than the execution time span of key operation 1, then judgement and pass
Whether there are resource occupation to conflict with operation A for next key operation 2 that the execution of key operation 1 is connected in order, if 2 He of key operation
There is no resource occupation conflict in operation A, and it is 12 minutes that key operation 2 corresponding first, which executes time span, and crucial work yet
Total execution length 22 minutes of industry 1 and key operation 2 are greater than operation A the corresponding 5th and execute time span 20 minutes, therefore will make
Industry A is determined as executing parallel with key operation 1, and also executes parallel with key operation.
Optionally, in other embodiments of the application, it is determined as and the crucial work by the predistribution operation
After the operation that industry executes parallel, the resource data of multiple key operations of acceptable basis and predistribution job parallelism execution,
In conjunction with the resource data of predistribution operation, the corresponding resources left rate for executing the period of multiple key operations is updated.For example,
When operation A is determined as executing parallel with key operation 1 and key operation 2, accounted for according to the execution time span and resource of operation A
With rate, key operation 1 and the corresponding resources left rate for executing the period of key operation 2 are determined, the resources left rate can be
Unit resource surplus ratio.
Optionally, in other embodiments of the application, the resource of each operation in obtaining the initial job stream
Before data, it can also judge whether each operation is located according to the history data of operation each in initial job stream
In peak period, if each operation is in peak period, according to history data, increases for each operation and execute
Time and resources occupation rate allowance.For example: if current date is the peak period of loan repayment business, to avoid mistake, phase of providing a loan
Execution time and resources occupation rate allowance can be increased by closing important operation, or without optimization.Wherein to important operation without
Optimization, refer to and keep the front and back connection relationship of the important operation constant, that is to say, that it is described be connected with important operation it is previous
A or multiple important operations are constant, or/and, the latter or multiple important operations being connected with important operation are constant.
Optionally, in other embodiments of the application, according to the key operation, the non-key operation set
In each operation resource data and system total resources rate, determined from the non-key operation set key operation and
After row operation group, the optimum results of third concurrent job each in key operation and concurrent job group can also be showed use
Family, and receive user to the operational order of the key operation and each third concurrent job, according to the operational order,
Generate the optimum results of initial job stream.
Table 2 is carried out after repeatedly optimizing to initial job stream,, can be with when system is assessed in conjunction with history data
The assessment situation of reference.It is as shown in table 2 to assess principle, whether is important operation according to operation each in job stream, provides difference
Optimizing Suggestions.It specifically, can be according to the impact of performance after optimization when for important operation or operation group, it is determined whether into
Row optimization.For example: if the performance boost after optimization is smaller, it is not recommended that optimization；If the performance boost after optimization is obvious,
It can determine whether to optimize by user.When for insignificant operation or operation group, it can also be imitated according to the performance after optimization
Fruit, it is determined whether optimize.For example: if the performance boost after optimization is smaller, being confirmed whether to optimize by user；Such as
Performance boost after fruit optimization is obvious, then automatically confirms that optimization by system.It is worth noting that, the important operation or operation
Group, insignificant operation or insignificant operation group, can obtain according to historical data analysis, can also be customized with user, this
Apply to this with no restriction.The performance boost is smaller and performance boost obviously to can be user customized, for example: working as performance
When being lifted beyond 30%, it can be assumed that it is obvious for performance boost, or, when performance boost is lower than 5%, it can be assumed that being mentioned for performance
Liter is smaller, and specific limit can voluntarily preset according to the actual situation, and the application is not construed as limiting this.
Table 2 assesses situation
| Important operation/operation group | Insignificant operation/operation group | |
| It is promoted after optimization obvious | User determines whether to optimize | System automatically confirms that optimum results |
| It is promoted after optimization smaller | Do not optimize | User is confirmed whether to optimize |
In some specific embodiments, as shown in Figure 3.Fig. 3 is the job stream that some embodiments of this specification provide
The optimum results schematic diagram of journey optimization method.According to initial job stream, critical path method is used by repeating, obtains an optimization
Critical path afterwards, as shown in Figure 3, wherein the critical path includes: operation 1, operation 2, operation 3, operation 4, operation 5, makees
Industry 6 and operation 7, wherein in above-mentioned operation, according to executing front and back after relationship ranking from front to back are as follows: 1 > operation of operation, 2 > operation 3 >
6 > operation of operation 4 > operation, 5 > operation 7, non-key operation set include: operation A, operation B, operation C, operation D, operation E, operation
F and operation G, according to the optimization method in some embodiments of this specification, it is determined that the concurrent job group of operation 1 is operation group 1,
The concurrent job of operation 2 is operation group 2, and the concurrent job group of operation 3 is operation group 3, and the concurrent job group of operation 4 is operation group
4 and operation group 5, the concurrent job group of operation 5, operation 6 and operation 7 be operation group 4.
In other specific embodiments, as shown in figure 4, Fig. 4 is the work that other embodiments of this specification provide
The optimum results schematic diagram of industry flow optimization method.As the resources left rate of the period as corresponding to operation 1 and operation 2 is
, therefore the execution period of operation 1 and operation 2 is merged, a united execution period is obtained, such as the time in Fig. 4
Section 1, the resources left rate of the period 1 is determined by the system resource surplus ratio after embeding operation 1 or operation 2.Similarly, it obtains
The period is executed to the joint of operation 5 and operation 6, as shown in the period 4 in Fig. 4.In this mode, available critical path
The corresponding multiple joints of diameter execute the period, such as period 1 to the period 5 in Fig. 4.Significantly, since operation F with
Operation 4, operation 5, operation 6 and operation 7 are parallel to be executed, and the execution time span of operation F is 20 minutes, is less than operation 4, makees
Industry 5, total execution time span 33 minutes of operation 6 and operation 7, after having executed operation F, operation 7 is corresponding to execute the period
Resources left rate can change, and need resource surplus ratio in the more new job 7 corresponding period.
In some embodiments of this specification, each operation resource on the same day can be accessed situation and operating statistic by system
Data save as historical record, to meet in subsequent job is flow-optimized, judge whether current date is in the need of peak traffic
It asks.For example: according to historical record, analysis obtain monthly No. 28 be credit card repayment day, then can be determined that monthly No. 28 refund
Operation belongs to the peak traffic phase.
It is worth noting that, above-described embodiment and embodiment are intended merely to facilitate explanation this specification, may be used also based on this
To obtain other embodiments and embodiment, this specification to this with no restriction.
Although this application provides the method operating procedure as described in embodiment or flow chart, based on conventional or noninvasive
The labour for the property made may include more or less operating procedure.The step of enumerating in embodiment sequence is only numerous steps
One of execution sequence mode, does not represent and unique executes sequence.It, can be according to embodiment when device in practice executes
Either method sequence shown in the drawings executes or executes (such as environment of parallel processor or multiple threads) parallel.
Based on work flow optimization method described above, this specification one or more embodiment additionally provides a kind of work
Industry process optimization device.The device may include used this specification embodiment the method system (including distribution
Formula system), software (application), module, component, server, client etc. and combine the necessary device for implementing hardware.Based on same
One innovation thinking, the device in one or more embodiments that this specification embodiment provides is as described in the following examples.By
It is similar to method in the implementation that device solves the problems, such as, therefore this illustrates that the embodiment of the specific device of embodiment can be with
Referring to the implementation of preceding method, overlaps will not be repeated.Used below, term " unit " or " module " may be implemented
The combination of the software and/or hardware of predetermined function.Although device described in following embodiment is preferably realized with software,
The realization for being the combination of hardware or software and hardware is also that may and be contemplated.
Specifically, Fig. 2 is the modular structure schematic diagram for the work flow optimization device that some embodiments of this specification provide.
As shown in Fig. 2, the self-help terminal equipment provided in some embodiments of this specification may include: to obtain module 201, determining module
202, module 203 is chosen.
Module 201 is obtained, can be used for obtaining each operation in initial job stream and the initial job stream to be optimized
Resource data；Wherein, the resource data includes: resources occupation rate, executes time span and resource access data；
Determining module 202, the critical path being determined in the initial job stream and non-key operation set；Its
In, the non-key operation set includes the predistribution operation in the initial job stream in addition to the critical path；
Module 203 is chosen, it can be according to the front and back in the critical path between operation after relationship, from the critical path
One key operation of middle selection；
The determining module 202 can be also used for according to each pre- in the key operation, the non-key operation set
The resource data and system total resources rate for distributing operation determine the parallel of the key operation from the non-key operation set
Operation group；Wherein, the concurrent job group includes one or more predistribution operations executed parallel with the key operation.
The device that above-described embodiment illustrates can specifically realize by computer chip or entity, or by having certain function
Can product realize.For convenience of description, it is divided into various modules when description apparatus above with function to describe respectively.Implementing
The function of each module can be realized in the same or multiple software and or hardware when the application.It is of course also possible to will realize
The module of certain function combines realization by multiple submodule or subelement.
To achieve the above object, the structural schematic diagram for the computer storage medium that some embodiments of this specification provide, such as
It is described the apparatus may include memory, processor and the computer program being stored on the memory shown in Fig. 5
Computer program can execute following steps when being run by the processor:
Obtain the resource data of each operation in initial job stream and the initial job stream to be optimized；Wherein, described
Resource data includes: resources occupation rate, executes time span and resource access data；
Determine the critical path and non-key operation set in the initial job stream；Wherein, the non-key operation set
It closes including the predistribution operation in the initial job stream in addition to the critical path；
According to the front and back in the critical path between operation after relationship, a crucial work is chosen from the critical path
Industry；
It is total according to the resource data of predistribution operation each in the key operation, the non-key operation set and system
Resource utilization determines the concurrent job group of the key operation from the non-key operation set；Wherein, the concurrent job group
Including one or more predistribution operations executed parallel with the key operation.
Work flow optimization method, device and the storage medium that this specification provides, first by obtain it is to be optimized just
The resource data of each operation in beginning job stream and the initial job stream, then by critical path method, determine the initial work
Critical path after optimizing in industry stream, and further determines that non-key operation set, further according to operation in the critical path it
Between front and back after relationship, a key operation is chosen from the critical path, finally according to the key operation, the non-pass
The resource data and system total resources rate of each predistribution operation in key operation set are determined from the non-key operation combination
The concurrent job group of the key operation repeats to obtain key operation, and determines the concurrent job group of each key operation, until
All non-key operations are determined, and are effectively shortened the handling duration of computer operation process, are improved computer
Treatment effeciency.
It is above-mentioned that this specification specific embodiment is described.Other embodiments are in the scope of the appended claims
It is interior.In some cases, the movement recorded in detail in the claims or step can be come according to the sequence being different from embodiment
It executes and desired result still may be implemented.In addition, process depicted in the drawing not necessarily require show it is specific suitable
Sequence or consecutive order are just able to achieve desired result.In some embodiments, multitasking and parallel processing be also can
With or may be advantageous.
The above-mentioned work flow optimization method and device that this specification embodiment provides can be in a computer by processors
Corresponding program instruction is executed to realize, such as using the C Plus Plus of windows operating system in the realization of the end PC, Linux system reality
It is existing or other for example using android, iOS system programming language in intelligent terminal realization, and based on quantum computer
Processing logic realize etc..
In the 1990s, the improvement of a technology can be distinguished clearly be on hardware improvement (for example,
Improvement to circuit structures such as diode, transistor, switches) or software on improvement (improvement for method flow).So
And with the development of technology, the improvement of current many method flows can be considered as directly improving for hardware circuit.
Designer nearly all obtains corresponding hardware circuit by the way that improved method flow to be programmed into hardware circuit.Cause
This, it cannot be said that the improvement of a method flow cannot be realized with hardware entities module.For example, programmable logic device
(Programmable Logic Device, PLD) (such as field programmable gate array (Field Programmable Gate
Array, FPGA)) it is exactly such a integrated circuit, logic function determines device programming by user.By designer
Voluntarily programming comes a digital display circuit " integrated " on a piece of PLD, designs and makes without asking chip maker
Dedicated IC chip 2.Moreover, nowadays, substitution manually makes IC chip, and this programming is also used instead mostly
" logic compiler (logic compiler) " software realizes that software compiler used is similar when it writes with program development
Seemingly, and the source code before compiling also handy specific programming language is write, this is referred to as hardware description language
(Hardware Description Language, HDL), and HDL is also not only a kind of, but there are many kind, such as ABEL
(Advanced Boolean Expression Language)、AHDL(Altera Hardware Description
Language)、Confluence、CPUL(Cornell University Programming Language)、HDCal、JHDL
(Java Hardware Description Language)、Lava、Lola、MyHDL、PALASM、RHDL(Ruby
Hardware Description Language) etc., VHDL (Very-High-Speed is most generally used at present
Integrated Circuit Hardware Description Language) and Verilog2.Those skilled in the art
It will be apparent to the skilled artisan that only needing method flow slightly programming in logic and being programmed into integrated circuit with above-mentioned several hardware description languages
In, so that it may it is readily available the hardware circuit for realizing the logical method process.
It is also known in the art that in addition to realizing client, server in a manner of pure computer readable program code
In addition, completely can by by method and step carry out programming in logic come so that client, server with logic gate, switch, dedicated
The form of integrated circuit, programmable logic controller (PLC) and insertion microcontroller etc. realizes identical function.Therefore this client,
Server is considered a kind of hardware component, and can also be considered as to the device for realizing various functions for including in it
Structure in hardware component.Or even, can will be considered as realizing the device of various functions either implementation method
Software module can be the structure in hardware component again.
As seen through the above description of the embodiments, those skilled in the art can be understood that the application can
It realizes by means of software and necessary general hardware platform.Based on this understanding, the technical solution essence of the application
On in other words the part that contributes to existing technology can be embodied in the form of software products, the computer software product
It can store in storage medium, such as ROM/RAM, magnetic disk, CD, including some instructions are used so that a computer equipment
(can be personal computer, server or the network equipment etc.) executes each embodiment of the application or embodiment
Method described in certain parts.
Each embodiment in this specification is described in a progressive manner, same and similar between each embodiment
Part may refer to each other, what each embodiment stressed is the difference with other embodiments.In particular, needle
For the embodiment of server, client, device and computer storage medium, it is referred to the implementation of preceding method
The introduction of mode, which compares, to be explained.
The application can describe in the general context of computer-executable instructions executed by a computer, such as program
Module.Generally, program module includes routines performing specific tasks or implementing specific abstract data types, programs, objects, group
Part, data structure etc..It can also be determined in environment in distribution and practice the application, determined in environment in these distributions, by
Task is executed by the connected remote processing devices of communication network.It is determined in environment in distribution, program module can be with
In the local and remote computer storage media including storage equipment.
Although depicting the application by embodiment, it will be appreciated by the skilled addressee that there are many deformations by the application
With variation without departing from spirit herein, it is desirable to which the attached claims include these deformations and change without departing from the application
Spirit.
Claims (14)
1. a kind of work flow optimization method, which is characterized in that the described method includes:
Obtain the resource data of each operation in initial job stream and the initial job stream to be optimized；Wherein, the resource
Data include: resources occupation rate, execute time span and resource access data；
Determine the critical path and non-key operation set in the initial job stream；Wherein, the non-key operation set packet
Include the predistribution operation in the initial job stream in addition to the critical path；
According to the front and back in the critical path between operation after relationship, a key operation is chosen from the critical path；
According to the resource data and system total resources of predistribution operation each in the key operation, the non-key operation set
Rate determines the concurrent job group of the key operation from the non-key operation set；Wherein, the concurrent job group includes
One or more predistribution operations executed parallel with the key operation.
2. the method according to claim 1, wherein the critical path in the determination initial job stream,
Include:
According to preset critical path method, the critical path in initial job stream is repeatedly optimized, obtains the initial work
Critical path in industry stream.
3. the method according to claim 1, wherein described according to the key operation, the non-key operation
The resource data of each operation and system total resources rate in set determine the key operation from the non-key operation set
Concurrent job group, comprising:
Data are accessed according to the resource of predistribution operation each in key operation and non-key operation set, are judged each described pre-
Conflict between distribution operation and the key operation with the presence or absence of resource occupation；
It, will be each described pre- if there is no resource occupation between each predistribution operation and the key operation to conflict
Distribution operation is determined as the operation executed parallel with the key operation, and then obtains the concurrent job group of the key operation.
4. according to the method described in claim 3, it is characterized in that, it is described by each predistribution operation be determined as with it is described
The operation that key operation executes parallel, and then obtain the concurrent job group of the key operation, further includes:
Obtain the 5th operation and the 6th operation in concurrent job group；
Judge between the 5th operation and the 6th operation with the presence or absence of front and back after relationship；
If there are front and backs between the 5th operation and the 6th operation after relationship, the 5th operation and described is judged
Whether the accumulative execution time span of the 6th operation is greater than the first execution time span of key operation；
If the accumulative execution time span of the 5th operation and the 6th operation is not greater than the first execution of key operation
5th operation is then sequentially executed according to front and back after relationship with the 6th operation, and then obtains the pass by time span
The concurrent job group of key operation.
5. according to the method described in claim 3, it is characterized in that, described according to the key operation, the non-key operation
The resource data of each operation and system total resources rate in set determine the key operation from the non-key operation set
Concurrent job group, further includes:
Cumulative summation is carried out to the resources occupation rate of the first alternative operation each in concurrent job group, obtains the first of key operation
Simultaneous resource rate；
Judge whether the first simultaneous resource rate is greater than the corresponding resources left rate for executing the period of the key operation；
If the first simultaneous resource rate is greater than the resources left rate, most by resources occupation rate in the concurrent job group
The first small concurrent job is deleted, the second concurrent job group after being deleted；
Cumulative summation is carried out to the resources occupation rate of the second alternative operation each in the second concurrent job group, obtains the pass
Second simultaneous resource rate of key operation；
Judge whether the second simultaneous resource rate is greater than the resources left rate；
If the second simultaneous resource rate is not greater than the resources left rate, the second concurrent job group is determined as institute
State the concurrent job group of key operation.
6. according to the method described in claim 5, it is characterized in that, the second concurrent job group is determined as the key
After the concurrent job group of operation, further includes:
Time span and first is executed by the second of each second alternative operation and executes time span progress size comparison, judges institute
State whether the first execution time span is greater than the second execution time span；Wherein, described first time span is executed to close
The corresponding time span for executing the period of key operation；
If described first, which executes time span, is greater than the second execution time span, time span is executed to described first
It carries out seeking difference operation with the second execution time span, obtains third and execute time span；
Judge that the third executes the 4th execution time span whether time span is greater than the first concurrent job；
Be greater than the described 4th if the third executes time span and execute time span, will the second concurrent job group with
First concurrent job is combined, and obtains the concurrent job group of the key operation；Wherein, the second concurrent job group
In each second alternative operation execution sequence prior to first concurrent job.
7. according to the method described in claim 3, it is characterized in that, being determined as and the pass by each predistribution operation
Before the operation that key job parallelism executes, further includes:
According to the front and back in non-key operation set between operation after relationship, judge in non-key operation set with the presence or absence of pre-
Distribute the preceding after operation of operation；Wherein, before described after operation be operation of the execution sequence prior to the predistribution operation；
If after operation before there is no the predistribution operation in non-key operation set, the predistribution operation is true
It is set to the operation executed parallel with key operation.
8. according to the method described in claim 3, it is characterized in that, being determined as and the pass by each predistribution operation
Before the operation that key job parallelism executes, further includes:
Judge whether the 5th execution time span for pre-allocating operation is greater than the first of key operation and executes time span；
If the described 5th, which executes time span, is greater than the first execution time span, it is long to execute the time according to the described 5th
Degree determines that the predistribution operation is corresponding and continuously performs the period；
Period, the determining multiple key operations executed with the predistribution job parallelism are continuously performed according to described；Wherein, more
A key operation is continuous in critical path；
Judge that multiple key operations conflict with the predistribution operation with the presence or absence of resource occupation；
Conflict if multiple key operations do not have resource occupation with the predistribution operation, by the predistribution operation
It is determined as the operation executed parallel with the key operation.
9. according to the method described in claim 8, it is characterized in that, being determined as and the crucial work by the predistribution operation
After the operation that industry executes parallel, further includes:
According to the resource data of the multiple key operations executed with predistribution job parallelism, in conjunction with the number of resources of predistribution operation
According to the corresponding resources left rate for executing the period of the multiple key operations of update.
10. the method according to claim 1, wherein in obtaining the initial job stream each operation money
Before source data, further includes:
According to the history data of operation each in initial job stream, judge whether each operation is in peak period；
If each operation is in peak period, according to history data, increases for each operation and execute the time
With resources occupation rate allowance.
11. the method according to claim 1, wherein according to the key operation, the non-key operation set
The resource data of each operation and system total resources rate in conjunction determine the key operation from the non-key operation set
After concurrent job group, further includes:
The optimum results of third concurrent job each in key operation and concurrent job group are showed into user；
User is received to the operational order of the key operation and each third concurrent job；
According to the operational order, the optimum results of initial job stream are generated.
12. a kind of work flow optimizes device, which is characterized in that described device includes:
Module is obtained, for obtaining the resource data of each operation in initial job stream and the initial job stream to be optimized；
Wherein, the resource data includes: resources occupation rate, executes time span and resource access data；
Determining module, for determining critical path and non-key operation set in the initial job stream；Wherein, the non-pass
Key operation set includes the predistribution operation in the initial job stream in addition to the critical path；
Module is chosen, for, after relationship, choosing from the critical path according to the front and back in the critical path between operation
One key operation；
The determining module is also used to according to predistribution operation each in the key operation, the non-key operation set
Resource data and system total resources rate determine the concurrent job group of the key operation from the non-key operation set；Its
In, the concurrent job group includes one or more predistribution operations executed parallel with the key operation.
13. a kind of work flow optimizes device, including memory, processor and the computer being stored on the memory
Program, which is characterized in that the computer program executes following steps when being run by the processor:
Obtain the resource data of each operation in initial job stream and the initial job stream to be optimized；Wherein, the resource
Data include: resources occupation rate, execute time span and resource access data；
Determine the critical path and non-key operation set in the initial job stream；Wherein, the non-key operation set packet
Include the predistribution operation in the initial job stream in addition to the critical path；
According to the front and back in the critical path between operation after relationship, a key operation is chosen from the critical path；
According to the resource data and system total resources of predistribution operation each in the key operation, the non-key operation set
Rate determines the concurrent job group of the key operation from the non-key operation set；Wherein, the concurrent job group includes
One or more predistribution operations executed parallel with the key operation.
14. a kind of computer storage medium, is stored thereon with computer program, which is characterized in that the computer program is located
Reason device performs the steps of when executing
Obtain the resource data of each operation in initial job stream and the initial job stream to be optimized；Wherein, the resource
Data include: resources occupation rate, execute time span and resource access data；
Determine the critical path and non-key operation set in the initial job stream；Wherein, the non-key operation set packet
Include the predistribution operation in the initial job stream in addition to the critical path；
According to the front and back in the critical path between operation after relationship, a key operation is chosen from the critical path；
According to the resource data and system total resources of predistribution operation each in the key operation, the non-key operation set
Rate determines the concurrent job group of the key operation from the non-key operation set；Wherein, the concurrent job group includes
One or more predistribution operations executed parallel with the key operation.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910073267.6A CN109840248B (en) | 2019-01-25 | 2019-01-25 | Operation flow optimization method and device and storage medium |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910073267.6A CN109840248B (en) | 2019-01-25 | 2019-01-25 | Operation flow optimization method and device and storage medium |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109840248A true CN109840248A (en) | 2019-06-04 |
| CN109840248B CN109840248B (en) | 2021-03-02 |
Family
ID=66884149
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910073267.6A Active CN109840248B (en) | 2019-01-25 | 2019-01-25 | Operation flow optimization method and device and storage medium |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109840248B (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112037017A (en) * | 2020-09-01 | 2020-12-04 | 中国银行股份有限公司 | Method, device and equipment for determining batch processing job evaluation result |
| CN112036751A (en) * | 2020-09-01 | 2020-12-04 | 中国银行股份有限公司 | Method and device for identifying process key operation nodes |
| CN112200461A (en) * | 2020-10-12 | 2021-01-08 | 中国农业银行股份有限公司 | Method and device for predicting critical path, electronic equipment and computer storage medium |
| WO2023030230A1 (en) * | 2021-09-03 | 2023-03-09 | International Business Machines Corporation | Using a machine learning module to determine a group of execution paths of program code and a computational resource allocation to use to execute the group of execution paths |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2475256A1 (en) * | 2002-02-05 | 2003-08-14 | Sourcespring Software, Llc | Batch processing job streams using and/or precedence logic |
| CN103838621A (en) * | 2012-11-27 | 2014-06-04 | 中国电信股份有限公司 | Method and system for scheduling routine work and scheduling nodes |
| CN106896895A (en) * | 2017-01-11 | 2017-06-27 | 广东工业大学 | A kind of heterogeneous system dynamic power consumption optimization method based on AOV gateway key path queries |
| CN107239335A (en) * | 2017-06-09 | 2017-10-10 | 中国工商银行股份有限公司 | The job scheduling system and method for distributed system |
| CN108459966A (en) * | 2018-03-21 | 2018-08-28 | 东软集团股份有限公司 | Dispatching method, device, equipment and the computer readable storage medium of test suite |
| US10417044B2 (en) * | 2017-04-21 | 2019-09-17 | International Business Machines Corporation | System interventions based on expected impacts of system events on scheduled work units |
-
2019
- 2019-01-25 CN CN201910073267.6A patent/CN109840248B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CA2475256A1 (en) * | 2002-02-05 | 2003-08-14 | Sourcespring Software, Llc | Batch processing job streams using and/or precedence logic |
| CN103838621A (en) * | 2012-11-27 | 2014-06-04 | 中国电信股份有限公司 | Method and system for scheduling routine work and scheduling nodes |
| CN106896895A (en) * | 2017-01-11 | 2017-06-27 | 广东工业大学 | A kind of heterogeneous system dynamic power consumption optimization method based on AOV gateway key path queries |
| US10417044B2 (en) * | 2017-04-21 | 2019-09-17 | International Business Machines Corporation | System interventions based on expected impacts of system events on scheduled work units |
| CN107239335A (en) * | 2017-06-09 | 2017-10-10 | 中国工商银行股份有限公司 | The job scheduling system and method for distributed system |
| CN108459966A (en) * | 2018-03-21 | 2018-08-28 | 东软集团股份有限公司 | Dispatching method, device, equipment and the computer readable storage medium of test suite |
Non-Patent Citations (1)
| Title |
|---|
| 彭世锦等: ""大数据模型调度***的关键问题研究"", 《中国优秀硕士学位论文全文数据库 信息科技辑》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112037017A (en) * | 2020-09-01 | 2020-12-04 | 中国银行股份有限公司 | Method, device and equipment for determining batch processing job evaluation result |
| CN112036751A (en) * | 2020-09-01 | 2020-12-04 | 中国银行股份有限公司 | Method and device for identifying process key operation nodes |
| CN112036751B (en) * | 2020-09-01 | 2023-08-22 | 中国银行股份有限公司 | Method and device for identifying key operation nodes of process |
| CN112037017B (en) * | 2020-09-01 | 2024-06-21 | 中国银行股份有限公司 | Method, device and equipment for determining evaluation result of batch processing operation |
| CN112200461A (en) * | 2020-10-12 | 2021-01-08 | 中国农业银行股份有限公司 | Method and device for predicting critical path, electronic equipment and computer storage medium |
| WO2023030230A1 (en) * | 2021-09-03 | 2023-03-09 | International Business Machines Corporation | Using a machine learning module to determine a group of execution paths of program code and a computational resource allocation to use to execute the group of execution paths |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109840248B (en) | 2021-03-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN109840248A (en) | A kind of work flow optimization method, device and storage medium | |
| EP1868087B1 (en) | System and method for configuration application programs | |
| CN101356522B (en) | Dynamically repositioning computer implementation system to workflow by end users | |
| CN102187317B (en) | Flashcopy handling | |
| KR102549994B1 (en) | Systems and methods for performing data processing operations using variable level parallelism | |
| US20080133209A1 (en) | System and Method for Implementing a Unified Model for Integration Systems | |
| CN104423960A (en) | Continuous project integration method and continuous project integration system | |
| Damij et al. | An approach to optimizing Kanban board workflow and shortening the project management plan | |
| CN112805696A (en) | Multi-step query execution in SQL servers | |
| CN103500185B (en) | A kind of method and system based on multi-platform data generation tables of data | |
| CN106897123B (en) | Database operation method and device | |
| CN109063180A (en) | A kind of data processing method, device, equipment and computer readable storage medium | |
| CN111008235A (en) | Spark-based small file merging method and system | |
| Song et al. | Parallel machine scheduling under uncertainty: Models and exact algorithms | |
| US6571146B1 (en) | Method for updating feature recipes in a history-based solid model | |
| CN106156971B (en) | Logistics resource collaborative relationship information processing method and device | |
| CN108470072B (en) | A kind of query compiler method and apparatus | |
| US20220405665A1 (en) | Method and device for managing project by using data merging | |
| Filho et al. | Asynchronous teams for joint lot-sizing and scheduling problem in flow shops | |
| CN114780021B (en) | Copy repairing method and device, electronic equipment and storage medium | |
| Allam | Estimate the Performance of Cloudera Decision Support Queries. | |
| Adikara et al. | Combining Organization Goal-Oriented Elicitation and Wireframe for Fishery Product Sales Mobile Application Design | |
| US11748809B2 (en) | Computer-readable recording medium storing trading program, trading method and trading device | |
| US11573960B2 (en) | Application-based query transformations | |
| JP2005108147A (en) | Optimum decision-making supporting method and program |
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 | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |