CN104536811B - Method for scheduling task based on HIVE tasks and device - Google Patents

Method for scheduling task based on HIVE tasks and device Download PDF

Info

Publication number
CN104536811B
CN104536811B CN201410831524.5A CN201410831524A CN104536811B CN 104536811 B CN104536811 B CN 104536811B CN 201410831524 A CN201410831524 A CN 201410831524A CN 104536811 B CN104536811 B CN 104536811B
Authority
CN
China
Prior art keywords
task
dependence
scheduled
scheduling
preposition
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.)
Active
Application number
CN201410831524.5A
Other languages
Chinese (zh)
Other versions
CN104536811A (en
Inventor
陈武
邱百超
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Guangzhou Huaduo Network Technology Co Ltd
Original Assignee
Guangzhou Huaduo Network Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Guangzhou Huaduo Network Technology Co Ltd filed Critical Guangzhou Huaduo Network Technology Co Ltd
Priority to CN201410831524.5A priority Critical patent/CN104536811B/en
Publication of CN104536811A publication Critical patent/CN104536811A/en
Application granted granted Critical
Publication of CN104536811B publication Critical patent/CN104536811B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Landscapes

  • Management, Administration, Business Operations System, And Electronic Commerce (AREA)

Abstract

The invention discloses a kind of method for scheduling task and device based on HIVE tasks, belongs to field of computer technology.Method includes:Determine the dependence between the multiple tasks for needing to be scheduled and each task;The preposition dependence task and postposition dependence task of each task are determined according to dependence;In being scheduled for task in need selection currently need dispatching for task, obtain being chosen task;Selected task is scheduled according to the scheduling result of the preposition dependence task of selected task;By selection be chosen task in the way of and scheduling be chosen task in the way of handle the postposition dependence task of selected task and all unscheduled tasks, until dispatched being scheduled for task in need.The present invention is scheduled selected task by the scheduling result of the preposition dependence task of the selected task determined according to the dependence between task, so that task scheduling process is fairly simple, and can ensure that task can be executed orderly.Therefore, the efficiency of scheduler task is higher.

Description

Method for scheduling task based on HIVE tasks and device
Technical field
The present invention relates to field of computer technology, more particularly to a kind of method for scheduling task and dress based on HIVE tasks It sets.
Background technology
With the fast development of present computer technology, in order to execute task, server is required in different moments to appointing Business is scheduled, especially in the scheduling field based on HIVE tasks.Wherein, HIVE is a data warehouse based on Hadoop Tool, and Hadoop is a software architecture that distributed treatment can be carried out to mass data, thus can by HIVE tasks The data file of structuring is mapped as a database table, and provide complete SQL (Structured Query Language, structured query language) query function, SQL statement can be converted to Map's (mapping) and Reduce (abbreviation) Task is run.Follow-up work execution efficiency is influenced since server is scheduled task.Therefore, how HIVE is based on It is the key that improve task execution efficiency that task, which carries out task scheduling,.
A kind of method for scheduling task based on HIVE tasks is provided in the related technology, in the method, predefines certain One moment needed dispatching for task, if current time has arrived at the time of dispatching the task, was scheduled to the task.The task After the completion of scheduling, need to dispatch down after determining the task scheduling according to the scheduling result of the task by relevant staff One task, and determine the scheduling instance of next task.Thus by relevant staff by manually controlling to each task It is scheduled.
In the implementation of the present invention, inventor has found that the above method has at least the following problems:
Before each scheduler task, the scheduling result of being dispatched according to upper one by relevant staff for task is needed After determining next the needing to dispatch of the task, task could be scheduled.When task is more, then need manually to each Task is controlled, and task scheduling process is comparatively laborious.Therefore, scheduler task is less efficient.
Invention content
In order to solve problems in the prior art, an embodiment of the present invention provides a kind of task scheduling sides based on HIVE tasks Method and device.The technical solution is as follows:
In a first aspect, a kind of method for scheduling task based on HIVE tasks is provided, the method includes:
It determines the multiple tasks for needing to be scheduled, and determines the dependence between each task;
The preposition dependence task and postposition dependence task of each task are determined according to the dependence;
In being scheduled for task in need selection currently need dispatching for task, obtain being chosen task;
The selected task is scheduled according to the scheduling result of the preposition dependence task of the selected task;
The selected task is handled in the way of selecting the selected task and in the way of the scheduling selected task Postposition dependence task and all unscheduled tasks, until dispatched being scheduled for task in need.
With reference to first aspect, described in need to be adjusted in institute in the first possible realization method of first aspect Selection currently needs dispatching for task in the task of degree, including:
Select in being scheduled for task in need the meeting schedulable condition of the task to appoint as what current needs were dispatched Business;Wherein, the schedulable condition is that all scheduling finishes all preposition dependence task.
The possible realization method of with reference to first aspect the first, in second of possible realization method of first aspect In, it is described select in being scheduled for task in need the meeting schedulable condition of the task to appoint as what current needs were dispatched Business, including:
If there is multiple the meeting schedulable condition of the tasks, it regard the multiple the meeting schedulable condition of the task as current need Being dispatched for task, alternatively, selecting in the multiple the meeting schedulable condition of the task task as working as according to priority Preceding the needing to dispatch of the task.
With reference to first aspect, in the third possible realization method of first aspect, each times for needing to be scheduled Business corresponds to a dispatching cycle;The scheduling result of the preposition dependence task according to the selected task is selected for a post to described Business is scheduled, including:
Obtain the preposition dependence task of the selected task according to its corresponding dispatching cycle it is scheduled obtain later before One or more scheduling result is scheduled the selected task according to the scheduling result got.
With reference to first aspect, the possible realization method of the first of first aspect, second of possible realization method and The possible realization method of any one of three kinds of possible realization methods, in the 4th kind of possible realization method of first aspect In, the preposition dependence task and postposition dependence task that each task is determined according to the dependence, including:
To any task for being scheduled of needs, by with any task there are in the task of dependence by described The task that one task relies on scheduling result is determined as the preposition dependence task of any task, and will rely on any task The task of scheduling result be determined as the postposition dependence task of any task.
Second aspect, provides a kind of task scheduling apparatus based on HIVE tasks, and described device includes:
First determining module, the multiple tasks being scheduled for determining needs, and determine the dependence between each task Relationship;
Second determining module, preposition dependence task and postposition for determining each task according to the dependence rely on Task;
Selecting module, for in being scheduled for task in need selection currently need dispatching for task, obtain by Select for a post business;
Scheduler module adjusts the selected task according to the scheduling result of the preposition dependence task of the selected task Degree;
Processing module, for handling institute in the way of selecting the selected task and in the way of the scheduling selected task State the postposition dependence task of selected task and all unscheduled tasks, until dispatched being scheduled for task in need.
In conjunction with second aspect, in the first possible realization method of second aspect, the selecting module, in institute Select the meeting schedulable condition of the task as currently the needing to dispatch of the task in being scheduled for task in need;Wherein, described Schedulable condition is that all scheduling finishes all preposition dependence task.
In conjunction with the first possible realization method of second aspect, in second of possible realization method of second aspect In, the selecting module, for when there is multiple the meeting schedulable condition of the tasks, by the multiple the meeting schedulable condition of the task As currently the needing to dispatch of the task, alternatively, selecting one in the multiple the meeting schedulable condition of the task according to priority A task is as currently the needing to dispatch of the task.
In conjunction with second aspect, in the third possible realization method of second aspect, each times for needing to be scheduled Business corresponds to a dispatching cycle;The scheduler module, including:
Acquiring unit, the preposition dependence task for obtaining the selected task are scheduled according to its corresponding dispatching cycle One or more the preceding scheduling result obtained later;
Scheduling unit, for being scheduled to the selected task according to the scheduling result got.
In conjunction with the first possible realization method of second aspect, second aspect, second of possible realization method and The possible realization method of any one of three kinds of possible realization methods, in the 4th kind of possible realization method of second aspect In, second determining module will there are dependences with any task for any task for being scheduled of needs Task in relied on the task of scheduling result by any task and be determined as the preposition dependence task of any task, and will The relying on the scheduling result of any task of the task is determined as the postposition dependence task of any task.
The advantageous effect that technical solution provided in an embodiment of the present invention is brought is:
By determining the dependence between each task for needing to be scheduled, and each is determined according to dependence After the preposition dependence task and postposition dependence task of business, according to the tune of the preposition dependence task for the selected task for meeting schedulable condition It spends result and task scheduling is carried out to selected task, and dispatch other unscheduled tasks according to this, so that task scheduling process It is fairly simple, and can ensure that task orderly executes.Therefore, the efficiency of scheduler task is higher.
Description of the drawings
To describe the technical solutions in the embodiments of the present invention more clearly, make required in being described below to embodiment Attached drawing is briefly described, it should be apparent that, drawings in the following description are only some embodiments of the invention, for For those of ordinary skill in the art, without creative efforts, other are can also be obtained according to these attached drawings Attached drawing.
Fig. 1 is a kind of flow chart for method for scheduling task based on HIVE tasks that one embodiment of the invention provides;
Fig. 2 is a kind of flow chart for method for scheduling task based on HIVE tasks that another embodiment of the present invention provides;
Fig. 3 is the dependence schematic diagram between a kind of each task that another embodiment of the present invention provides;
Fig. 4 is a kind of structural representation for task scheduling apparatus based on HIVE tasks that another embodiment of the present invention provides Figure;
Fig. 5 is a kind of structural schematic diagram for scheduler module that another embodiment of the present invention provides;
Fig. 6 is a kind of structural schematic diagram for server that another embodiment of the present invention provides.
Specific implementation mode
To make the object, technical solutions and advantages of the present invention clearer, below in conjunction with attached drawing to embodiment party of the present invention Formula is described in further detail.
Since the relevant technologies are before each scheduler task, being dispatched according to upper one by relevant staff for task is needed Scheduling result determine it is next need the dispatching of the task after, task could be scheduled.When task is more, pass through Control is scheduled to each task manually, causes task scheduling process comparatively laborious.Therefore, scheduler task is less efficient.
In order to prevent the above situation, efficiency when scheduler task is improved.An embodiment of the present invention provides one kind being based on HIVE The method for scheduling task of task, referring to Fig. 1, method flow provided in this embodiment includes:
101:It determines the multiple tasks for needing to be scheduled, and determines the dependence between each task;
102:The preposition dependence task and postposition dependence task of each task are determined according to dependence;
As a kind of alternative embodiment, determines that the preposition dependence task of each task and postposition rely on according to dependence and appoint Business, including:
To any task for being scheduled of needs, by with any task there are in the task of dependence by any task according to Rely the task of scheduling result to be determined as the preposition dependence task of any task, and the task of the scheduling result of any task will be relied on It is determined as the postposition dependence task of any task.
103:In being scheduled for task in need selection currently need dispatching for task, obtain being chosen task;
As a kind of alternative embodiment, in being scheduled for task in need selection currently need dispatching for task, Including:
Select in being scheduled for task in need the meeting schedulable condition of the task to appoint as what current needs were dispatched Business;Wherein, schedulable condition is that all scheduling finishes all preposition dependence task.
As a kind of alternative embodiment, in being scheduled for task in need selection meet the task of schedulable condition and make Currently to need dispatching for task, including:
If there is multiple the meeting schedulable condition of the tasks, multiple the meeting schedulable condition of the tasks are used as and currently need to adjust The task of degree, alternatively, selecting in multiple the meeting schedulable condition of the tasks task as currently needing to adjust according to priority The task of degree.
104:Selected task is scheduled according to the scheduling result of the preposition dependence task of selected task;
As a kind of alternative embodiment, being scheduled for task is each needed to correspond to a dispatching cycle;According to selected The scheduling result of the preposition dependence task of task is scheduled selected task, including:
Obtain the preposition dependence task of the task of being chosen according to its corresponding dispatching cycle it is scheduled obtain later it is previous extremely Multiple scheduling results are scheduled selected task according to the scheduling result got.
105:The postposition that selected task is handled in the way of in such a way that selection is chosen task and scheduling is chosen task relies on Task and all unscheduled tasks, until dispatched being scheduled for task in need.
Method provided in an embodiment of the present invention, by determining the dependence between each task for needing to be scheduled, And after determining preposition dependence task and the postposition dependence task of each task according to dependence, according to the quilt for meeting schedulable condition The scheduling result for selecting for a post the preposition dependence task of business carries out task scheduling to selected task, and dispatches other unscheduled timess according to this Business so as to simplify task scheduling process, and can ensure that task orderly executes.Therefore, the efficiency of scheduler task is higher.
In conjunction with the content of above-described embodiment, another embodiment of the present invention provides a kind of task scheduling based on HIVE tasks Method, referring to Fig. 2, method flow provided in an embodiment of the present invention includes:
201:It determines the multiple tasks for needing to be scheduled, and determines the dependence between each task;
Wherein, the mode for the multiple tasks that the present embodiment is not scheduled determining needs is defined, including but unlimited In manually pre-enter need the multiple tasks that are scheduled corresponding task parameters on the basis of, according to appointing for input Business parameter determines the multiple tasks for needing to be scheduled.About the corresponding task parameters of each task that needs are scheduled, originally Embodiment is not especially limited, including but not limited to task names, task identification etc..In addition, in order to orderly dispatch institute Being scheduled for task in need, each task correspond to a dispatching cycle, and the present embodiment is not to the corresponding scheduling of each task The length in period is defined.When it is implemented, can be that each task being scheduled is needed to pre-set a task class, it should Task class include one dispatching cycle parameter.It, can be in the task of each task after determining the multiple tasks that needs are scheduled Specific dispatching cycle is arranged in parameter in the dispatching cycle that class includes.For example, by dispatching cycle be day, week, for the moon, some is appointed Business may need to execute for one day primary, then the task corresponding dispatching cycle is day, and some tasks may need execution in one week Once, then the task is as all corresponding dispatching cycle, and some tasks may need to execute within one month once, then the task corresponds to Dispatching cycle be the moon.It should be noted that after for each task, corresponding dispatching cycle is set, if needing to repair in the later stage Change a certain task corresponding dispatching cycle, then parameter dispatching cycle corresponding to the task class of the reconfigurable task, to It enables the system to dispatch corresponding task the flexibly dispatching cycle according to different length, the present embodiment does not limit this specifically It is fixed.
After determining the multiple tasks for needing to be scheduled based on aforesaid way, during specific scheduler task, sometimes Input data needed for scheduling current task is the output data that some other task of scheduling obtains later, that is to say, that scheduling Current task needs after some other task is scheduled, to be executed according to the scheduling result of other tasks.Thus Logic is handled according to task, when dispatching some task, the scheduling result for the scheduled task in front that needs to rely on, in this regard, Relationship between these tasks is referred to as dependence by the present embodiment.For example, an output number can be obtained after task A scheduling According to by taking obtained output data is data M as an example, according to task processing logic, data M can be as the input of scheduler task B Data.Accordingly, it can be determined that when scheduler task B, exist between the scheduling result of the task that needs to rely on A, i.e. task A and task B Dependence.
About the mode of the dependence between all tasks of determination, the present embodiment is not especially limited this, specific real Shi Shi is including but not limited to realized by obtaining the dependence parameter pre-entered.It is corresponded to for example, each task has Dependence parameter the dependence of the task and other tasks can be set by the way that the dependence parameter is manually arranged, And then the dependence between all tasks can be determined by the dependence parameter got.It is no matter true using which kind of mode Dependence between fixed each task, the dependence may each comprise but be not limited to indicate to the scheduling result of task according to The relationship for relying and being relied on, logical order when so as to show that each task is scheduled.It is scheduled with determining needs Task between dependence it is as shown in Figure 3 for, there is dependence between two tasks of each arrow connection, and Arrow direction can indicate the physical relationship for relying on and being relied on.As shown in figure 3, being deposited between the task A and task C of arrow connection In dependence, since task C is directed toward in the direction of arrow by task A, then it represents that the scheduling result of task A is relied on by task C, or The scheduling result of person's task C dependence task A.That is, needing the scheduling result of dependence task A when scheduler task C.
202:The preposition dependence task and postposition dependence task of each task are determined according to dependence;
As a kind of alternative embodiment, determines that the preposition dependence task of each task and postposition rely on according to dependence and appoint The mode of business, including but not limited to:
To any task for being scheduled of needs, by with any task there are in the task of dependence by any task according to Rely the task of scheduling result to be determined as the preposition dependence task of any task, and the task of the scheduling result of any task will be relied on It is determined as the postposition dependence task of any task.
In order to make it easy to understand, still by taking dependence shown in Fig. 3 as an example, for the task D in Fig. 3, due to being deposited with task D It is respectively task A and task G in the task of dependence, and in task A and task G, from the figure 3, it may be seen that task A is by task D The scheduling result for relying on scheduling result namely task A is relied on by task D, thus task A can be determined as task D it is preposition according to Rely task.Similarly, the scheduling result of task G dependence task D, thus task G can be determined as to the postposition dependence task of task D. In the way of the preposition dependence task and postposition dependence task that determine task D, the dependence between each task shown in Fig. 3 is closed System can be indicated with such as the following table 1.
Table 1
Task pre next
Begin A、B
A Begin C、D
B Begin E、F
C A End
D A G
E B G、F
F B、E End
G D、E End
In table 1 above, pre represents preposition dependence task, and next represents postposition dependence task.It should be noted that Begin It is considered as first scheduled task, End is considered as the last one scheduled task.First is adjusted For the task of degree, due to before it and unscheduled any task, first scheduled task do not have dependable scheduling As a result, thus first scheduled task does not have preposition dependence task.For needing to rely on the scheduling result of other tasks, But for not relied on scheduling result by any task of the task, there is no postposition dependence task.In addition, for any one task, It both can also be used as the postposition dependence task of other tasks as the preposition dependence task of other tasks.And one is appointed Business can have one or more preposition dependence task, it is possibility to have one or more postposition dependence task.
203:Select to meet the task of schedulable condition in being scheduled for task in need as currently needing to dispatch Task, obtain selected task;
Method provided in this embodiment in actual application, due to the scheduling of a task need to rely on its it is preposition according to Rely the scheduling result of task, thus currently the needing to dispatch in selection of the task, obtains selected task, and adjust to selected task Before degree, the preposition dependence task of the selected task needs all scheduling to finish.It is scheduled especially for needs Task quantity is more, the complex situation of the dependence between task.In this case, can be easy there are it is preposition rely on appoint The quantity of business is more than one task, this task with more than two preposition dependence task of scheduling, needs to rely on it all The scheduling result of preposition dependence task.For this purpose, method provided in this embodiment selection currently need dispatching for task when, including But it is not limited to need the schedulable condition that meets to be limited to all preposition dependence task selected task that all scheduling finishes.
By taking the task C in dependence shown in above-mentioned table 1 as an example, since the preposition dependence task of task C is task A, That is first scheduler task A is needed before scheduler task C, thus if when using task C as dispatching for task is currently needed, is needed full The schedulable condition of foot is that task A scheduling finishes.By taking the task G in dependence shown in above-mentioned table 1 as an example, due to task G's Preposition dependence task is task D and task E, i.e. first scheduler task D and task E is needed before scheduler task G, thus if will appoint When being engaged in G as dispatching for task is currently needed, the schedulable condition met is needed to be finished for task D and task E scheduling.
For there is the case where multiple the meeting schedulable condition of the tasks, when selection currently needs dispatching for task, this implementation The method that example provides includes but not limited to using any one mode in the following two kinds processing mode:
Mode one:By multiple the meeting schedulable condition of the tasks as currently the needing to dispatch of the task;
For this kind of mode one, is all dispatched and is finished due to the preposition dependence task of multiple the meeting schedulable condition of the tasks, That is, this multiple the meeting schedulable condition of the task can be scheduled, thus by by multiple schedulable conditions that meet Task is carried out at the same time scheduling as currently the needing to dispatch of the task to this multiple the meeting schedulable condition of the task, so as to The degree of parallelism for enough improving task scheduling saves whole tasks scheduled time, and then improves the dispatching efficiency of task.In order to just In understanding this kind of mode one, still by taking dependence shown in Fig. 3 as an example, finished if task A and task B are dispatched, at this time Meaning that all preposition dependence task of task C, D and E are all dispatched to finish, i.e. task C, D and E is satisfied by schedulable condition, because And it can be by task C, D and E as currently the needing to dispatch of the task, to following scheduler task C, D and E simultaneously.
Mode two:Select in multiple the meeting schedulable condition of the tasks task as currently needing to adjust according to priority The task of degree.
Wherein, the present embodiment is not defined the method for determination of priority, including but not limited to needs to carry out in determination Further include the steps that the priority of determining each task when the task of scheduling.Determine that the mode of the priority of each task includes But the tandem being entered according to task is not limited to determine, can also be determined by the priority parameters being manually arranged. No matter which kind of mode to determine that the priority of task can be according to satisfaction when there are multiple the meeting schedulable condition of the tasks using The priority of the task of schedulable condition selects the task as currently the needing to dispatch of the task.For example, still with shown in Fig. 3 It for dependence, is finished if task A and task B are dispatched, all preposition dependence task of task C, D and E are complete at this time Ministry dispatching finishes, i.e. task C, D and E is satisfied by schedulable condition, if in task C, D and E task C highest priority, thus It can be using task C as currently the needing to dispatch of the task, to following scheduler task C.
Certainly, in addition to using it is above-mentioned select in multiple the meeting schedulable condition of the tasks according to priority a task as Outside the mode for currently needing dispatching for task, a task can also be randomly choosed in multiple the meeting schedulable condition of the tasks and is made Currently to need dispatching for task, or one task work of selection in multiple the meeting schedulable condition of the tasks otherwise Currently to need dispatching for task, the present embodiment to be not especially limited this.
It should be noted that above-mentioned schedulable condition is suitable for the task with preposition dependence task, first is needed For scheduled task, since it does not have preposition dependence task, method provided in this embodiment that will give tacit consent to its preposition relies on and appoint Business scheduling finishes, thus this first need scheduled task still can first it is scheduled.In addition, triggering scheduling first When needing scheduled task, the present embodiment is not defined specific triggering mode, is including but not limited to needed for first Scheduled task creation timer when time set by time is up the timer, then can trigger and be needed to this first Scheduled task is scheduled.
204:Selected task is scheduled according to the scheduling result of the preposition dependence task of selected task;
The process that the scheduling result of the preposition dependence task of task is scheduled to being chosen task, this reality are chosen about basis It applies example to be not especially limited, including but not limited to be carried out according to actual demand.In addition, if a task is scheduled primary, then The scheduling result of this task is one.The case where needing a task by periodic scheduling, it is each to need to be scheduled Task correspond to a dispatching cycle, the available scheduling result of the primary task is often dispatched within dispatching cycle, it is right This, method provided in this embodiment is scheduled selected task according to the scheduling result of the preposition dependence task of selected task When, including but not limited to:
Obtain the preposition dependence task of the task of being chosen according to its corresponding dispatching cycle it is scheduled obtain later it is previous extremely Multiple scheduling results are scheduled selected task according to the scheduling result got.
For example, to be chosen the preposition dependence task corresponding dispatching cycle of task as day, i.e., the preposition dependence task needs For scheduling is primary daily, can obtain the preposition dependence task according to its corresponding dispatching cycle it is scheduled obtain later it is previous The at most scheduling result in day is scheduled selected task according to the scheduling result in one to multiple day before the preposition dependence task. For example, using selected task as task M, preposition dependence task is task N, and the dispatching cycle of task N is for day, can obtain Task N according to its corresponding dispatching cycle it is scheduled obtain later before one to multiple day scheduling result, according to task N's The scheduling result in preceding one to multiple day is scheduled task M.
It can also be hour, week and the moon etc. it should be noted that since the length of dispatching cycle is other than day.Therefore, Obtain different length dispatching cycle corresponding task scheduling result when, it is day that can refer to above-mentioned acquisition dispatching cycle The process of the scheduling result of task, details are not described herein again.
Further, since each task can have one or more preposition dependence task, for it is more than two it is preposition according to Rely task, and the situation that corresponding length dispatching cycle of each preposition dependence task is different, method provided in this embodiment is still It is applicable in.For example, with selected task tool there are two preposition dependence task, corresponding difference dispatching cycle of the two preposition dependence task For hour and day, i.e. one of them preposition dependence task needs to dispatch per hour primary, another preposition dependence task needs every Its scheduling is primary, then can obtain one of them preposition dependence task according to its corresponding dispatching cycle it is scheduled obtain later before The scheduling result of one or more hour, and obtain another preposition dependence task according to its corresponding dispatching cycle it is scheduled after The scheduling result in obtained preceding one to multiple day is scheduled selected task according to all scheduling results got.For example, with Selected task is task H comprising two preposition dependence task, respectively task X and task Y, and the dispatching cycle of task X be Hour, the dispatching cycle of task Y obtains for that for day, can obtain after task X is scheduled according to its corresponding dispatching cycle One or more preceding hour scheduling result, and obtain task Y according to scheduled obtaining later its corresponding dispatching cycle The scheduling result in preceding one to multiple day, according to one to multiple day before the scheduling result of one or more hour before task X and task Y Scheduling result task H is scheduled.
Further, no matter the preposition dependence task of selected task have it is several, and each preposition dependence task scheduling Whether cycle length is identical, after the preposition dependence task for obtaining the task of being chosen is scheduled according to its corresponding dispatching cycle When one or more the preceding scheduling result arrived, the present embodiment is not defined the quantity of one or more scheduling result before acquisition, It can specifically be set according to actual demand.For example, alternatively, sliding dependent mechanism may be used, i.e., for When establishing priority dependence between two tasks, can be arranged one dependence number parameter, according to rely on number parameter come for Two task creations rely on the number of scheduling result.Wherein, the dependence number parameter between task can be configured according to demand, The present embodiment is not especially limited this.For example, between task P and task Q there are dependence, task P dependence task Q's Scheduling result, and rely on number parameter be 3 for.If the dispatching cycle of task P is day, the dispatching cycle of task Q is also day, is appointed Dependence number parameter between business P and task Q is 2, then it represents that scheduler task P needs to rely on task Q according to its corresponding tune Spend scheduling result a few days ago of period when being scheduled.That is, if task Q is scheduled daily since September 2 days, Then when September needs scheduler task P on 4th, the task that needs to rely on Q is in September 2 days and September scheduling result on the 3rd.
It should be noted that in method provided in this embodiment, the length for being chosen task corresponding dispatching cycle should be big In the length of the preposition dependence task corresponding dispatching cycle equal to selected task.In above-mentioned example, it is chosen the corresponding tune of task The preposition dependence task corresponding dispatching cycle of period and the selected task is spent by taking day as an example, i.e. the corresponding scheduling of selected task The length in period is equal to the length of the preposition dependence task corresponding dispatching cycle of selected task.In practical application, it is chosen task The length of corresponding dispatching cycle can also be more than the length of the preposition dependence task corresponding dispatching cycle of selected task.Example Such as, the length for being chosen task corresponding dispatching cycle is year, is chosen the length of the preposition dependence task corresponding dispatching cycle of task Degree is the moon, then obtain the preposition dependence task of the task of being chosen according to its corresponding dispatching cycle it is scheduled obtain later it is previous extremely When multiple scheduling results, mode is identical as the principle of above-mentioned example, can obtain the preposition dependence task of selected task preceding One or more month scheduled obtained scheduling result.
In addition, for selected task corresponding dispatching cycle length be more than selected task preposition dependence task it is corresponding The case where length of dispatching cycle, obtain the preposition dependence task of the task of being chosen according to its corresponding dispatching cycle it is scheduled after When one or more obtained preceding scheduling result, one or more the preceding scheduling result got is in addition to the preposition dependence for selected task Task within its dispatching cycle from before being scheduled outside one or more scheduling result, one or more preceding scheduling result for getting Can also be selected task preposition dependence task within selected task scheduled dispatching cycle before one or more scheduling knot Fruit.For example, the length of selected task corresponding dispatching cycle is week, it is chosen the preposition dependence task corresponding dispatching cycle of task Length be day, then obtain the preposition dependence task of the task of being chosen according to its corresponding dispatching cycle it is scheduled obtain later before When one or more scheduling result, before the preposition dependence task of selected task can be obtained within scheduled one week of selected task The scheduling result in one to multiple day.More specifically, if selected task is task R, dispatching cycle is week, before being chosen task It is task T to set dependence task, if in the second week scheduler task R in March, and the dependence number ginseng between task R and task T Number is 3, then obtain the preposition dependence task of the task of being chosen according to its corresponding dispatching cycle it is scheduled obtain later it is previous extremely When multiple scheduling results, task T Monday in the second week in March to Wednesday scheduled scheduling result can be obtained.
It should be noted that for the case where selected task is first scheduled task, due to first it is scheduled Task before unscheduled task, i.e., first scheduled task is without preposition dependence task, then in the step 204 in basis When the scheduling result of the preposition dependence task of selected task is scheduled selected task, can give tacit consent to the selected task it is preposition according to It is 0 to rely the scheduling result of task, so as to be directly scheduled to selected task.Certainly, for first scheduled times The case where business is as the task of being chosen, the processing mode of the step 204 can also have other modes, the present embodiment not to make to this specifically It limits.
205:The postposition that selected task is handled in the way of in such a way that selection is chosen task and scheduling is chosen task relies on Task and all unscheduled tasks, until dispatched being scheduled for task in need.
The scheduling to being chosen task is realized by above-mentioned each step, for needing to be scheduled other in multiple tasks Not scheduled task, realization principle can be scheduled, the present embodiment no longer repeats this one by one successively through the above steps. When it is implemented, for the ease of recording being scheduled for task and facilitating the remaining task of scheduling, method provided in this embodiment It is that a preposition dependence task mark is arranged in each task that mode shown in above-mentioned table 1, which can be used, the preposition dependence task mark Whether the preposition dependence task that can be used for being recorded in each task in current task scheduling flow is finished;It has dispatched every time After one task, the corresponding preposition dependence task of task being not carried out according to the task modification of scheduling completion executes mark.Specifically After modification mode has including but not limited to dispatched a task every time, the task using the task as preposition dependence task is corresponded to Preposition dependence task mark deleted.After the completion of modification, identified according to the modified preposition dependence task of each task It determines next the needing to dispatch of the task, and needs dispatching for task to be scheduled to next, adjusted until institute is in need All scheduling finishes the task of degree.Wherein, can also be each while for each task, preposition dependence task mark is set Task is arranged postposition dependence task and identifies, and can be easily to determine the postposition of each task by postposition dependence task mark Dependence task, the present embodiment are not especially limited this.It sets up preposition dependence task mark and postposition dependence task identifies it Afterwards, the information of each task can be as shown in Table 2 below:
Table 2
Task Pre Next
A B
B A C
C B D
D C
Wherein, in list items Pre be each task preposition dependence task mark.As shown in Table 2, preposition rely on is appointed It is task A that finishing for task is all dispatched in business, then can determine that currently the needing to dispatch of the task is task A.When task A completes scheduling Afterwards, the corresponding mark of each task in table 2 can be changed, to which the content of table 3 can be obtained:
Table 3
Task Pre Next
B C
C B D
D C
In table 3, since task A scheduling finishes.Therefore, the relevant entries of task A are deleted.In addition, due to task A tune Degree finishes, and the Pre marks of each task are changed in table 2.All preposition dependence task tune of current task B as can be known from Table 3 Degree finishes, to can determine that task B is currently to need dispatching for task.Similarly, it can complete pair by the above process The scheduling of all tasks.
It should be noted that due to when to currently needing dispatching for task to be scheduled, it is understood that there may be task scheduling is lost The situation lost.Therefore, a task run pond can be set and mission failure waiting retries pond, the present embodiment is not made this specifically It limits.Wherein, task run pond retries pond for placing task scheduling failure for placing all tasks, mission failure waiting Task.Currently the needing to dispatch of the task is taken out when each scheduler task from task run pond, current needs is needed to dispatch Task scheduling fails, then puts it into mission failure waiting and retry in pond.Pond is retried when needing to reschedule mission failure waiting In before scheduling failure task when, scheduler task unsuccessfully can be waited for the task that scheduling fails before retrying in pond be placed in again Task run is scheduled in pond.
Can be that the task that each of determining needs are scheduled is set in addition, when determining the task that needs are scheduled It sets error and retries this parameter of interval time, the present embodiment is not especially limited this.Task scheduling in task run pond When failure, failed tasks can be placed in mission failure waiting and retried in pond.At this point, can according to scheduling failure task it is corresponding go out Mistake retries interval time and task is placed in task run pond again.For example, using the task of scheduling failure as task A, and task A It is corresponding error retry interval time be 5 seconds for.After task A scheduling failures, task A merging mission failures can be waited for Pond is retried, after 5 seconds, task A can be placed in again in task run pond.Furthermore it is also possible to for the task setting established This parameter of maximum reattempt times, the present embodiment are not especially limited this.When the number of task scheduling failure reaches maximum weight When trying number, then it can stop dispatching the task again.For example, using the task of scheduling failure as task A, and A pairs of task For the maximum reattempt times answered are 3 times.When the number of task A scheduling failures reaches 3 times, then can stop carrying out task A Scheduling.
Method provided in an embodiment of the present invention, by determining the dependence between each task for needing to be scheduled, And after determining preposition dependence task and the postposition dependence task of each task according to dependence, according to the quilt for meeting schedulable condition The scheduling result for selecting for a post the preposition dependence task of business carries out task scheduling to selected task, and dispatches other unscheduled timess according to this Business so as to simplify task scheduling process, and can ensure that task orderly executes.Therefore, the efficiency of scheduler task is higher.
Another embodiment of the present invention provides a kind of task scheduling apparatus based on HIVE tasks, and the device is for executing State the method that any embodiment provides in each embodiment.Referring to Fig. 4, which includes:
First determining module 401, for determining the multiple tasks that are scheduled of needs, and determine between each task according to The relationship of relying;
Second determining module 402, preposition dependence task and postposition for determining each task according to the dependence Dependence task;
Selecting module 403, for in being scheduled for task in need selection currently need dispatching for task, obtain Selected task;
Scheduler module 404, according to the scheduling result of the preposition dependence task of the selected task to the selected task into Row scheduling;
Processing module 405, in the way of selecting the selected task and in the way of the scheduling selected task Manage the postposition dependence task of the selected task and all unscheduled tasks, until dispatch it is in need be scheduled times Business.
As a kind of alternative embodiment, the selecting module 403, for select in being scheduled for task in need Meet the task of schedulable condition as currently the needing to dispatch of the task;Wherein, the schedulable condition is all preposition dependence task All scheduling finishes.
As a kind of alternative embodiment, the selecting module 403, for when there is multiple the meeting schedulable condition of the tasks, By the multiple the meeting schedulable condition of the task as currently the needing to dispatch of the task, alternatively, according to priority described more Select a task as currently the needing to dispatch of the task in a the meeting schedulable condition of the task.
As a kind of alternative embodiment, being scheduled for task is each needed to correspond to a dispatching cycle;Referring to Fig. 5, The scheduler module 404, including:
Acquiring unit 4041, for obtaining the preposition dependence task of the selected task according to its corresponding quilt dispatching cycle Dispatch one or more the preceding scheduling result obtained later;
Scheduling unit 4042, for being scheduled to the selected task according to the scheduling result got.
Alternatively, second determining module 402, any task for being scheduled to needs will It is described there are being determined as by the task that any task relies on scheduling result in the task of dependence with any task The preposition dependence task of any task, and the task for the scheduling result for relying on any task is determined as any task Postposition dependence task.
Device provided in an embodiment of the present invention, by determining the dependence between each task for needing to be scheduled, And after determining preposition dependence task and the postposition dependence task of each task according to dependence, according to the quilt for meeting schedulable condition The scheduling result for selecting for a post the preposition dependence task of business carries out task scheduling to selected task, and dispatches other unscheduled timess according to this Business so as to simplify task scheduling process, and can ensure that task orderly executes.Therefore, the efficiency of scheduler task is higher.
Fig. 5 is a kind of block diagram of server 1900 shown according to an exemplary embodiment.For example, server 1900 can be with It is provided as a server.With reference to Fig. 5, server 1900 includes processing component 1922, further comprises one or more places Manage device and memory resource represented by a memory 1932, for store can by the instruction of the execution of processing component 1922, Such as application program.The application program stored in memory 1932 may include it is one or more each correspond to one The module of group instruction.In addition, processing component 1922 is configured as executing instruction, to execute the implementation corresponding to above-mentioned Fig. 1 or Fig. 2 Method in example performed by the task scheduling apparatus based on HIVE tasks, execute method process specifically refer to above-mentioned Fig. 1 or The method content of embodiment illustrated in fig. 2, details are not described herein again.
Server 1900 can also include the power management that a power supply module 1926 is configured as execute server 1900, One wired or wireless network interface 1950 is configured as server 1900 being connected to network and an input and output (I/O) Interface 1958.Server 1900 can be operated based on the operating system for being stored in memory 1932, such as Windows ServerTM, Mac OS XTM, UnixTM, LinuxTM, FreeBSDTM or similar.
Server provided in an embodiment of the present invention is closed by the dependence determined between each task for needing to be scheduled System, and after determining according to dependence preposition dependence task and the postposition dependence task of each task, according to meeting schedulable condition The scheduling result of preposition dependence task of selected task task scheduling is carried out to selected task, and it is unscheduled to dispatch other according to this Task, so as to simplify task scheduling process, and can ensure that task orderly executes.Therefore, the efficiency of scheduler task compared with It is high.
It should be noted that:Above-described embodiment provide the task scheduling apparatus based on HIVE tasks in scheduler task, It only the example of the division of the above functional modules, can be as needed and by above-mentioned function distribution in practical application It is completed by different function modules, i.e., the internal structure of device is divided into different function modules, it is described above to complete All or part of function.In addition, the task scheduling apparatus based on HIVE tasks that above-described embodiment provides is appointed with based on HIVE The method for scheduling task embodiment of business belongs to same design, and specific implementation process refers to embodiment of the method, and which is not described herein again.
The embodiments of the present invention are for illustration only, can not represent the quality of embodiment.
One of ordinary skill in the art will appreciate that realizing that all or part of step of above-described embodiment can pass through hardware Complete, relevant hardware can also be instructed to complete by program, program can be stored in a kind of computer-readable storage In medium, storage medium mentioned above can be read-only memory, disk or CD etc..
The foregoing is merely a prefered embodiment of the invention, is not intended to limit the invention, all in the spirit and principles in the present invention Within, any modification, equivalent replacement, improvement and so on should all be included in the protection scope of the present invention.

Claims (8)

1. a kind of method for scheduling task based on HIVE tasks, which is characterized in that the method includes:
It determines the multiple tasks for needing to be scheduled, and determines the dependence between each task;
The preposition dependence task and postposition dependence task of each task are determined according to the dependence;
In being scheduled for task in need selection currently need dispatching for task, obtain being chosen task;
The selected task is scheduled according to the scheduling result of the preposition dependence task of the selected task;
The postposition of the selected task is handled in the way of selecting the selected task and in the way of the scheduling selected task Dependence task and all unscheduled tasks, until dispatched being scheduled for task in need, wherein described in the selection The mode of selected task is the task that selection currently needs to dispatch in institute's being scheduled for task in need, obtains being selected for a post Business;The mode of the scheduling selected task is the scheduling result according to the preposition dependence task of the selected task to described Selected task is scheduled,
The method for scheduling task based on HIVE tasks, which is characterized in that each the needing to be scheduled of the task is right A dispatching cycle is answered,
The scheduling result of the preposition dependence task according to the selected task is scheduled the selected task, including:
Obtain the preposition dependence task of the selected task according to its corresponding dispatching cycle it is scheduled obtain later it is previous extremely Multiple scheduling results are scheduled the selected task according to the scheduling result got.
2. according to the method described in claim 1, it is characterized in that, it is described select to work as in being scheduled for task in need Preceding the needing to dispatch of the task, including:
Select the meeting schedulable condition of the task as currently the needing to dispatch of the task in being scheduled for task in need;Its In, the schedulable condition is that all scheduling finishes all preposition dependence task.
3. according to the method described in claim 2, it is characterized in that, it is described select in being scheduled for task in need it is full The task of sufficient schedulable condition as currently the needing to dispatch of the task, including:
If there is multiple the meeting schedulable condition of the tasks, the multiple the meeting schedulable condition of the task is used as and currently needs to adjust The task of degree, alternatively, selecting a task as current need in the multiple the meeting schedulable condition of the task according to priority Being dispatched for task.
4. the method according to any claim in claims 1 to 3, which is characterized in that described to be closed according to the dependence System determines the preposition dependence task and postposition dependence task of each task, including:
To any task for being scheduled of needs, by with any task there are in the task of dependence by described any The task of business dependence scheduling result is determined as the preposition dependence task of any task, and the tune that will rely on any task The task of degree result is determined as the postposition dependence task of any task.
5. a kind of task scheduling apparatus based on HIVE tasks, which is characterized in that described device includes:
First determining module, the multiple tasks being scheduled for determining needs, and determine the dependence between each task;
Second determining module, preposition dependence task and postposition for determining each task according to the dependence, which rely on, appoints Business;
Selecting module, for in being scheduled for task in need selection currently need dispatching for task, obtain being selected for a post Business;
Scheduler module is scheduled the selected task according to the scheduling result of the preposition dependence task of the selected task;
Processing module, for handling the quilt in the way of selecting the selected task and in the way of the scheduling selected task Select for a post the postposition dependence task of business and all unscheduled tasks, until dispatched being scheduled for task in need, wherein The mode of the selection selected task is the task that selection currently needs to dispatch in institute's being scheduled for task in need, Obtain selected task;The mode of the scheduling selected task is the scheduling according to the preposition dependence task of the selected task As a result the selected task is scheduled,
The task scheduling apparatus based on HIVE tasks, which is characterized in that each need being scheduled for task corresponding one A dispatching cycle,
The scheduler module, including:
Acquiring unit, after the preposition dependence task for obtaining the selected task is scheduled according to its corresponding dispatching cycle One or more obtained preceding scheduling result;
Scheduling unit, for being scheduled to the selected task according to the scheduling result got.
6. device according to claim 5, which is characterized in that the selecting module, in need being scheduled in institute Task in select the meeting schedulable condition of the task as currently the needing to dispatch of the task;Wherein, the schedulable condition is all All scheduling finishes preposition dependence task.
7. device according to claim 6, which is characterized in that the selecting module has multiple satisfactions to dispatch items for working as When the task of part, by the multiple the meeting schedulable condition of the task as currently the needing to dispatch of the task, alternatively, according to preferential Grade selects a task as currently the needing to dispatch of the task in the multiple the meeting schedulable condition of the task.
8. the device according to any claim in claim 5 to 7, which is characterized in that second determining module is used In to any task for being scheduled of needs, by with any task there are in the task of dependence by any task The relying on scheduling result of the task is determined as the preposition dependence task of any task, and the scheduling that will rely on any task As a result task is determined as the postposition dependence task of any task.
CN201410831524.5A 2014-12-26 2014-12-26 Method for scheduling task based on HIVE tasks and device Active CN104536811B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410831524.5A CN104536811B (en) 2014-12-26 2014-12-26 Method for scheduling task based on HIVE tasks and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410831524.5A CN104536811B (en) 2014-12-26 2014-12-26 Method for scheduling task based on HIVE tasks and device

Publications (2)

Publication Number Publication Date
CN104536811A CN104536811A (en) 2015-04-22
CN104536811B true CN104536811B (en) 2018-10-16

Family

ID=52852343

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410831524.5A Active CN104536811B (en) 2014-12-26 2014-12-26 Method for scheduling task based on HIVE tasks and device

Country Status (1)

Country Link
CN (1) CN104536811B (en)

Families Citing this family (24)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN105912387A (en) * 2015-08-25 2016-08-31 乐视网信息技术(北京)股份有限公司 Method and device for dispatching data processing operation
CN106528275A (en) * 2015-09-10 2017-03-22 网易(杭州)网络有限公司 Processing method of data tasks and task scheduler
CN105321045A (en) * 2015-11-04 2016-02-10 北京知聚科技有限公司 Service process formal model construction method and system
CN105389207A (en) * 2015-11-06 2016-03-09 成都视达科信息技术有限公司 Adaptive data request processing method and apparatus, task scheduler and adaptive data request processing system
CN106878039A (en) * 2015-12-14 2017-06-20 中兴通讯股份有限公司 A kind of version task scheduling and managing method and system
CN105701624A (en) * 2016-02-26 2016-06-22 广州品唯软件有限公司 Task processing method and device
CN107179896A (en) * 2016-03-09 2017-09-19 阿里巴巴集团控股有限公司 Task processing method and device
CN107818112B (en) * 2016-09-13 2021-12-14 腾讯科技(深圳)有限公司 Big data analysis operating system and task submitting method
CN107085536B (en) * 2016-11-14 2020-09-18 阿里巴巴集团控股有限公司 Task management method and device
CN107168781A (en) * 2017-04-07 2017-09-15 广东银禧科技股份有限公司 A kind of 3D printing subtask scheduling method and apparatus
CN109783208A (en) * 2017-11-13 2019-05-21 阿里巴巴集团控股有限公司 Big data job scheduling method, platform, equipment and medium
CN108197778A (en) * 2017-12-15 2018-06-22 远光软件股份有限公司 A kind of method for allocating tasks and device
CN109995824B (en) * 2017-12-29 2022-10-04 阿里巴巴集团控股有限公司 Task scheduling method and device in peer-to-peer network
CN108763482B (en) * 2018-05-25 2022-05-31 联想(北京)有限公司 Method and device for scheduling data analysis process and server cluster
CN110737516A (en) * 2018-07-20 2020-01-31 网宿科技股份有限公司 method and device for executing data processing task
CN109062680A (en) * 2018-08-15 2018-12-21 腾讯科技(深圳)有限公司 A kind of data load method, device and storage medium
CN110096345B (en) * 2019-03-16 2024-04-12 平安科技(深圳)有限公司 Intelligent task scheduling method, device, equipment and storage medium
CN110069572B (en) * 2019-03-19 2022-08-02 深圳壹账通智能科技有限公司 HIVE task scheduling method, device, equipment and storage medium based on big data platform
CN111190725A (en) * 2019-08-09 2020-05-22 腾讯科技(深圳)有限公司 Task processing method and device, storage medium and server
CN110633914A (en) * 2019-09-20 2019-12-31 中国银行股份有限公司 Batch job scheduling processing method and device
CN110764910A (en) * 2019-10-23 2020-02-07 中国银行股份有限公司 Batch job scheduling processing method and device
CN110837509A (en) * 2019-11-08 2020-02-25 深圳市彬讯科技有限公司 Method, device, equipment and storage medium for scheduling dependence
CN113010289A (en) * 2021-03-17 2021-06-22 杭州遥望网络科技有限公司 Task scheduling method, device and system
CN117032999B (en) * 2023-10-09 2024-01-30 之江实验室 CPU-GPU cooperative scheduling method and device based on asynchronous running

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102279888A (en) * 2011-08-24 2011-12-14 北京新媒传信科技有限公司 Method and system for scheduling tasks
CN102364447A (en) * 2011-10-28 2012-02-29 北京航空航天大学 Operation scheduling method for optimizing communication energy consumption among multiple tasks
CN102681894A (en) * 2011-03-09 2012-09-19 中兴通讯股份有限公司 Method and system for multitask concurrent scheduling
CN102880503A (en) * 2012-08-24 2013-01-16 新浪网技术(中国)有限公司 Data analysis system and data analysis method

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
FR2965948A1 (en) * 2010-10-07 2012-04-13 Commissariat Energie Atomique SYSTEM FOR ORDERING THE EXECUTION OF CADENCE TASKS BY VECTOR LOGIC TIME

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102681894A (en) * 2011-03-09 2012-09-19 中兴通讯股份有限公司 Method and system for multitask concurrent scheduling
CN102279888A (en) * 2011-08-24 2011-12-14 北京新媒传信科技有限公司 Method and system for scheduling tasks
CN102364447A (en) * 2011-10-28 2012-02-29 北京航空航天大学 Operation scheduling method for optimizing communication energy consumption among multiple tasks
CN102880503A (en) * 2012-08-24 2013-01-16 新浪网技术(中国)有限公司 Data analysis system and data analysis method

Also Published As

Publication number Publication date
CN104536811A (en) 2015-04-22

Similar Documents

Publication Publication Date Title
CN104536811B (en) Method for scheduling task based on HIVE tasks and device
CN106802826B (en) Service processing method and device based on thread pool
CN104216785B (en) General policies task system and its implementation
CN103593236B (en) Computer equipment, method and device for scheduling service process
US20070198558A1 (en) Method and system of intelligent work management
CN105630588A (en) Distributed job scheduling method and system
CN110751358A (en) Scheduling method for airport ground service personnel, electronic equipment and storage medium
EP3188096A1 (en) Data analysis for predictive scheduling optimization for product production
US20120216203A1 (en) Holistic task scheduling for distributed computing
JP2011040059A5 (en)
US20190050786A1 (en) Task Assisted Resources Assignment Based On Schedule Impact
CN109670780A (en) Workflow processing method, equipment and storage medium under complex scene
CN110764747A (en) Data calculation scheduling method based on Airflow
CN107784400A (en) A kind of execution method and apparatus of business model
CN109284324A (en) The dispatching device of flow tasks based on Apache Oozie frame processing big data
CN109298929A (en) Timing task carrying-out time recommended method, device, equipment and storage medium
JP2015132950A (en) Service request reception system and service request reception method
CN106648839A (en) Method and device for processing data
US20190347604A1 (en) System and Method for Generation of a Process-Oriented User Interface
CN107797856B (en) Scheduled task management and control method and device based on windows service and storage medium
CN106874079A (en) A kind of method and device of tasks carrying
CN102096857B (en) Collaboration method and device for data processing process
CN105446812A (en) Multitask scheduling configuration method
CN105512313B (en) A kind of method and apparatus of incremented data processing
Schneider et al. Benefits of digitalization for business processes in semiconductor manufacturing

Legal Events

Date Code Title Description
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
CB02 Change of applicant information
CB02 Change of applicant information

Address after: 511446 Guangzhou City, Guangdong Province, Panyu District, South Village, Huambo Business District Wanda Plaza, block B1, floor 28

Applicant after: Guangzhou Huaduo Network Technology Co., Ltd.

Address before: 510655, Guangzhou, Whampoa Avenue, No. 2, creative industrial park, building 3-08,

Applicant before: Guangzhou Huaduo Network Technology Co., Ltd.

GR01 Patent grant
GR01 Patent grant