CN110308979A - The asynchronous process frame and its implementation of task based access control scheduling - Google Patents
The asynchronous process frame and its implementation of task based access control scheduling Download PDFInfo
- Publication number
- CN110308979A CN110308979A CN201910572846.5A CN201910572846A CN110308979A CN 110308979 A CN110308979 A CN 110308979A CN 201910572846 A CN201910572846 A CN 201910572846A CN 110308979 A CN110308979 A CN 110308979A
- Authority
- CN
- China
- Prior art keywords
- task
- execution
- business
- interface
- scheduling
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Pending
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/48—Program initiating; Program switching, e.g. by interrupt
- G06F9/4806—Task transfer initiation or dispatching
- G06F9/4843—Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
- G06F9/4881—Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F9/00—Arrangements for program control, e.g. control units
- G06F9/06—Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
- G06F9/46—Multiprogramming arrangements
- G06F9/54—Interprogram communication
- G06F9/547—Remote procedure calls [RPC]; Web services
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/50—Indexing scheme relating to G06F9/50
- G06F2209/5018—Thread allocation
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F2209/00—Indexing scheme relating to G06F9/00
- G06F2209/54—Indexing scheme relating to G06F9/54
- G06F2209/544—Remote
Landscapes
- Engineering & Computer Science (AREA)
- Software Systems (AREA)
- Theoretical Computer Science (AREA)
- Physics & Mathematics (AREA)
- General Engineering & Computer Science (AREA)
- General Physics & Mathematics (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The asynchronous process frame and its implementation of task based access control scheduling, including task scheduling system, high concurrent execution thread and anti-duplicated code module；Service provider system generates unique business serial number after accepting business, the task creation interface for calling task scheduling system to provide, task scheduling system according to be transmitted through come task type and business serial number create the task of this business, the execution of triggering task, the interface of task scheduling system calling operation system interface IP address specified machine, the service execution interface method in specified machine is operated in by high concurrent execution thread, processing business logic, the implementing result of this subtask of task scheduling system is returned after having handled, task scheduling system is according to this implementing result, decide whether to continue to dispatch；Anti- duplicated code module is for avoiding task from being repeatedly executed.The present invention can be managed collectively the scheduling of multiple types multiple tasks, realize that the high concurrent amount of multiple tasks executes, it is ensured that task is not repeated execution.
Description
Technical field
The invention belongs to Java multithreading, multitasks to execute field, and in particular to a kind of asynchronous place of task based access control scheduling
Manage frame and its implementation.
Background technique
Internet industry operation flow is increasingly sophisticated at present, and the interface function for also resulting in system external offer is more and more multiple
It is miscellaneous.When interface process to be treated is too many, (interface internal may also need to interact with other systems, then if it is external system
Situation is even worse), the interface response time will be made especially long, generally require this when to decompose interface task, a part of task
Synchronously complete return, it is left largely to need the time done to be placed on internal system to complete by way of task schedule, in this way
Falling into a long wait for called side is avoided, shields operation flow responsible in primary call, after completing all processes again
Notice caller or caller timing come to inquire.It is fortunately handled when in face of the fractionation of a small number of interfaces, but a large amount of when occurring
Interface it is to be treated when just need the scheduling and execution of unified each task of task management platform management, packet
Retrying, compensating when including mission failure.Task schedule platform is just produced in the above context.
Summary of the invention
The present invention aiming at the shortcomings in the prior art, provides asynchronous process frame and its realization of a kind of scheduling of task based access control
Method.
To achieve the above object, the invention adopts the following technical scheme:
The asynchronous process frame of task based access control scheduling characterized by comprising task scheduling system, high concurrent execute line
Journey and anti-duplicated code module；
Design has task strategy table in the task scheduling system, for saving the implementation strategy of each task；Task
It is also devised with task list in scheduling system, for storing specific task execution information；Task scheduling system externally provides one
Task creation interface createTask (String taskType, String businessNo), wherein taskType indicates to appoint
Service type, businessNo indicate business serial number；Creation has the task plan corresponding to task strategy table in task scheduling system
Slightly data；
Service provider system generates unique business serial number after accepting business, task of task scheduling system being called to provide
Create interface createTask, task scheduling system according to be transmitted through come task type and business serial number created according to task list
The task of this business, triggers the execution of task, and task scheduling system calls operation system interface IP address in task strategy data
The auditTask interface of TARGRTURL specified machine, the service execution in specified machine is operated in by high concurrent execution thread
AuditTask interface method, processing business logic return to the implementing result of this subtask of task scheduling system, appoint after having handled
Scheduling system of being engaged in decides whether to continue to dispatch according to this implementing result；
The high concurrent execution thread selects java.util.concurrent.ThreadPoolExecutor as thread
Pond, high concurrent execution thread configuration task grouping, in create task setting n be grouped, each generic task when being created with
Machine generates 1~n of task group number, and when this type task schedule, high concurrent execution thread creates n thread, inquires 1~n respectively
This n thread is put into thread pool and executes by the task execution in task groups；
The anti-duplicated code module is run in the implementation procedure of task, and anti-duplicated code module is repeated using anti-
Two fields of task type and grouped task number of table t_one_by_one guarantee one kind in database level as combined index
The combination of task type and grouped task number be it is unique, not reproducible, before task groups task execution, anti-duplicated code module
A grouped task data first are recorded toward t_one_by_one table, this packet data is deleted after having executed task, avoids this
Business group is repeatedly executed.
To optimize above-mentioned technical proposal, the concrete measure taken further include:
Further, the task strategy table includes following field:
Task type: which generic task is mark be, it is necessary to have uniqueness；
Runing time section: it configures a certain generic task and is executed in some intraday time range, not in this time frame
It does not just execute inside；
Implementation strategy: if indicating that a certain generic task is once not carried out success, most multipotency executes how many times, and continues
Next time executes the needed to wait for time；
Maximum executes item number: the taskbar number that a certain generic task once executes；
Task maximum packet count: certain type of task can have many tasks, these grouped tasks be given, to press group
It executes in batches；
Interface system address: indicate interface that the generic task is called in which address ip；
Interface name: which interface service in some system is called in instruction.
Further, the task list includes following field:
Task ID: task unique No. id；
Task groups ID number: it identifies the task and is in which grouping；
Task type: it identifies the task and belongs to which kind；
Business serial number: business serial number belonging to one task of mark；
Task executes the time earliest: the task next time earliest time that can be executed being calculated according to task strategy；
Current execution times: identifying certain task currently is which time executes；
Execution state: it identifies in the execution state of task, including newly-built, execution, runs succeeded, execute failure, abandon shape
State.
Further, the task scheduling system decides whether to continue to dispatch according to implementing result, if succeeding, exiting
Just the terminating this business flowing water of the task, regenerates the task of this business flowing water if retrying, and current execution times add
1, task status is newly-built, calculating Time Of Next execution.
Further, the core-wire number of passes of the thread pool of the high concurrent execution thread is set as 20, maximum allowable thread
Number is 200, and the idle thread time-to-live is set as 180 seconds, and obstruction queue is set as 100.
Further, the anti-anti- class repeated of duplicated code module construction, including three methods:
BeforeExecute (), execute (), afterExecute (), externally provide execute () method, and the method is called
Before first carry out beforeExecute (), into t_one_by_one be inserted into one execute record, show the task class to be executed
Then type and task groups execute all tasks in task groups, after being finished, afterExecute () method is called to delete
This task type and grouped task data.
In addition, the invention also provides a kind of implementation method using as above any asynchronous process frame, it is special
Sign is, includes the following steps:
The interface A of service provider system calls in 1.0 service call sides, sends business datum；
1.1 service provider systems carry out business fractionation；
The task creation interface createTask of 1.2 service provider systems calling task scheduling system；
1.3 task scheduling systems create a business serial number be task ID, the task that type is T；
The response for the task that creates is sent to service provider system by 1.4 task scheduling systems；
Service handling result is fed back to service call side by 1.5 service provider systems；
1.6 task scheduling system clocked flip task T；
The strategy of 1.7 task scheduling system query task T；
If 1.8 task T cannot be executed, the task of current type is skipped, triggers next type tasks；
If 1.9 task T are eligible, it can execute, then task maximum packet count, the maximum specified according to task strategy
Execution item number obtain the set of tasks of each grouping；
Each group task is put into the thread pool of high concurrent execution thread by 1.10 task scheduling systems, triggers each task
Execution；
1.11 call the interface of service provider system；
1.12 service provider systems execute specific tasks；
If 1.13 run succeeded, external system is notified；
1.14 service provider systems return to the implementing result of specific tasks T1 in task T to task scheduling system；
1.15 task scheduling systems judge task T1 implementing result；
If 1.16 run succeeded, exit, task T1 executes completion, executes next task；
If 1.17 execute failure, continue, creates a new task using current business flowing water number；
If 1.18 execute failure, exception, exit, task exits, and does not execute；
If 1.19 skip, it is not carried out success, is skipped, waiting executes again.
The beneficial effects of the present invention are:
1) scheduling of multiple types multiple tasks can be managed collectively, comprising: the execution of each type of task
How long strategy (executes once, how to execute, skip execution, retry or exit), the grouping of each type task, every time scheduling
The task number executed in batches；
2) realize that the high concurrent amount of multiple tasks executes；
3) ensure that task is not repeated execution.
Detailed description of the invention
Fig. 1 is the partial schematic diagram of task strategy data.
Fig. 2 is the flow chart of task schedule implementation method.
Fig. 3 is task strategy table table result schematic diagram.
Fig. 4 is task strategy table table schematic diagram data.
Fig. 5 is task Time Of Next execution schematic diagram.
Specific embodiment
In conjunction with the accompanying drawings, the present invention is further explained in detail.
The invention proposes a kind of asynchronous process frames of task based access control scheduling, mainly include following sections.
One, task scheduling system designs
A. design a task strategy table, for saving the implementation strategy of each task, including field contain: task
Type, the period of task run execution, implementation strategy, maximum execution item number, the largest packet number that task allows are called
System address where interface, interface name.Each data field is illustrated below:
Task type: which generic task is mark be, it is necessary to have uniqueness；
Runing time section: it configures a certain generic task and is executed in some intraday time range, not in this time frame
It does not just execute inside；
Implementation strategy: if indicating that a certain generic task is once not carried out success, most multipotency executes how many times, and continues
Next time executes the needed to wait for time；
Maximum executes item number: the taskbar number that a certain generic task once executes；
Task maximum packet count: certain type of task can have many tasks, these grouped tasks be given, to press group
It executes in batches；
Interface system address: indicate interface that the generic task is called in which address ip；
Interface name: which interface service in some system is called in instruction.
B. a task list is designed, specific task execution information one by one is stored.Field contains: task id, task groups
Id, task type, business serial number, the task execute time, current execution times, execution state earliest.Below to each word
Section illustrates:
Task ID: task unique No. id；
Task groups ID number: it identifies the task and is in which grouping；
Task type: identifying the task and belong to which kind, referring to the task type field of task strategy table；
Business serial number: business serial number belonging to one task of mark, that is, this task is since which having occurred
One business and generating for task；
Task executes the time earliest: the task next time earliest time that can be executed being calculated according to task strategy；
Current execution times: identifying certain task currently is which time executes；
Execution state: the execution state of task is identified.Have in newly-built, execution, runs succeeded, execute failure, abandon state.
C. task scheduling system externally provide a task creation interface createTask (String taskType,
String businessNo)
TaskType: task type；
BusinessNo: business serial number.
D. task strategy data are created
Assuming that there is task type T1, execute once within the task every 2 minutes after generating, most 5 times, whole day executes, and is divided into
10 groups, it is 100 that maximum, which executes batch, and the system address that when execution calls is 172.29.2.127:9101, and interface is entitled
AuditTask, as shown in Figure 1.
E. service provider system generates unique business serial number after accepting business, times for calling task scheduling system to provide
Business creation interface.Task scheduling system according to be transmitted through come task type and business serial number create the task of this business, close
There is which information in task, sees in b. and describe.
F. scheduling system is waited to execute task.
G. scheduler task calls the auditTask interface for the 172.29.2.127 machine that TARGETURL is specified in e..
H. the service execution auditTask interface method on 172.292.127:9101, processing business logic, place are operated in
The implementing result of this subtask of task scheduling system is returned after having managed, such as is succeeded, exits, retries, skipped.
I. task scheduling system decides whether to continue to dispatch according to this implementing result.Terminate this if succeeding, exiting
The task of business flowing water needs to regenerate if retrying the task of this business flowing water, current execution times+1, task
State is newly-built, calculating Time Of Next execution.
Two, high concurrent execution thread designs
A. select java.util.concurrent.ThreadPoolExecutor as thread pool, core-wire number of passes is set
20 are set to, maximum allowable Thread Count is 200, and the idle thread time-to-live is set as 180 seconds, and obstruction queue is set as 100.
B. grouped task can configure, such as the business that data volume is bigger, 50 groupings of setting in the task of creation, often
One task generates task group number 1~50 when being created at random.In the scheduling of this type tasks, it is created that 50 threads, often
One thread inquires the task execution in 1~50 task groups respectively.This 50 threads, which are put into thread pool, to be executed.
Three, anti-duplicated code design:
A. use anti-two fields of task type+grouped task number for repeating table t_one_by_one as synthetic rope
Draw.In this way can database level guarantee a kind of task type+grouped task number be it is unique, it is not reproducible.
B. construct the anti-class repeated, there is 3 methods: beforeExecute (), execute (),
AfterExecute () externally provides execute () method, first carries out beforeExecute () before the method is called, to
One is inserted into t_one_by_one and executes record, is shown the task type to be executed and task groups, is then executed this task groups
Interior all tasks, after being finished, the afterExecute () method of calling deletes this task type and packet data.
It sums up and is exactly: first recording a grouped task data toward t_one_by_one table before certain task groups task execution, executing
This packet data is deleted after complete task.It can be repeatedly executed in this way to avoid the task groups, because appointing in t_one_by_one table
After packet data of being engaged in exists, it cannot be inserted into this data, only task groups can be just deleted after being finished.
The implementation method of the asynchronous process frame of task based access control scheduling is as shown in Figure 2, in which:
1. 1.0~1.5 be third party's service request in figure, the process that our system is accepted, this can be directed to this in the process
Secondary service request creates a corresponding task.
2. the task of our task scheduling system meeting timing all task types of scheduling (per minute), and according to each
The implementation strategy of business decides whether to execute each task.
3. can notify our specific processing result of external system after the success of each task execution, external system can also
To inquire our service processing result at regular intervals.
4. specifically executed due to each task, it may be desirable to handle a large amount of operation flow, and during this also
It is related to the interaction with other systems, because the opposite meeting of this time is longer.It is executed by way of task in this way, final result
It is notified that called side (in figure shown in 1.13), the long-time interface synchronization of other side is avoided to wait, and due to using thread pool
The mode of multithreading executes task, therefore copes with a large amount of high concurrent service request of external system.
In the asynchronous process frame of task based access control scheduling, task execution strategy is implemented as follows:
Task strategy table table result as shown in figure 3, Policy Table's table data as shown in figure 4, TASKSTRATEGY is exactly in table
Implementation strategy, for example, some task T be configured to " 1m, 2m, 5m, 10m ", this strategy be meant that this task most multipotency execute 4 times, m
Indicate chronomere.
If the scheduling frequency of scheduling system is set as primary scheduling in 1 minute, current time is 14:00:00, then T task
It executes after 1st time 1 minute, is executed after the 2nd time 2 minutes, executed after five minutes for the 3rd time, the 4th executes after ten minutes.In addition to unit
Minute m, can also use day d, hour h, second s.This configuration is used when task is created, have in task list one earliest
Time field is executed, is exactly calculated according to TASKSTRATEGY.First calculate the millisecond number of each chronomere: 1d=24*
60*60*1000 milliseconds, 1h=60*60*1000 milliseconds, 1m=60*1000 milliseconds, 1s=1000 milliseconds.So if strategy is matched
Be set to: " 1m, 2h, 3d ", then the 1st time creation task when task the earliest execution time be newDate () .getTime () (when
Preceding time millisecond number)+1m millisecond number (seeing above) after, it is new Date () that the 2nd creation task executes the time earliest
.getTime after the millisecond number (seeing above) of () (current time millisecond number)+2*1h, when the 3rd time creation task executes earliest
Between for new Date () .getTime () (current time millisecond number)+3*1d millisecond number (seeing above) after, then by millisecond
It is exactly task Time Of Next execution that number, which is converted to yyyyMMddHHmmSS format, EarlyExecuteTime word as shown in Figure 5
Section content.
Thread pool and concurrently execution task are implemented as follows:
Thread pool is created using spring, core-wire number of passes is set as 20, and maximum allowable Thread Count is 200, idle line
The journey time-to-live is set as 180 seconds, obstruction queue setting 100.
<bean id=" taskPool "
Class=" org.springframework.scheduling.concurrent.ThreadPoolExec utor
FactoryBean″>
<property name=″corePoolSize"value=″20″/>
<property name=″keepAliveSeconds″value=″180″/>
<property name=″maxPoolSize″value=″200″/>
<property name=″queueCapacity″value=″100″/>
</bean>
Query task strategy obtains execution group number, and the number of threads N concurrently executed, thread is created, by this N number of task
Thread is put into thread pool above and executes:
Int maxExecuteGroupCount=strategyInfo.getMaxExecuteGroupCoun t ()；
For (int i=1；I <=maxExecuteGroupCount；i++){
LOGGER.info (methodName, " execute groupid: "+i)；
ThreadExecutor.submit (new ScheduledExecuteRunnable (strategyInfo, i,
StrategyInfo.getMaxBatchExecuteCount (), invokeNo))；
}
Wherein strategyInfo is task strategy information, and maxExecuteGroupCount is the number of execution thread,
ScheduledExecuteRunnable is the execution thread of creation.
It should be noted that the term of such as "upper", "lower", "left", "right", "front", "rear" cited in invention, also
Only being illustrated convenient for narration, rather than to limit the scope of the invention, relativeness is altered or modified, in nothing
Under essence change technology contents, when being also considered as the enforceable scope of the present invention.
The above is only the preferred embodiment of the present invention, protection scope of the present invention is not limited merely to above-described embodiment,
All technical solutions belonged under thinking of the present invention all belong to the scope of protection of the present invention.It should be pointed out that for the art
For those of ordinary skill, several improvements and modifications without departing from the principles of the present invention should be regarded as protection of the invention
Range.
Claims (7)
1. the asynchronous process frame of task based access control scheduling characterized by comprising task scheduling system, high concurrent execution thread
With anti-duplicated code module；
Design has task strategy table in the task scheduling system, for saving the implementation strategy of each task；Task schedule
Task list is also devised in system, for storing specific task execution information；Task scheduling system externally provides a task
It creates interface createTask (String taskType, String businessNo), wherein taskType indicates task class
Type, businessNo indicate business serial number；Creation has the task strategy number corresponding to task strategy table in task scheduling system
According to；
Service provider system generates unique business serial number after accepting business, the task creation for calling task scheduling system to provide
Interface createTask, task scheduling system according to be transmitted through come task type and business serial number create this according to task list
The task of business, triggers the execution of task, and task scheduling system calls operation system interface IP address in task strategy data
The auditTask interface of TARGRTURL specified machine, the service execution in specified machine is operated in by high concurrent execution thread
AuditTask interface method, processing business logic return to the implementing result of this subtask of task scheduling system, appoint after having handled
Scheduling system of being engaged in decides whether to continue to dispatch according to this implementing result；
The high concurrent execution thread selects java.util.concurrent.ThreadPoolExecutor as thread pool,
The grouping of high concurrent execution thread configuration task, in the task of creation, n grouping of setting, each generic task are given birth at random when being created
At task 1~n of group number, when this type task schedule, high concurrent execution thread creates n thread, inquires 1~n task respectively
This n thread is put into thread pool and executes by the task execution in group；
The anti-duplicated code module is run in the implementation procedure of task, and anti-duplicated code module repeats table t_ using anti-
Two fields of task type and grouped task number of one_by_one guarantee a kind of task in database level as combined index
The combination of type and grouped task number be it is unique, not reproducible, before task groups task execution, anti-duplicated code module is first past
T_one_by_one table records a grouped task data, this packet data is deleted after having executed task, avoids the task groups
It is repeatedly executed.
2. the asynchronous process frame of task based access control scheduling as described in claim 1, it is characterised in that: the task strategy table packet
Include following field:
Task type: which generic task is mark be, it is necessary to have uniqueness；
Runing time section: configuring a certain generic task and execute in some intraday time range, within not in this time frame
It does not execute；
Implementation strategy: if indicating that a certain generic task is once not carried out success, most multipotency executes how many times, and continues next time
Execute the needed to wait for time；
Maximum executes item number: the taskbar number that a certain generic task once executes；
Task maximum packet count: certain type of task can have many tasks, give these grouped tasks, to press group in batches
It executes；
Interface system address: indicate interface that the generic task is called in which address ip；
Interface name: which interface service in some system is called in instruction.
3. the asynchronous process frame of task based access control scheduling as described in claim 1, it is characterised in that: the task list includes such as
Lower field:
Task ID: task unique No. id；
Task groups ID number: it identifies the task and is in which grouping；
Task type: it identifies the task and belongs to which kind；
Business serial number: business serial number belonging to one task of mark；
Task executes the time earliest: the task next time earliest time that can be executed being calculated according to task strategy；
Current execution times: identifying certain task currently is which time executes；
Execution state: it identifies in the execution state of task, including newly-built, execution, runs succeeded, execute failure, abandon state.
4. the asynchronous process frame of task based access control scheduling as described in claim 1, it is characterised in that: the task scheduling system
According to implementing result, decide whether to continue to dispatch, terminates the task of this business flowing water if succeeding, exiting, if retrying
The task of this business flowing water is regenerated, current execution times add 1, and task status is newly-built, calculating Time Of Next execution.
5. the asynchronous process frame of task based access control scheduling as described in claim 1, it is characterised in that: the high concurrent executes line
The core-wire number of passes of the thread pool of journey is set as 20, and maximum allowable Thread Count is 200, and the idle thread time-to-live is set as
180 seconds, obstruction queue was set as 100.
6. the asynchronous process frame of task based access control scheduling as described in claim 1, it is characterised in that: the anti-duplicated code mould
The anti-class repeated of block construction, including three methods: beforeExecute (), execute (), afterExecute (),
Execute () method is externally provided, beforeExecute () is first carried out before the method is called, is inserted into t_one_by_one
Enter one and execute record, show the task type to be executed and task groups, then executes all tasks in task groups, executed
Bi Hou, the afterExecute () method of calling delete this task type and grouped task data.
7. a kind of implementation method using such as asynchronous process frame as claimed in any one of claims 1 to 6, which is characterized in that including
Following steps:
The interface A of service provider system calls in 1.0 service call sides, sends business datum；
1.1 service provider systems carry out business fractionation；
The task creation interface createTask of 1.2 service provider systems calling task scheduling system；
1.3 task scheduling systems create a business serial number be task ID, the task that type is T；
The response for the task that creates is sent to service provider system by 1.4 task scheduling systems；
Service handling result is fed back to service call side by 1.5 service provider systems；
1.6 task scheduling system clocked flip task T；
The strategy of 1.7 task scheduling system query task T；
If 1.8 task T cannot be executed, the task of current type is skipped, triggers next type tasks；
If 1.9 task T are eligible, it can execute, then the task maximum packet count specified according to task strategy maximum is held
Row item number obtains the set of tasks of each grouping；
Each group task is put into the thread pool of high concurrent execution thread by 1.10 task scheduling systems, and triggering each task is held
Row；
1.11 call the interface of service provider system；
1.12 service provider systems execute specific tasks；
If 1.13 run succeeded, external system is notified；
1.14 service provider systems return to the implementing result of specific tasks T1 in task T to task scheduling system；
1.15 task scheduling systems judge task T1 implementing result；
If 1.16 run succeeded, exit, task T1 executes completion, executes next task；
If 1.17 execute failure, continue, creates a new task using current business flowing water number；
If 1.18 execute failure, exception, exit, task exits, and does not execute；
If 1.19 skip, it is not carried out success, is skipped, waiting executes again.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910572846.5A CN110308979A (en) | 2019-06-27 | 2019-06-27 | The asynchronous process frame and its implementation of task based access control scheduling |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910572846.5A CN110308979A (en) | 2019-06-27 | 2019-06-27 | The asynchronous process frame and its implementation of task based access control scheduling |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110308979A true CN110308979A (en) | 2019-10-08 |
Family
ID=68077819
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910572846.5A Pending CN110308979A (en) | 2019-06-27 | 2019-06-27 | The asynchronous process frame and its implementation of task based access control scheduling |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110308979A (en) |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111400011A (en) * | 2020-03-19 | 2020-07-10 | 中国建设银行股份有限公司 | Real-time task scheduling method, system, equipment and readable storage medium |
| CN111782352A (en) * | 2019-11-29 | 2020-10-16 | 北京沃东天骏信息技术有限公司 | Service scheduling method and device |
| CN115794356A (en) * | 2023-01-31 | 2023-03-14 | 深圳方位通讯科技有限公司 | Multithreading synchronous connection processing method based on SSH server |
| CN117472530A (en) * | 2023-10-25 | 2024-01-30 | 上海宽睿信息科技有限责任公司 | Centralized management-based data intelligent scheduling method and system |
Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090254774A1 (en) * | 2007-08-27 | 2009-10-08 | Kickfire, Inc. | Methods and systems for run-time scheduling database operations that are executed in hardware |
| CN101882161A (en) * | 2010-06-23 | 2010-11-10 | 中国工商银行股份有限公司 | Application level asynchronous task scheduling system and method |
| CN101819540B (en) * | 2009-02-27 | 2013-03-20 | 国际商业机器公司 | Method and system for scheduling task in cluster |
| US20160266930A1 (en) * | 2015-03-11 | 2016-09-15 | Accenture Global Services Limited | Queuing tasks in a computer system |
| CN106293971A (en) * | 2016-08-15 | 2017-01-04 | 张家林 | A kind of method and apparatus of distributed task dispatching |
| CN106528297A (en) * | 2016-11-14 | 2017-03-22 | 山东浪潮云服务信息科技有限公司 | System for managing tasks |
| CN106598726A (en) * | 2016-11-04 | 2017-04-26 | 厦门安胜网络科技有限公司 | Multi-task management system and distributed deployment method thereof |
| CN106775965A (en) * | 2016-11-17 | 2017-05-31 | 腾讯科技（深圳）有限公司 | A kind of processing method and processing device of timed task |
| CN107168779A (en) * | 2017-03-31 | 2017-09-15 | 咪咕互动娱乐有限公司 | A kind of task management method and system |
| CN107193641A (en) * | 2017-05-25 | 2017-09-22 | 深信服科技股份有限公司 | A kind of various dimensions task recognition method and device based on cloud platform |
| CN107291545A (en) * | 2017-08-07 | 2017-10-24 | 星环信息科技（上海）有限公司 | The method for scheduling task and equipment of multi-user in computing cluster |
| CN107918556A (en) * | 2016-10-11 | 2018-04-17 | 北京京东尚科信息技术有限公司 | A kind of timed task performs method and apparatus in the parallel of multiple servers |
| CN108304255A (en) * | 2017-12-29 | 2018-07-20 | 北京城市网邻信息技术有限公司 | Distributed task dispatching method and device, electronic equipment and readable storage medium storing program for executing |
| CN109684053A (en) * | 2018-11-05 | 2019-04-26 | 广东岭南通股份有限公司 | The method for scheduling task and system of big data |
| CN109710400A (en) * | 2018-12-17 | 2019-05-03 | 平安普惠企业管理有限公司 | The method and device of thread resources grouping |
| CN109766172A (en) * | 2018-12-13 | 2019-05-17 | 中国平安财产保险股份有限公司 | A kind of asynchronous task scheduling method and device |
-
2019
- 2019-06-27 CN CN201910572846.5A patent/CN110308979A/en active Pending
Patent Citations (16)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20090254774A1 (en) * | 2007-08-27 | 2009-10-08 | Kickfire, Inc. | Methods and systems for run-time scheduling database operations that are executed in hardware |
| CN101819540B (en) * | 2009-02-27 | 2013-03-20 | 国际商业机器公司 | Method and system for scheduling task in cluster |
| CN101882161A (en) * | 2010-06-23 | 2010-11-10 | 中国工商银行股份有限公司 | Application level asynchronous task scheduling system and method |
| US20160266930A1 (en) * | 2015-03-11 | 2016-09-15 | Accenture Global Services Limited | Queuing tasks in a computer system |
| CN106293971A (en) * | 2016-08-15 | 2017-01-04 | 张家林 | A kind of method and apparatus of distributed task dispatching |
| CN107918556A (en) * | 2016-10-11 | 2018-04-17 | 北京京东尚科信息技术有限公司 | A kind of timed task performs method and apparatus in the parallel of multiple servers |
| CN106598726A (en) * | 2016-11-04 | 2017-04-26 | 厦门安胜网络科技有限公司 | Multi-task management system and distributed deployment method thereof |
| CN106528297A (en) * | 2016-11-14 | 2017-03-22 | 山东浪潮云服务信息科技有限公司 | System for managing tasks |
| CN106775965A (en) * | 2016-11-17 | 2017-05-31 | 腾讯科技（深圳）有限公司 | A kind of processing method and processing device of timed task |
| CN107168779A (en) * | 2017-03-31 | 2017-09-15 | 咪咕互动娱乐有限公司 | A kind of task management method and system |
| CN107193641A (en) * | 2017-05-25 | 2017-09-22 | 深信服科技股份有限公司 | A kind of various dimensions task recognition method and device based on cloud platform |
| CN107291545A (en) * | 2017-08-07 | 2017-10-24 | 星环信息科技（上海）有限公司 | The method for scheduling task and equipment of multi-user in computing cluster |
| CN108304255A (en) * | 2017-12-29 | 2018-07-20 | 北京城市网邻信息技术有限公司 | Distributed task dispatching method and device, electronic equipment and readable storage medium storing program for executing |
| CN109684053A (en) * | 2018-11-05 | 2019-04-26 | 广东岭南通股份有限公司 | The method for scheduling task and system of big data |
| CN109766172A (en) * | 2018-12-13 | 2019-05-17 | 中国平安财产保险股份有限公司 | A kind of asynchronous task scheduling method and device |
| CN109710400A (en) * | 2018-12-17 | 2019-05-03 | 平安普惠企业管理有限公司 | The method and device of thread resources grouping |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111782352A (en) * | 2019-11-29 | 2020-10-16 | 北京沃东天骏信息技术有限公司 | Service scheduling method and device |
| CN111400011A (en) * | 2020-03-19 | 2020-07-10 | 中国建设银行股份有限公司 | Real-time task scheduling method, system, equipment and readable storage medium |
| CN111400011B (en) * | 2020-03-19 | 2023-10-20 | 中国建设银行股份有限公司 | Real-time task scheduling method, system, equipment and readable storage medium |
| CN115794356A (en) * | 2023-01-31 | 2023-03-14 | 深圳方位通讯科技有限公司 | Multithreading synchronous connection processing method based on SSH server |
| CN117472530A (en) * | 2023-10-25 | 2024-01-30 | 上海宽睿信息科技有限责任公司 | Centralized management-based data intelligent scheduling method and system |
| CN117472530B (en) * | 2023-10-25 | 2024-04-05 | 上海宽睿信息科技有限责任公司 | Centralized management-based data intelligent scheduling method and system |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110308979A (en) | The asynchronous process frame and its implementation of task based access control scheduling | |
| CN100585563C (en) | Method for servicing task of timer | |
| CN108132833A (en) | Distributed timing task scheduling method and device based on zookeeper technology | |
| Priami | Stochastic π-calculus | |
| CN103679392B (en) | A kind of task scheduling processing method and system | |
| CN106815066B (en) | Timed task scheduling method, device and system | |
| CN109901926A (en) | Method, server and storage medium based on big data behavior scheduling application task | |
| EP0675454A2 (en) | System integrating active and simulated decisionmaking processes | |
| CN106874094A (en) | timed task processing method, device and computing device | |
| CN104216785B (en) | General policies task system and its implementation | |
| CN106293918A (en) | A kind of dispatch the method for process, system and computer | |
| CN105260248B (en) | A kind of task scheduling system and dispatching method being dynamically adapted | |
| DE60207070T2 (en) | MONITORING OF TASKS | |
| CN106959895A (en) | The resource regulating method and system of quick release thread | |
| US8131578B2 (en) | Systems and methods for automatic scheduling of a workforce | |
| CN102176122B (en) | Automatic control system based on finite automaton and control method thereof | |
| CN110336859A (en) | Task scheduling system under multi-tenant environment | |
| CN109544087A (en) | Meeting schedule method and system | |
| CN105260297B (en) | A kind of test data management system and method | |
| CN109656693A (en) | Method for scheduling task, device, server and storage medium | |
| CN115525406A (en) | Distributed asynchronous task scheduling system | |
| CN101866458A (en) | Method and system for obtaining schedule data of task | |
| CN106445651A (en) | Task executing method and system | |
| CN111538525B (en) | Rapid iteration and rollback method for program release | |
| CN111625414A (en) | Method for realizing automatic scheduling monitoring system of data conversion integration software |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20191008 |