CN110348818A - A kind of the process intelligent processing method and system of flow engine - Google Patents
A kind of the process intelligent processing method and system of flow engine Download PDFInfo
- Publication number
- CN110348818A CN110348818A CN201910643835.1A CN201910643835A CN110348818A CN 110348818 A CN110348818 A CN 110348818A CN 201910643835 A CN201910643835 A CN 201910643835A CN 110348818 A CN110348818 A CN 110348818A
- Authority
- CN
- China
- Prior art keywords
- processed
- historical data
- time
- flow
- flow engine
- 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
- 238000000034 method Methods 0.000 title claims abstract description 255
- 230000008569 process Effects 0.000 title claims abstract description 215
- 238000003672 processing method Methods 0.000 title claims abstract description 17
- 241001269238 Data Species 0.000 claims description 4
- 230000002035 prolonged effect Effects 0.000 claims 1
- 238000012550 audit Methods 0.000 description 27
- 230000000977 initiatory effect Effects 0.000 description 7
- 238000010586 diagram Methods 0.000 description 3
- 238000005516 engineering process Methods 0.000 description 3
- 238000007689 inspection Methods 0.000 description 3
- 230000004044 response Effects 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 230000000694 effects Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 230000003068 static effect Effects 0.000 description 2
- 230000008859 change Effects 0.000 description 1
- 238000010276 construction Methods 0.000 description 1
- 238000007405 data analysis Methods 0.000 description 1
- 230000007812 deficiency Effects 0.000 description 1
- 238000005111 flow chemistry technique Methods 0.000 description 1
- 238000007726 management method Methods 0.000 description 1
- 238000009877 rendering Methods 0.000 description 1
- 238000012163 sequencing technique Methods 0.000 description 1
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/10—Office automation; Time management
- G06Q10/103—Workflow collaboration or project management
Landscapes
- Business, Economics & Management (AREA)
- Human Resources & Organizations (AREA)
- Strategic Management (AREA)
- Engineering & Computer Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Operations Research (AREA)
- Economics (AREA)
- Marketing (AREA)
- Data Mining & Analysis (AREA)
- Quality & Reliability (AREA)
- Tourism & Hospitality (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention discloses the process intelligent processing methods and system of a kind of flow engine, which comprises step S1 is detected and obtained process to be processed；Step S2, detects whether the process to be processed has historical data, when detecting the historical data of the process to be processed, calculates the acceptable maximum delay time of process current procedures to be processed according to the historical data of the process to be processed；Step S3, process queue to be processed is formed to institute's process to be handled according to the acceptable maximum delay time of process current procedures to be processed, the processing of process flow is treated according to process queue completion to be processed, the present invention can be while ensuring to obtain processing in the critical workflow reasonable time, guarantee throughput of system, and regulation flow process engine number of nodes in appropriate circumstances, to achieve the purpose that reasonable utilization operation cost.
Description
Technical field
The present invention relates to intelligence to build cooperation platform technical field, at a kind of process intelligence of flow engine
Manage method and system.
Background technique
It is construction applications informationization comprehensive platform, the cloud meter collectively constituted by multiple funtion parts that intelligence, which builds cooperation platform,
Calculate platform.Wherein flow engine controls all auditing flow normal operations, is most crucial one of the part of cooperation platform.All
Audit stream and data flow require to drive and operate by flow engine, in addition, flow engine also needs control authority, notice
Message, the subsystem of multiple complexity such as document rendering, is the performance bottleneck of part and system most busy in system.Thus
It is exactly that under fixed resource distribution, how allocation flow can make to assist to flow engine with a serious problem of comparison
Make platform and guarantee that critical workflow data can be handled in time, and can ensure that system has sufficiently large handling capacity.
Existing flow engine is all the strategy adjusted using static state when process flow, for example uses queue plan
Slightly, the process first submitted is first processed, and this mode can generally guarantee the handling capacity of system well, but be directed to some keys
Process not can guarantee enough response speeds；Also there is scheme using precedence scheme, the process with higher priority
Can be preferential processed, compared with queue scheme, although this scheme can guarantee the response speed of critical workflow, sacrifices and be
System handling capacity.
The scheme of above-mentioned flow engine process flow is all to be pre-designed certain regular allocation flow into flow engine, is belonged to
In static scheme, while can not all accomplishing to guarantee handling capacity, rationally utilizes resource and guarantee critical workflow to greatest extent
Handling capacity, basic reason is under fixed flow engine resource situation no matter which kind of mode all cannot be guarantee system
Handling capacity, and guarantee the flow processing response time, result can all generate certain delay.
Under non-cloud environment, the process of only one project of system or an enterprise needs process flow quantity simultaneously
Seldom, delay will not be stacked into a unacceptable stage, and existing strategy is also able to satisfy system performance requirements substantially.But
In cloud computing environment, there is thousands of corporate process that processing is needed to handle on the same cloud, corresponding speed and handling capacity
Two very crucial indexs are reformed into, any delay disposal can be all amplified until unacceptable.
Summary of the invention
In order to overcome the deficiencies of the above existing technologies, purpose of the present invention is to provide a kind of process intelligence of flow engine
Can processing method and system, while ensuring to obtain processing in the critical workflow reasonable time, to guarantee throughput of system, and
Regulation flow process engine number of nodes in situation appropriate, to achieve the purpose that reasonable utilization operation cost.
In order to achieve the above object, the present invention proposes a kind of process intelligent processing method of flow engine, include the following steps:
Step S1 is detected and is obtained process to be processed；
Step S2, detects whether the process to be processed has historical data, in the historical data for detecting the process to be processed
When, which is calculated according to the historical data of the process to be processed；
Step S3, according to the acceptable maximum delay time of process current procedures to be processed to institute's process shape to be handled
At process queue to be processed, the processing for treating process flow is completed according to the process queue to be processed.
Preferably, further include following steps before step S2:
After flow engine starting, the historical data of the processed all processes of loading system.
Preferably, in step S2, the operation in historical data between current procedures node and next step node is obtained
Multiple sample datas of time interval take its mean value as the acceptable maximum delay time of current procedures.
Preferably, further include following steps in step S3:
The absolute time for obtaining the process previous step user's operation to be processed, utilizes the exhausted of previous step user's operation
The user for estimating out the process current procedures to be processed is added with the acceptable maximum delay time of current procedures to the time
The desired operation time carries out existing process to be processed according to user's desired operation time of the process current procedures to be processed
Sequence forms the process queue to be processed.
Preferably, it in step S2, if the process to be processed does not have historical data, is directly added into described wait locate
It manages in process queue, and user is estimated as current time the desired operation time.
In order to achieve the above objectives, the present invention also provides a kind of process intelligent processing systems of flow engine, comprising:
Process detecting unit to be processed, for detecting and obtaining process to be processed；
Maximum delay time computing unit, for detecting whether the process to be processed has historical data, in detecting
When stating the historical data of process to be processed, the process to be processed is calculated according to the historical data of the process to be processed and is currently walked
Rapid acceptable maximum delay time；
Queue formed unit, for according to the acceptable maximum delay time of the process current procedures to be processed to institute
Process to be handled forms process queue to be processed, and the processing for treating process flow is completed according to the process queue to be processed.
Preferably, the system comprises:
Historical data loading unit is used for after flow engine starting, the processed all processes of loading system
Historical data.
Preferably, the maximum delay time computing unit is used for through current procedures node in acquisition historical data under
Multiple sample datas at the operating time interval between one step node take its mean value to prolong as the acceptable maximum of current procedures
The slow time.
Preferably, the queue forms the absolute time that unit is used to obtain the process previous step user's operation to be processed
Between, it is added using the absolute time of previous step user's operation with the acceptable maximum delay time of current procedures and estimates out institute
The user's desired operation time for stating process current procedures to be processed it is expected to grasp according to the user of the process current procedures to be processed
Making the time is ranked up existing process to be processed, forms the process queue to be processed.
Preferably, if the maximum delay time computing unit detects that the process to be processed does not have historical data,
It is directly added into the process queue to be processed, and user is estimated as current time the desired operation time.
Compared with prior art, a kind of process intelligent processing method of flow engine of the present invention and system, which pass through, utilizes big number
According to analytical technology, according to the historical data of process flows all in platform, when calculating the maximum acceptable delay of process to be processed
Between, to provide data reference for flow engine process flow, flow engine prolongs according to currently pending process is maximum acceptable
Late, rational management and processing can guarantee throughput of system while ensuring to obtain processing in the critical workflow reasonable time.?
In situation appropriate can also regulation flow process engine number of nodes, to achieve the purpose that reasonable utilization operation cost.
Detailed description of the invention
Fig. 1 is the schematic diagram of the auditing flow of the embodiment of the present invention；
Fig. 2 is a kind of step flow chart of the process intelligent processing method of flow engine of the present invention；
Fig. 3 is a kind of system architecture diagram of the process intelligent processing system of flow engine of the present invention；
Fig. 4 is the flow chart of the process intelligent processing method of flow engine in the specific embodiment of the invention.
Specific embodiment
Below by way of specific specific example and embodiments of the present invention are described with reference to the drawings, those skilled in the art can
Understand further advantage and effect of the invention easily by content disclosed in the present specification.The present invention can also pass through other differences
Specific example implemented or applied, details in this specification can also be based on different perspectives and applications, without departing substantially from
Various modifications and change are carried out under spirit of the invention.
It for each process to be processed, is usually made of multiple processing steps, such as a typical auditing flow, usually
It is made of multiple audit steps.Such as auditing flow shown in FIG. 1, by " initiation ", " audit one ", " audit two ", " completion " four
A step composition.
After each step usually submits step to act by the user of certain role, execution is responsible for by flow engine.For example it uses
Family one has submitted " initiation " movement, after flow engine receives the movement, will do it a series of inspection, including permission, shape
State, condition inspection etc., after inspection passes through, according to flow definition, flow engine executes the flow state to " audit one "
Step.At the same time, the user two with " audit one " permission is notified by various modes.The user two is waited to submit simultaneously
Flow engine is arrived in " audit " movement.Repeatedly, it is finally completed the process.
Generally, " audit one " step that flow engine is submitted from " initiation " step for executing user's submission to execution user
Centre has certain time interval, and flow engine does not need any movement during this period, only an asynchronous waiting process.
If the asynchronous waiting process after some step can be predicted, can postpone the execution opportunity of previous step, and
Delay will not be brought to the user of subsequent step.It, will be if user two can be predicted such as the auditing flow of Fig. 1
User one submits " initiation " step the latter hour that can just execute " audit one " step, then when user one has submitted " initiation " step
After rapid, flow engine can not be immediately performed, and " initiation " step is just executed when close to a hour, as long as guaranteeing to use
Family one executes " initiation " step before the expected time, ensures that user two will not experience delay.Because having enough
Time retardation executes step, and the opportunistic scheduling for just having given flow engine many completes other process steps for being badly in need of executing.
Fig. 2 is a kind of step flow chart of the process intelligent processing method of flow engine of the present invention.As shown in Fig. 2, this hair
A kind of process intelligent processing method of bright flow engine, includes the following steps:
Step S1 is detected and is obtained process to be processed.Specifically, when detecting process to be processed, such as detect
A certain auditing flow, after generation, flow engine will read the process to be processed.
Step S2, detects whether the process to be processed has historical data, in the historical data for detecting the process to be processed
When, which is calculated according to the historical data of the process to be processed.
Correlative study shows that the behavior of user and historical data often have very high similitude.For example, being examined for some
Core process, the time interval desired value that user specifically operates each step are often highly stable.Therefore, the present invention from this
A rule is set out, and speculates process (such as auditing flow) f to be processed using following formulanIn step node smAcceptable maximum
Delay time are as follows:
Wherein Tp(fn,sm) it is process f to be processednIn step node smBetween operating time between next step node
Every k indicates sample size in historical data, from the same flow type historical data of same client, its average value is taken to make
For expectation, this value is a relative time span.
In order to calculate the acceptable maximum delay time of process to be processed, it is necessary to the historical data of process to be processed is obtained,
Therefore, further include following steps before step S2:
After flow engine starting, the historical data of the processed all processes of loading system, the historical data includes
But be not limited to the operating time point of each node of each step of each process, the absolute time and system-computed of operation cross to Mr. Yu
The maximum of a process can delay time etc., invention is not limited thereto.
Step S3 carries out institute's process to be handled according to the acceptable maximum delay time of process current procedures to be processed
Sequence, forms process queue to be processed, completes the processing for treating process flow in order according to the process queue to be processed.At this
In invention specific embodiment, flow engine can be according to the acceptable maximum delay time of process to be processed to institute's stream to be handled
Journey sequence, for example, according to acceptable maximum delay time by small to being ranked up greatly, maximum can delay time shorter more row
In front, process queue to be processed is formed, process flow is successively then treated according to the sequencing of queue and is handled.
Preferably, in step S3, the absolute time of process previous step user's operation to be processed can be also obtained, before utilization
The absolute time (being generally regarded as current time) and the acceptable maximum delay time of current procedures of one step user's operation
It is added and obtains the discreet value of user's desired operation time of the process current procedures to be processed, then worked as according to the process to be processed
User's desired operation time of preceding step is ranked up existing process to be processed, forms the process queue to be processed, for example, stream
Journey flow engine is completed to treat processing stream in order according to the user's desired operation time for the process current procedures to be processed estimated
The processing of journey.I.e. user's desired operation time calculates as follows:
T=C+E (fn,sm)
Wherein C is current time stamp.
Preferably, in step S2, if the process to be processed does not have historical data, directly it is added into the stream to be processed
In journey queue, and user is estimated as current time the desired operation time, i.e., acceptable maximum delay time is set as 0.
Fig. 3 is a kind of system architecture diagram of the process intelligent processing system of flow engine of the present invention.As shown in figure 3, this hair
A kind of process intelligent processing system of bright flow engine, comprising:
Process detecting unit 201 to be processed, for detecting and obtaining process to be processed.Specifically, when detecting wait locate
When managing process, such as a certain auditing flow, after generation, the process detecting unit 201 to be processed of flow engine will detect this
Process to be processed.
Maximum delay time computing unit 202, for detecting whether the process to be processed has historical data, in detecting this
When the historical data of process to be processed, calculating the process current procedures to be processed according to the historical data of the process to be processed can be connect
The maximum delay time received.
Correlative study shows that the behavior of user and historical data often have very high similitude.For example, being examined for some
Core process, the time interval desired value that user specifically operates each step are highly stable.Therefore, maximum delay time meter
Unit 202 is calculated from this rule, speculates process (such as auditing flow) f to be processed using following formulanIn step smIt can connect
The maximum delay time received are as follows:
Wherein Tp(fn,sm) it is process f to be processednIn step node smBetween operating time between next step node
Every k indicates sample size in historical data.
In order to calculate the acceptable maximum delay time of process to be processed, it is necessary to the historical data of process to be processed is obtained,
Therefore, the invention also includes:
Historical data loading unit 203, for after flow engine starting, the processed all processes of loading system to be gone through
History data, the historical data include but is not limited to the operating time point of each node of each step of each process, the absolute time of operation
Between and system-computed cross for the maximum of some process can delay time etc., invention is not limited thereto.
Queue forms unit 204, is used for according to the acceptable maximum delay time of process current procedures to be processed to all
Process to be processed is ranked up, and forms process queue to be processed, is completed in order according to the process queue to be processed to be processed
The processing of process.In the specific embodiment of the invention, the queue of flow engine formed unit 204 can according to process to be processed can
The maximum delay time of receiving sorts to institute's process to be handled, for example, according to acceptable maximum delay time by it is small to greatly into
Row sequence, it is maximum can delay time it is shorter more come front, process queue to be processed is formed, then according to the successive suitable of queue
Sequence is successively treated process flow and is handled.
Preferably, queue, which forms unit 204, can also obtain the absolute time of process previous step user's operation to be processed, benefit
With the absolute time (being generally regarded as current time) of previous step user's operation and the acceptable maximum delay of current procedures
Time is added the user's desired operation time for estimating out the process current procedures to be processed, then current according to the process to be processed
User's desired operation time of step is ranked up existing process to be processed, the process queue to be processed is formed, for example, queue
Unit 204 is formed according to the user's desired operation time for the process current procedures to be processed estimated, completes to treat place in order
Manage the processing of process.
Preferably, if maximum delay time computing unit 202 detects that the process to be processed does not have historical data, directly
Be added into the process queue to be processed, and user estimated as current time the desired operation time, i.e., it is acceptable most
Big delay time is set as 0.
Fig. 4 is the flow chart of the process intelligent processing method of flow engine in the specific embodiment of the invention.Have in the present invention
In body embodiment, after start-up, the historical data of the processed process of loading system first, which includes it for flow engine
What preceding system-computed was crossed can delay time for the maximum of some process；After thering is new process to be processed to generate, flow engine
The historical data for first checking whether the process to be processed is being got after the historical data of process in place, then basis should
The historical data of process to be processed calculates the acceptable maximum delay time of process to be processed, and flow engine is to be processed according to this
The acceptable maximum delay time of process is ranked up existing process to be processed, all correctly arranges in institute's process queue to be handled
After sequence, flow engine handles corresponding process according to queue sequence.If not finding corresponding historical data, process is drawn
It holds up, is directly added into the process queue to be processed, and user is estimated as current time the desired operation time
The maximum delay time of receiving is set as 0.
If having an auditing flow there are three step 123, corresponding three user A B C are operated, according to
The treatment process of the prior art, flow engine is as follows:
1. user A submits audit request.
2. flow engine handles audit request, B is sent messages to.
3. waiting
4.B sees prompting message or audit, opens corresponding list, fills in and submit audit.
5. flow engine handles audit request, C is sent messages to.
6. waiting
7.C sees prompting message or audit, opens corresponding list, fills in and submit audit.
8. flow engine handles audit request, and completes the process.
According to the present invention, the treatment process of flow engine is as follows:
1. the audit request that user A submits step 1；
2. waiting, when flow engine handles delay disposal audit request, the i.e. acceptable maximum delay of calculating step 1
Between；
3. reaching the maximum acceptable delay time of the step 1, flow engine handles audit request, sends messages to use
Family B；
4. user B sees prompting message or audit, corresponding list is opened, fills in and the audit of step 2 is submitted to request；
5. waiting, when flow engine handles delay disposal audit request, the i.e. acceptable maximum delay of calculating step 2
Between；
6. reaching the maximum acceptable delay time of the step 2, flow engine handles audit request, sends messages to use
Family C.
7. user C sees prompting message or audit, corresponding list is opened, fills in and the audit of step 3 is submitted to request.
8. flow engine handles audit request, and completes the process.
As it can be seen that compared with prior art, the present invention essentially consists in delay flow engine and handles this movement, and the purpose is to the greatest extent
The time of flow engine processing may be postponed, to obtain bigger dispatching flexibility.
In conclusion the process intelligent processing method and system of a kind of flow engine of the present invention are by utilizing big data analysis
Technology calculates the maximum acceptable delay time of process to be processed according to the historical data of process flows all in platform, thus
Data reference is provided for flow engine process flow, flow engine is according to the maximum acceptable delay of currently pending process, rationally
Scheduling and processing can guarantee throughput of system while ensuring to obtain processing in the critical workflow reasonable time.In feelings appropriate
Under condition can also regulation flow process engine number of nodes, to achieve the purpose that reasonable utilization operation cost.
The above-described embodiments merely illustrate the principles and effects of the present invention, and is not intended to limit the present invention.Any
Without departing from the spirit and scope of the present invention, modifications and changes are made to the above embodiments by field technical staff.Therefore,
The scope of the present invention, should be as listed in the claims.
Claims (10)
1. a kind of process intelligent processing method of flow engine, includes the following steps:
Step S1 is detected and is obtained process to be processed；
Step S2, detects whether the process to be processed has historical data, when detecting the historical data of the process to be processed, root
The acceptable maximum delay time of process current procedures to be processed is calculated according to the historical data of the process to be processed；
Step S3, according to the acceptable maximum delay time of process current procedures to be processed to institute's process to be handled formed to
The processing for treating process flow is completed in process flow queue according to the process queue to be processed.
2. a kind of process intelligent processing method of flow engine as described in claim 1, which is characterized in that in step S2 it
Before, further include following steps:
After flow engine starting, the historical data of the processed all processes of loading system.
3. a kind of process intelligent processing method of flow engine as claimed in claim 2, which is characterized in that in step S2,
The multiple sample datas for obtaining the operating time interval in historical data between current procedures node and next step node, take it
Mean value is as the acceptable maximum delay time of current procedures.
4. a kind of process intelligent processing method of flow engine as claimed in claim 3, it is characterised in that: in step S3,
Further include following steps:
The absolute time for obtaining the process previous step user's operation to be processed, utilizes the absolute time of previous step user's operation
Between be added with the acceptable maximum delay time of current procedures estimate out the process current procedures to be processed user expectation
Operating time arranges existing process to be processed according to user's desired operation time of the process current procedures to be processed
Sequence forms the process queue to be processed.
5. a kind of process intelligent processing method of flow engine as described in claim 1, it is characterised in that: in step S2,
If the process to be processed does not have historical data, directly it is added into the process queue to be processed, and user it is expected
Operating time is estimated as current time.
6. a kind of process intelligent processing system of flow engine, comprising:
Process detecting unit to be processed, for detecting and obtaining process to be processed；
Maximum delay time computing unit, for detecting whether the process to be processed has historical data, in detect it is described to
When the historical data of process flow, calculating the process current procedures to be processed according to the historical data of the process to be processed can
The maximum delay time of receiving；
Queue forms unit, for according to the acceptable maximum delay times of the process current procedures to be processed to being needed
Process flow forms process queue to be processed, and the processing for treating process flow is completed according to the process queue to be processed.
7. a kind of process intelligent processing system of flow engine as claimed in claim 6, which is characterized in that the system packet
It includes:
Historical data loading unit is used for after flow engine starting, the history of the processed all processes of loading system
Data.
8. a kind of process intelligent processing system of flow engine as claimed in claim 7, which is characterized in that the maximum delay
Time calculating unit is used for by between the operating time in acquisition historical data between current procedures node and next step node
Every multiple sample datas, take its mean value as the acceptable maximum delay time of current procedures.
9. a kind of process intelligent processing system of flow engine as claimed in claim 8, it is characterised in that: the queue is formed
Unit is used to obtain the absolute time of the process previous step user's operation to be processed, utilizes the exhausted of previous step user's operation
The user for estimating out the process current procedures to be processed is added with the acceptable maximum delay time of current procedures to the time
The desired operation time carries out existing process to be processed according to user's desired operation time of the process current procedures to be processed
Sequence forms the process queue to be processed.
10. a kind of process intelligent processing system of flow engine as claimed in claim 6, it is characterised in that: the maximum is prolonged
If slow time calculating unit detects that the process to be processed does not have historical data, it is directly added into the process to be processed
In queue, and user is estimated as current time the desired operation time.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910643835.1A CN110348818B (en) | 2019-07-17 | 2019-07-17 | Intelligent process processing method and system for process engine |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910643835.1A CN110348818B (en) | 2019-07-17 | 2019-07-17 | Intelligent process processing method and system for process engine |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN110348818A true CN110348818A (en) | 2019-10-18 |
| CN110348818B CN110348818B (en) | 2024-01-19 |
Family
ID=68175526
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910643835.1A Active CN110348818B (en) | 2019-07-17 | 2019-07-17 | Intelligent process processing method and system for process engine |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110348818B (en) |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1680923A (en) * | 2004-04-09 | 2005-10-12 | 东软集团有限公司 | High-efficient processing method of working-fluid engine |
| CN1828481A (en) * | 2006-03-10 | 2006-09-06 | 浙江大学 | Energy-saving switching method for waiting overtime judge of flush type system outer apparatus |
| CN103488691A (en) * | 2013-09-02 | 2014-01-01 | 用友软件股份有限公司 | Task scheduling device and task scheduling method |
| CN103679524A (en) * | 2013-12-09 | 2014-03-26 | 王美金 | Method and system for calculating completion time of banking business in progress |
| CN107122865A (en) * | 2017-05-02 | 2017-09-01 | 泰康保险集团股份有限公司 | Method, system and the terminal device estimated are counted by flow |
| CN108154252A (en) * | 2016-12-02 | 2018-06-12 | 百度在线网络技术（北京）有限公司 | Method and apparatus for estimating the flow deadline |
| CN108509148A (en) * | 2018-02-07 | 2018-09-07 | 新华三技术有限公司 | A kind of I/O request processing methods and device |
| CN109214771A (en) * | 2018-08-01 | 2019-01-15 | 奇酷互联网络科技（深圳）有限公司 | Method, equipment, storage medium and the terminal of everyday tasks management |
| CN109634989A (en) * | 2018-11-16 | 2019-04-16 | 百度在线网络技术（北京）有限公司 | A kind of HIVE task executive engine selection method and system |
-
2019
- 2019-07-17 CN CN201910643835.1A patent/CN110348818B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1680923A (en) * | 2004-04-09 | 2005-10-12 | 东软集团有限公司 | High-efficient processing method of working-fluid engine |
| CN1828481A (en) * | 2006-03-10 | 2006-09-06 | 浙江大学 | Energy-saving switching method for waiting overtime judge of flush type system outer apparatus |
| CN103488691A (en) * | 2013-09-02 | 2014-01-01 | 用友软件股份有限公司 | Task scheduling device and task scheduling method |
| CN103679524A (en) * | 2013-12-09 | 2014-03-26 | 王美金 | Method and system for calculating completion time of banking business in progress |
| CN108154252A (en) * | 2016-12-02 | 2018-06-12 | 百度在线网络技术（北京）有限公司 | Method and apparatus for estimating the flow deadline |
| CN107122865A (en) * | 2017-05-02 | 2017-09-01 | 泰康保险集团股份有限公司 | Method, system and the terminal device estimated are counted by flow |
| CN108509148A (en) * | 2018-02-07 | 2018-09-07 | 新华三技术有限公司 | A kind of I/O request processing methods and device |
| CN109214771A (en) * | 2018-08-01 | 2019-01-15 | 奇酷互联网络科技（深圳）有限公司 | Method, equipment, storage medium and the terminal of everyday tasks management |
| CN109634989A (en) * | 2018-11-16 | 2019-04-16 | 百度在线网络技术（北京）有限公司 | A kind of HIVE task executive engine selection method and system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN110348818B (en) | 2024-01-19 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN107992359B (en) | Task scheduling method for cost perception in cloud environment | |
| EP2742426B1 (en) | Network-aware coordination of virtual machine migrations in enterprise data centers and clouds | |
| US20180356802A1 (en) | Method and system for scheduling parallel processing machines based on hybrid shuffled frog leaping algorithm and variable neighborhood search algorithm | |
| CN111367630A (en) | Multi-user multi-priority distributed cooperative processing method based on cloud computing | |
| CN104765640B (en) | A kind of intelligent Service dispatching method | |
| WO2009008007A2 (en) | Data packet processing method for a multi core processor | |
| CN104199739B (en) | A kind of speculating type Hadoop dispatching methods based on load balancing | |
| CN107291550A (en) | A kind of Spark platform resources dynamic allocation method and system for iterated application | |
| CN105740059B (en) | A kind of population dispatching method towards Divisible task | |
| CN111209091A (en) | Scheduling method of Spark task containing private data in mixed cloud environment | |
| CN105867998A (en) | Virtual machine cluster deployment algorithm | |
| CN109871270B (en) | Scheduling scheme generation method and device | |
| CN104461722B (en) | A kind of job scheduling method for cloud computing system | |
| Li et al. | A two-stage flow-shop scheduling problem with incompatible job families and limited waiting time | |
| CN111061565A (en) | Two-stage pipeline task scheduling method and system in Spark environment | |
| CN109491775B (en) | Task processing and scheduling method used in edge computing environment | |
| CN102184124B (en) | Task scheduling method and system | |
| CN110275765A (en) | Data parallel job scheduling method based on branch DAG dependency | |
| Kishor et al. | Time quantum based improved scheduling algorithm | |
| CN106802825A (en) | A kind of dynamic task scheduling method and system based on real-time system | |
| Zhu et al. | Scheduling single-arm multi-cluster tools with lower bound cycle time via Petri nets | |
| Dubey et al. | QoS driven task scheduling in cloud computing | |
| CN110348818A (en) | A kind of the process intelligent processing method and system of flow engine | |
| Azmi et al. | Scheduling grid jobs using priority rule algorithms and gap filling techniques | |
| CN108268312A (en) | Method for scheduling task and scheduler |
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 | ||
| CB03 | Change of inventor or designer information |
Inventor after: Xu Yingguang Inventor after: Xu Wei Inventor before: Xu Wei Inventor before: Xu Yingguang |
|
| CB03 | Change of inventor or designer information | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |