CN106814993B - It determines the method for task schedule time, determine the method and apparatus of task execution time - Google Patents
It determines the method for task schedule time, determine the method and apparatus of task execution time Download PDFInfo
- Publication number
- CN106814993B CN106814993B CN201510876021.4A CN201510876021A CN106814993B CN 106814993 B CN106814993 B CN 106814993B CN 201510876021 A CN201510876021 A CN 201510876021A CN 106814993 B CN106814993 B CN 106814993B
- Authority
- CN
- China
- Prior art keywords
- task
- time
- scheduling
- granularity
- scheduling time
- 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
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/30—Arrangements for executing machine instructions, e.g. instruction decode
- G06F9/38—Concurrent instruction execution, e.g. pipeline, look ahead
- G06F9/3867—Concurrent instruction execution, e.g. pipeline, look ahead using instruction pipelines
- G06F9/3869—Implementation aspects, e.g. pipeline latches; pipeline synchronisation and clocking
Abstract
The invention discloses the methods and apparatus for determining the task schedule time, judge the dependence between first task and the second task；When determining first task dependent on the second task: judging the relationship of the scheduling time granularity of first task and the second task；When the scheduling time granularity of first task is not equal to the scheduling time granularity of the second task, first task is dispatched with the scheduling time of the thicker person of scheduling time granularity in first task and the second task；When the scheduling time granularity of first task is equal to the scheduling time granularity of the second task: judging the relationship of the scheduling time for the first time of first task and the second task；With the scheduling time of scheduling time later person dispatches first task for the first time in first task and the second task.Method and apparatus for determining the method for task execution time and determining task execution time for each task in a network is also provided simultaneously.Task schedule can be made to become simple, feasible, correct, efficient by complicated dependence by the scheduling mechanism through the invention.
Description
Technical field
The present invention relates to electronic information technologies, appoint more particularly, to the method for determining task schedule time a kind of, determination
The method and apparatus that business executes the time.
Background technique
Task schedule is operating system, operating mechanism common in data base administration.In task schedule, for example,
More commonly used mode is under Linux system by the way of crontab, and task can be performed in timer-triggered scheduler, for example,
The basic format of crontab is basic format:
* * * * * command
The order of timesharing life week
1st column indicate that minute 1~59 is indicated with * or */1 per minute
2nd column indicate hour 1~23 (0 indicates at 0 point)
3rd column indicate the date 1~31
4th column indicate month 1~12
5th column identification number week 0~6 (0 indicates Sunday)
The 6th column order to be run
The problem of in the presence of similar task schedule is if there is the data dependence successively executed between multiple tasks
Relationship, especially in distributed structure/architecture, task is dispatched by different entities and trip, and the prior art can only pass through the time
Sequencing carrys out the dispatching sequence between guarantee task, and it is chaotic that this easilys lead to scheduling.If mission failure, it is difficult to allow it
Dependence task does not execute.And complicated scheduling time is relied on and almost cannot achieve, for example scheduling time is 8,96,
The task of 18*** (daily 6:08,6:09,18:08,18:09 executes primary) is 1010,20*** (daily dependent on scheduling time
10:10,20:10 respectively execute primary) task, then almost can not correctly be dispatched according to crontab.
Further, for cross-dependence task, crontab is even more helpless, and as shown in figure 12, Task2 relies on flowing water
The Task1 (30 points per hour of scheduling time) of line Pipeline1, while the task task 5 for relying on assembly line Pipeline2 (is adjusted
Spending the time is 10 points per hour), but the Task4 of assembly line Pipeline2 relies on the Task3 of assembly line Pipeline1, flowing water
The Task5 of line Pipeline2 again relies on Task4, and it is cross-dependence that this, which results in the dependence of Task2, then Task2 can not be
Correctly scheduling is realized in traditional crontab mechanism.
Present inventors have realized that in the scheduling of task schedule, particularly crontab task, it may appear that task it
Between cross-dependence or it is complicated rely on caused by the case where can not correctly dispatching, and this problem in the prior art from
It is not resolved, therefore needs to propose the determination method and apparatus of the scheduling time of task a kind of to solve the problems, such as this.
Summary of the invention
According to the first aspect of the invention, a kind of method for determining the task schedule time is provided, comprising: judge
Dependence between one task and the second task；When first task determining in the step of in the judgement dependence depends on
When the second task: judging the relationship of the scheduling time granularity of the first task and the second task；And work as the first task
Scheduling time granularity be not equal to second task scheduling time granularity when, to be adjusted in the first task and the second task
The scheduling time for spending the thicker person of time granularity dispatches the first task；When the scheduling time granularity of the first task is equal to institute
When stating the scheduling time granularity of the second task: judging the relationship of the scheduling time for the first time of the first task and the second task；With
And with the scheduling time of scheduling time later person dispatches the first task for the first time in the first task and the second task.
Preferably, the method also includes: before dispatching the first task, judge whether second task executes into
The step of function.
Preferably, in which: the scheduling time granularity according to task using year, month, day, hour or minute as task schedule when
Between granularity unit of account, only with the task schedule number on the unit of account of most coarseness present in the first and second tasks
Scheduling time granularity as the task.
According to the second aspect of the invention, a kind of programmable device, including memory and processor are provided, wherein institute
State memory for storing instruction, described instruction is operated for controlling the processor to execute method above-mentioned.
According to the third aspect of the present invention, a kind of method for determining task execution time is provided, comprising: according to this
The scheduling time of task and current time calculate the execution time for the first time of this task；Obtain what this task directly or indirectly relied on
Other tasks are respective to execute time and the respective scheduling time granularity of other tasks for the first time；Judge the scheduling of described task
The relationship of time granularity and the respective scheduling time granularity of other described tasks, and when judging the execution for the first time of described task
Between with other tasks it is respective for the first time execute the time relationship, to execute the time for the first time in the most thick task of scheduling time granularity
Task the latest executes execution time of the time as described task for the first time.
Preferably, in which: described each the step of executing the time for the first time for obtaining other tasks for being relied on of this task includes
The respective of other tasks, which is calculated, according to other described tasks respective scheduling time and current time executes the time for the first time.
Preferably, the method also includes: before executing this task, other tasks for judging that described task is relied on are
No the step of running succeeded respectively.
Preferably, in which: the scheduling time granularity according to task using year, month, day, hour or minute as task schedule when
Between granularity unit of account, only using the task schedule number on the unit of account of most coarseness present in the task as this
The scheduling time granularity of business.
Preferably, the method also includes: when by the scheduling for executing time and this task for the first time of calculated task
Between granularity notify to depend on this task other tasks the step of.
According to the fourth aspect of the present invention, a kind of programmable device, including memory and processor are provided, wherein institute
State memory for storing instruction, described instruction is operated for controlling the processor to execute method above-mentioned.
According to the fifth aspect of the invention, a kind of side determining task execution time for each task in a network is provided
Method, includes multiple tasks assembly line in the network, and each task pipeline includes start node task and depends on described
Other one or more tasks of start node task, task scheduling time having the same and tune in the task pipeline
Spend time granularity, comprising:
For determining that the dependence of the dependence between the task in each assembly line and the task between assembly line is closed
The step of being；
For calculating the execution for the first time of task in assembly line according to the scheduling time of task in each assembly line and current time
The step of time；
For by the scheduling time granularity for executing task in time and assembly line for the first time of task in identified assembly line
It is sent to the step of depending directly or indirectly on the task in assembly line in other assembly lines of each task step by step respectively；
For for each task, judge the task scheduling time granularity and acquired task scheduling time granularity it
Between relationship and judge the task the relationship for executing the time for the first time for executing time and acquired task for the first time step
Suddenly；And
For being made with the time of execution for the first time for executing the task of time the latest in the most thick task of scheduling time granularity for the first time
For the task the execution time the step of.
Preferably, in which: the scheduling time granularity according to task using year, month, day, hour or minute as task schedule when
Between granularity unit of account, only using the task schedule number on the unit of account of most coarseness present in the task as this
The scheduling time granularity of business.
According to the sixth aspect of the invention, a kind of programmable device, including memory and processor are provided, wherein institute
State memory for storing instruction, described instruction is operated for controlling the processor to execute method above-mentioned.
According to the seventh aspect of the present invention, a kind of equipment for determining the task schedule time is provided, comprising:
First judgment means, for judging the dependence between first task and the second task；
Second judgment means, for sentencing when first judgment means determine first task dependent on the second task
The relationship of the scheduling time granularity of the first task of breaking and the second task, when the scheduling time granularity of the first task differs
Judging result is sent to dispatching device, and the tune when the first task when scheduling time granularity of second task
When spending scheduling time granularity of the time granularity equal to second task, the tune for the first time of the first task Yu the second task is judged
The relationship of time is spent, and judging result is sent to dispatching device；
Dispatching device is not equal to the scheduling time of second task for the scheduling time granularity when the first task
The first task is dispatched with the scheduling time of the thicker person of scheduling time granularity in the first task and the second task when granularity,
And when scheduling time granularity for being equal to second task when the scheduling time granularity of the first task, with described the
The scheduling time of scheduling time later person dispatches the first task for the first time in one task and the second task.
Preferably, the equipment further include:
Third judgment means, for judging whether second task runs succeeded before dispatching the first task.
Preferably, in which: the scheduling time granularity according to task using year, month, day, hour or minute as task schedule when
Between granularity unit of account, only using the task schedule number on the unit of account of most coarseness present in the task as this
The scheduling time granularity of business.
According to the eighth aspect of the present invention, a kind of equipment for determining task execution time is provided, comprising:
This mission bit stream acquisition device, for calculating this task for the first time according to the scheduling time and current time of this task
Execute the time；
Dependence task information acquisition device, the respective head of other tasks directly or indirectly relied on for obtaining this task
Secondary execution time and the respective scheduling time granularity of other tasks；
Judgment means, for judge described task scheduling time granularity and other tasks respective scheduling time
The relationship of granularity, and judge the pass for executing time and the respective execution time for the first time of other tasks for the first time of described task
System；
Dispatching device, for execute holding for the first time for the task of time the latest for the first time in the most thick task of scheduling time granularity
Execution time of the row time as described task.
Preferably, in which: dependence task information acquisition device, for according to other tasks respective scheduling time and
Current time calculates the respective of other tasks and executes the time for the first time.
Preferably, the equipment further include: for judging before executing this task, described task relied on other
The device whether business runs succeeded respectively.
Preferably, in which: the scheduling time granularity according to task using year, month, day, hour or minute as task schedule when
Between granularity unit of account, only using the task schedule number on the unit of account of most coarseness present in the task as this
The scheduling time granularity of business.
Preferably, the equipment further include: notice device, for by the time of execution for the first time of calculated task and this
The scheduling time granularity of task is notified to other tasks for depending on this task.
According to the ninth aspect of the present invention, it provides and a kind of determines task execution time for each task in a network
Equipment, includes multiple tasks assembly line in the network, and each task pipeline includes start node task and dependent on institute
State other one or more tasks of start node task, task scheduling time having the same in the task pipeline and
Scheduling time granularity, comprising:
For determining that the dependence of the dependence between the task in each assembly line and the task between assembly line is closed
The device of system；
For calculating the execution for the first time of task in assembly line according to the scheduling time of task in each assembly line and current time
The device of time；
For by the scheduling time granularity for executing task in time and assembly line for the first time of task in identified assembly line
It is sent to the device for depending directly or indirectly on the task in assembly line in other assembly lines of each task step by step respectively；
For for each task, judge the task scheduling time granularity and acquired task scheduling time granularity it
Between relationship and judge the task the relationship for executing the time for the first time for executing time and acquired task for the first time dress
It sets；And
For being made with the time of execution for the first time for executing the task of time the latest in the most thick task of scheduling time granularity for the first time
For the device of the execution time of the task.
Preferably, in which: the scheduling time granularity according to task using year, month, day, hour or minute as task schedule when
Between granularity unit of account, only using the task schedule number on the unit of account of most coarseness present in the task as this
The scheduling time granularity of business.
It was found by the inventors of the present invention that in the prior art, there has been no technical solutions to be able to solve for task schedule, spy
It is not the defect that can not correctly dispatch caused by being relied in the scheduling of crontab task cross-dependence or complexity.Cause
This, the technical assignment to be realized of the invention or never expect the technical problem to be solved is that those skilled in the art or
Person it is not expected that, therefore the present invention is a kind of new technical solution.
In addition, it will be appreciated by those skilled in the art that although many problems exist in the prior art, it is of the invention
The technical solution of each embodiment or claim can be improved only at one or several aspects, existing without solving simultaneously
The whole technical problems for having in technology or being listed in background technique.It will be appreciated by those skilled in the art that for a right
The content that do not mention in it is required that should not be taken as the limitation for the claim.
By referring to the drawings to the detailed description of exemplary embodiment of the present invention, other feature of the invention and its
Advantage will become apparent.
Detailed description of the invention
It is combined in the description and the attached drawing for constituting part of specification shows the embodiment of the present invention, and even
With its explanation together principle for explaining the present invention.
Fig. 1 shows the flow chart of the method for determining the task schedule time according to a first embodiment of the present invention.
The block diagram of the equipment 200 of Fig. 2 second embodiment according to the present invention.
Fig. 3 shows 200 schematic diagram of equipment of third embodiment according to the present invention.
Fig. 4 is the flow chart of the method for determining task execution time of fourth embodiment according to the present invention.
Fig. 5 is the block diagram of the equipment 500 of fifth embodiment according to the present invention.
Fig. 6 is seventh embodiment according to the present invention for determining task execution time for each task in a network
Method flow chart.
Fig. 7 is the line task dependence graph of seventh embodiment according to the present invention.
Fig. 8-10 is the network flow node line task dependence graph of seventh embodiment according to the present invention.
Figure 11 is the block diagram of the equipment 1100 of the 8th embodiment according to the present invention.
Figure 12 is the schematic diagram according to the example of task dependence in the prior art.
Specific embodiment
Carry out the various exemplary embodiments of detailed description of the present invention now with reference to attached drawing.It should also be noted that unless in addition having
Body explanation, the unlimited system of component and the positioned opposite of step, numerical expression and the numerical value otherwise illustrated in these embodiments is originally
The range of invention.
Be to the description only actually of at least one exemplary embodiment below it is illustrative, never as to the present invention
And its application or any restrictions used.
Technology, method and apparatus known to person of ordinary skill in the relevant may be not discussed in detail, but suitable
In the case of, the technology, method and apparatus should be considered as part of specification.
It is shown here and discuss all examples in, any occurrence should be construed as merely illustratively, without
It is as limitation.Therefore, other examples of exemplary embodiment can have different values.
It should also be noted that similar label and letter indicate similar terms in following attached drawing, therefore, once a certain Xiang Yi
It is defined in a attached drawing, then in subsequent attached drawing does not need that it is further discussed.
<definition>
Before the embodiments of the invention are explained in detail, it needs to determine term used in each embodiment according to the present invention
Justice, the definition are suitable for each embodiment according to the present invention and subsidiary claim.
1. the dependence between task: referring to the correlation between different task, for example if task b's holds
At the beginning of capable and completion influences whether task a, then the scheduling of task a is dependent on the scheduling of task b, that is, task
The task that b is relied on by task a.
2. task schedule time granularity: referring to the quantity of the scheduler task within unit scheduling time.For example, in unit
In 1 day time, scheduling time of task a is daily 8 points, then the scheduling time granularity of task a is 1, and the scheduling time of task b is
Each integral point hour, then the scheduling time granularity of task b is 24.The scheduling of scheduling time granularity (1 time) than task b of task a
Time granularity (24 times) is thicker.
3. the scheduling time for the first time of task: referring to the scheduling time for the first time of task defined in task format.
4. task pipeline: the process being made of multiple tasks, and identical scheduling is arranged to the task in the assembly line
Time.
5. executing the time: refer to specific time when task start, such as 201509301500, i.e., 2015 September 30
15 points of 00 minute execution tasks.
6. directly relying on: referring to existing direct, without the intervention of third party's task correlation between different task.
For example if the scheduling of task a is with regard to straight at the beginning of the execution and completion of task b will have a direct impact on task a
Connect the scheduling dependent on task b, that is, the task that task b is directly relied on by task a.
7. indirectly relying on: refer between different task it is existing indirectly, there are the interventions of one or more third party's tasks
Correlation.For example if task c's holds at the beginning of the execution and completion of task b will have a direct impact on task a
At the beginning of capable and completion will have a direct impact on task b, then the scheduling of task a just indirectly depends on the scheduling of task c,
It is exactly the task that task c is indirectly relied on by task a.
8. the unit of account of task schedule time granularity: refer to year, month, day, when or be divided into the tune of unit calculating task
Spend time granularity.
<embodiment 1>
Fig. 1 shows the flow chart of the method for determining the task schedule time of embodiment according to the present invention.
As shown in Figure 1, method starts in step S101.Then, in step 102, judge first task and the second task it
Between dependence.It should be noted that the first task occurred in the present embodiment and other embodiments, the second task, appoint
Business a, task b etc. description are to illustrate convenient and define, be not intended to refer in particular to some, certain two or certain tasks, according to this hair
Bright various embodiments, the task may refer to arbitrary task.
In step S103, determine whether first task depends on the second task, if first task is independent of second
It is engaged in, then first task described in the primitive scheduling time scheduling according to step S104 according to first task.If sentenced in step S103
First task is determined dependent on the second task, then just it needs to be determined that first task is scheduled with which kind of mechanism.
In step S105, the relationship of the scheduling time granularity of first task and the second task is judged.If in step S106,
Determine that the scheduling time granularity of first task is not equal to the scheduling time granularity of the second task, with the first task and second
The scheduling time of the thicker person of scheduling time granularity dispatches the first task in business.Specifically, further sentence in step S107
Whether the scheduling time granularity of disconnected first task is coarser than the scheduling time granularity of the second task, if the scheduling time of first task
Granularity is thicker, then in step S108, first task described in the primitive scheduling time scheduling with first task；If the second task
Scheduling time granularity is thicker, then in step S109, dispatches the first task with the scheduling time of the second task.
If determining that the scheduling time granularity of first task is equal to the scheduling time granularity of the second task in step S106,
The relationship of the scheduling time for the first time of first task and the second task is then judged in step S110.If determining the in step S111
The scheduling time for the first time of one task earlier than the second task scheduling time for the first time, then in step S113, with the scheduling of the second task
First task described in time scheduling.If the scheduling time for the first time of first task is not later than the second task, in step S112,
First task described in the primitive scheduling time scheduling of one task.
Preferably, the method also includes judging whether second task executes into before dispatching the first task
The step of function.
It is highly preferred that the scheduling time granularity is according to task using year, month, day, hour or minute as the task schedule time
The unit of account of granularity, only using the task schedule number on the unit of account of most coarseness present in the task as the task
Scheduling time granularity.
Attached drawing is had been combined above describes the first embodiment of the present invention, it can be by complicated dependence according to the present embodiment
Relationship makes task schedule become simple, feasible, correct, efficient by the scheduling mechanism.
<example 1>
Specific example according to a first embodiment of the present invention is described below, there are the two of dependence appoint
Between business, coarseness task priority is followed when determining Task Scheduling Mechanism higher than finegrained tasks priority, granularity is identical
The higher principle of first scheduling time more late priority of task.
By taking crontab task schedule as an example, scheduling time is: its day granularity of task a of 10**** is 24, i.e., each hour
10 points of one subtasks of execution, scheduling time is: the task b of 01***, a day granularity are 1, i.e., daily 1:00 executes primary.
If the scheduling time of task b dependence task a, task b need to select between 10**** and 01***, root
According to the method for first embodiment of the invention, the scheduling time granularity of task b is that the 1 scheduling time granularity 24 than task a is thicker, institute
01*** is selected with scheduling time of task b, i.e. task b is on the day before checking task a after 24 task executions successes, task b
Just dispatch.
If task a depends on task b, method according to a first embodiment of the present invention, when the scheduling of task a and task b
Between be all 01***, i.e., after task b runs succeeded, just scheduler task a, i.e. the primitive scheduling time of task a are invalid immediately.
<example 2>
Example 2 is more complicated time scheduling, task a:0,10,20,30,40,5010,20***, task b:0,3010,
The granularity of 15,20***, task a are 12, and the granularity of task b is 6, and the two is not originally identical, but in this example, in the task
Scheduling time granularity of the task schedule number as the task on the unit of account of existing most coarseness.I.e. with hour rank
Granularity is calculated, minute rank is not involved in Granular Computing, and therefore, the granularity of task a is 2, the granularity of task b is 3, if task b
Dependent on task a, method according to a first embodiment of the present invention, the scheduling time of task b will use the scheduling time of task a,
I.e. 0,10,20,30,40,5010,20***, task a is constant.
<example 3>
In example 3, if task a scheduling time is: 10,208,10***, task b scheduling time is: 10,209,
12***, the granularity of two scheduling times are identical.
If task a depends on task b, method according to a first embodiment of the present invention, in the task a and task b
First scheduling time of the scheduling time scheduler task a of scheduling time later person for the first time, task a are 8:10, and task b's is
9:10, then the scheduling time of a and b is all 10,209,12***.
If task b depends on task a, method according to a first embodiment of the present invention, task a, b scheduling time is constant,
And task b needs to check whether task of a in 8:10 runs succeeded when 9:10 is executed.
<embodiment 2>
The second embodiment of the present invention will be described with reference to the accompanying drawings below, the present embodiment is identical with the first embodiment or similar
Part Hereinafter will not be described in great detail.Fig. 2, which is shown, can be used to implement equipment 200 of the invention, equipment can be network server,
Host computer etc..As shown in Fig. 2, the equipment 200 includes: the first judgment means 201, for judging first task and second
Dependence between business；Second judgment means 202, for being relied on when in the determining first task of first judgment means 201
When the second task, the relationship of the scheduling time granularity of the first task and the second task is judged, when the first task
Judging result is sent to dispatching device 203 when scheduling time granularity is not equal to the scheduling time granularity of second task, with
And when the scheduling time granularity of the first task is equal to the scheduling time granularity of second task, judge described first
The relationship of business and the scheduling time for the first time of the second task, and judging result is sent to dispatching device 203；
Dispatching device 203 is not equal to the scheduling of second task for the scheduling time granularity when the first task
With the scheduling time scheduling described first of the thicker person of scheduling time granularity in the first task and the second task when time granularity
Task, and for when the scheduling time granularity of the first task be equal to second task scheduling time granularity when, with
The scheduling time of scheduling time later person dispatches the first task for the first time in the first task and the second task.
Preferably, the equipment 200 further includes third judgment means 202, for judging before dispatching the first task
Whether second task runs succeeded.
<embodiment 3>
Third embodiment according to the present invention also provides a kind of programmable device, including memory and processor, wherein
For storing instruction, described instruction is operated for controlling the processor to execute method described in Fig. 1 the memory.
It will be appreciated by those skilled in the art that it will be appreciated by those skilled in the art that, it is of the invention disclosing in electronic technology field
On the basis of scheme, can easily it be realized as needed using the combination of software, hardware and/or software and hardware described
Scheme.For example, can realize each unit by instruction configuration processor.For example, instruction can be stored in the ROM, and
And when starting the device, instruction is read in programming device from ROM and realizes each unit.For example, can be by each list
Member is cured in dedicated devices (such as ASIC).Each unit can be divided into mutually independent unit, or can be by them
Merge realization.The unit can realize by one of above-mentioned various implementations, or can be by upper
The combination of two or more modes in various implementations is stated to realize.
In a more specifical example, Fig. 3 is to show the electronic equipment 200 that can be used for realizing the embodiment of the present invention
Configuration example block diagram.
Electronic equipment 200 is such as can be network server, host computer.
As shown in figure 3, electronic equipment 200 may include processor 2010, memory 2020, interface arrangement 2030, communication
Device 2040, display device 2050, input unit 2060, loudspeaker 2070, microphone 2080, etc..
Processor 2010 is such as can be central processor CPU, Micro-processor MCV.Memory 2020 is for example including ROM
(read-only memory), RAM (random access memory), the nonvolatile memory of hard disk etc..Interface arrangement 2030 is for example
Including USB interface, earphone interface etc..
Communication device 2040 can for example be communicated with the programmable device of non-contact power supply, for example, being that can support
The device of near-field communication.Communication, which fills 2040, can also carry out wired or wireless communication.
Display device 2050 is, for example, liquid crystal display.Input unit 2060 is such as may include touch screen, keyboard.With
Family can pass through 2080 inputting/outputting voice information of loudspeaker 2070 and microphone.
Electronic equipment shown in Fig. 3 is only explanatory, and is never intended to the limitation present invention, its application or uses
On the way.
In this embodiment, for storing instruction, described instruction is for controlling the processor for the memory 2020
2010 are operated to execute method shown in FIG. 1.It will be appreciated by those skilled in the art that although being shown in FIG. 3 multiple
Device, still, the present invention can only relate to partial devices therein, for example, processor 2010 and storage device 2020 etc..Technology
Personnel can disclosed conceptual design instruction according to the present invention.Instruction how control processor carry out slot, this be it is known in the art that
Therefore it is not described in detail herein.
<embodiment 4>
It illustrates in the first embodiment and determines task schedule between the first task and the second task with dependence
The method of time, in fourth embodiment according to the present invention, by for how to determine with intersect or complicated dependence it is more
The scheduling time of a task is illustrated.As shown in figure 4, providing a kind of method for determining task execution time, comprising:
Step S401 calculates the execution time for the first time of this task according to the scheduling time of this task and current time；
Step S402, obtains that other tasks that this task directly or indirectly relies on are respective to execute time and this its for the first time
The respective scheduling time granularity of his task；
Step S403 judges the scheduling time granularity and the respective scheduling time granularity of other described tasks of described task
Relationship, and judge the respective relationship for executing the time for the first time for executing time and other tasks for the first time of described task；
Step S404, when executing the execution for the first time of the task of time the latest for the first time in the most thick task of scheduling time granularity
Between execution time as described task.
Preferably, in which: described each the step of executing the time for the first time for obtaining other tasks for being relied on of this task includes
The respective of other tasks, which is calculated, according to other described tasks respective scheduling time and current time executes the time for the first time.
Preferably, the method also includes other tasks for before executing this task, judging that described task is relied on is
No the step of running succeeded respectively.
Preferably, the scheduling time granularity is according to task using year, month, day, hour or minute as task schedule time grain
The unit of account of degree, only using the task schedule number on the unit of account of most coarseness present in the task as the task
Scheduling time granularity.
And, it is preferable that the method also includes: by the tune for executing time and this task for the first time of calculated task
Degree time granularity notifies the step of to other tasks for depending on this task.
<embodiment 5>
The fifth embodiment of the present invention will be described with reference to the accompanying drawings below, the present embodiment is same or similar with fourth embodiment
Part Hereinafter will not be described in great detail.Fig. 5, which is shown, can be used to implement equipment 500 of the invention, equipment can be network server,
Host computer etc..As shown in figure 5, the equipment 500 includes: this mission bit stream acquisition device 501, for the tune according to this task
It spends the time and current time calculates the execution time for the first time of this task；
Dependence task information acquisition device 502, for obtaining other tasks that this task directly or indirectly relies on respectively
The time of execution for the first time and the respective scheduling time granularity of other tasks；
Judgment means 503, for judging the scheduling time granularity and the respective scheduling of other tasks of described task
The relationship of time granularity, and judge that the execution time and the respective of other tasks for the first time of described task execute the time for the first time
Relationship；
Dispatching device 504, for the head to execute the task of time the latest in the most thick task of scheduling time granularity for the first time
The secondary execution time for executing the time as described task.
Preferably, wherein the dependence task information acquisition device 502, is used for according to the respective scheduling of other described tasks
Time and current time calculate the respective of other tasks and execute the time for the first time.
Preferably, the equipment 500 further include for judging before executing this task, described task relied on other
The device whether task runs succeeded respectively.
It is highly preferred that the scheduling time granularity is according to task using year, month, day, hour or minute as the task schedule time
The unit of account of granularity, only using the task schedule number on the unit of account of most coarseness present in the task as the task
Scheduling time granularity.
It is highly preferred that the equipment 500 further includes notice device 505, for by the execution for the first time of calculated task
The scheduling time granularity of time and this task is notified to other tasks for depending on this task.
<embodiment 6>
Similar with 3rd embodiment, sixth embodiment according to the present invention also provides a kind of programmable device, including deposits
Reservoir and processor, wherein the memory for storing instruction, described instruction for control the processor operated with
Execute method described in Fig. 4.It will be appreciated by those skilled in the art that it will be appreciated by those skilled in the art that, it is led in electronic technology
Domain, on the basis of disclosing the solution of the present invention, can easily as needed using software, hardware and/or software and
The scheme is realized in the combination of hardware.For example, can realize each unit by instruction configuration processor.For example, can be with
Instruction is stored in the ROM, and when starting the device, instruction is read in programming device from ROM and realizes each list
Member.For example, each unit can be cured in dedicated devices (such as ASIC).Each unit can be divided into mutually independent
Unit, or they can be merged to realization.The unit can by one of above-mentioned various implementations come
It realizes, or can be realized by the combination of two or more modes in above-mentioned various implementations.
<embodiment 7>
Seventh embodiment according to the present invention a kind of determines task as shown in fig. 6, providing for each task in a network
The method for executing the time includes multiple tasks assembly line in the network, and each task pipeline includes start node task
With other one or more tasks dependent on the start node task, the task in the task pipeline is having the same
Scheduling time and scheduling time granularity, network problem to be solved are, according to current time, to confirm the correct of each task
Execute the time.According to the method for the present embodiment: since the start node task for the assembly line that each has scheduling time, with tune
Spending the execution time that the time generates according to current time is data flow, uniformly flows to its all downstream and relies on nodes.Including such as
Lower step:
S601 determines the dependence of the dependence between the task in each assembly line and the task between assembly line
Relationship；
S602 calculates the execution for the first time of task in assembly line according to the scheduling time of task in each assembly line and current time
Time；
S603, by the scheduling time granularity for executing task in time and assembly line for the first time of task in identified assembly line
It is sent to depending directly or indirectly in assembly line in other assembly lines of each task for task step by step respectively；
S604 is each task, judges the scheduling time granularity of the task and the scheduling time granularity of acquired task
Between relationship and judge the relationship for executing the time for the first time for executing time and acquired task for the first time of the task；
S605 is made with executing the time of execution for the first time of the task of time the latest in the most thick task of scheduling time granularity for the first time
For the execution time of the task.
<example 4>
Specific example according to a seventh embodiment of the present invention is described below, and Fig. 7 shows assembly line
Dependence between pipeline 4,2 and 1 and task therein.
It include three task tasks 1,2 and 3, the scheduling time of assembly line Pipeline 4 in assembly line Pipeline 4
It is 0****.Task task 2,3 depends on task task 1.
It include three task tasks 7,8 and 9, the scheduling time of assembly line Pipeline 2 in assembly line Pipeline 2
It is 12***.Task task 8,9 dependent on task task 7, task task 7 dependent on the Task3 in assembly line Pipeline 4 with
And task task 9 is dependent on the Task6 in assembly line Pipeline 1.
It include three task tasks 4,5 and 6, the scheduling time of assembly line Pipeline 1 in assembly line Pipeline 1
It is 11***.Task task 5,6 is dependent on task task 4, task task 6 dependent on the Task8 in assembly line Pipeline 2.
It is assumed that current time: 2015-09-3002:10:09
The first step produces as shown in figure 8, scheduling time is 0**** using Task1 as network flow starting point according to current time
Raw execution time run_time:201509300200 flows to its all downstream node using Task1 as stream source:
Second step produces as shown in figure 9, scheduling time is 12*** using Task7 as network flow starting point according to current time
Raw execution time run_time:201509300201 flows to its all downstream node using Task7 as stream source:
Third portion, as shown in Figure 10, using Task4 as network flow starting point, scheduling time is 11***, according to current time
It generates execution time run_time:201509300101 and flows to its all downstream node using Task4 as stream source:
By the assembly line in three separate networks, the execution time list that each Task flows through can be obtained:
Task1:201509300200 (granularity 24)
Task2:201509300200 (granularity 24)
Task3:201509300200 (granularity 24)
Task4:201509300200 (granularity 24), 201509300101 (granularities 1), 201509300201 (granularities 1)
Task5:201509300200 (granularity 24), 201509300101 (granularities 1), 201509300201 (granularities 1)
Task6:201509300200 (granularity 24), 201509300101 (granularities 1), 201509300201 (granularities 1)
Task7:201509300200 (granularity 24), 201509300201 (granularities 1)
Task8:201509300200 (granularity 24), 201509300201 (granularities 1)
Task9:201509300200 (granularity 24), 201509300101 (granularities 1), 201509300201 (granularities 1)
The execution time of Task1, Task2, Task3 only one, then without being selected correct to execute the time according to rule.
Coarseness task priority described in Task4, Task5, Task6, Task7, Task8, the Task9 method according to Fig. 6 is higher than
Fine granularity, the identical then first scheduling time bigger priority of granularity is higher, these task choosings execute the time be
201509300201。
<embodiment 8>
The eighth embodiment of the present invention will be described with reference to the accompanying drawings below, the present embodiment and the 7th embodiment are same or similar
Part Hereinafter will not be described in great detail.8th embodiment according to the present invention provides a kind of for each of in a network as shown in figure 11
Task determines the equipment 1100 of task execution time, includes multiple tasks assembly line, each task pipeline in the network
Including start node task and dependent on other one or more tasks of the start node task, in the task pipeline
Task scheduling time having the same and scheduling time granularity, comprising:
For determining that the dependence of the dependence between the task in each assembly line and the task between assembly line is closed
The device 1101 of system；
For calculating the execution for the first time of task in assembly line according to the scheduling time of task in each assembly line and current time
The device 1102 of time；
For by the scheduling time granularity for executing task in time and assembly line for the first time of task in identified assembly line
It is sent to the device 1103 for depending directly or indirectly on the task in assembly line in other assembly lines of each task step by step respectively；
For for each task, judge the task scheduling time granularity and acquired task scheduling time granularity it
Between relationship and judge the task the relationship for executing the time for the first time for executing time and acquired task for the first time device
1104；And
For being made with the time of execution for the first time for executing the task of time the latest in the most thick task of scheduling time granularity for the first time
For the device 1105 of the execution time of the task.
It will be appreciated by those skilled in the art that in electronic technology field, it, can on the basis of disclosing the solution of the present invention
The scheme is easily realized using the combination of software, hardware and/or software and hardware as needed.Moreover, in net
In network environment, although the present embodiment disclosure is the equipment that each task in a network determines task execution time, answer
Work as understanding, the equipment of the present embodiment can not have to show as a specific equipment, can be and be distributed in a network
Different step or different device, software, hardware and/or the software executed by the different nodes in network come coordinated or jointly
With the combination of hardware.
<embodiment 9>
Similarly with 3rd embodiment, the 9th embodiment according to the present invention, also provides a kind of programmable device, including deposit
Reservoir and processor, wherein the memory for storing instruction, described instruction for control the processor operated with
Execute method described in Fig. 6.It will be appreciated by those skilled in the art that it will be appreciated by those skilled in the art that, it is led in electronic technology
Domain, on the basis of disclosing the solution of the present invention, can easily as needed using software, hardware and/or software and
The scheme is realized in the combination of hardware.For example, can realize each unit by instruction configuration processor.For example, can be with
Instruction is stored in the ROM, and when starting the device, instruction is read in programming device from ROM and realizes each list
Member.For example, each unit can be cured in dedicated devices (such as ASIC).Each unit can be divided into mutually independent
Unit, or they can be merged to realization.The unit can by one of above-mentioned various implementations come
It realizes, or can be realized by the combination of two or more modes in above-mentioned various implementations.
The method and apparatus of each embodiment through the invention can solve the kernel scheduling problem of distributed scheduling system,
It allows complicated dependence by scheduling, becomes simple, feasible, efficient and correct.
Device and method of the invention can be embodied by program product.Program product may include readable storage medium storing program for executing,
Containing for making processor realize the readable program instructions of various aspects of the invention.
Readable storage medium storing program for executing can be the tangible device that can keep and store the instruction used by instruction execution equipment.It can
Reading storage medium, which for example can be ,-- but is not limited to-- storage device electric, magnetic storage apparatus, light storage device, electromagnetism storage
Equipment, semiconductor memory apparatus or above-mentioned any appropriate combination.The more specific example of readable storage medium storing program for executing is (non exhaustive
List) include: that portable disc, hard disk, random access memory (RAM), read-only memory (ROM), erasable type are programmable only
Read memory (EPROM or flash memory), static random access memory (SRAM), Portable compressed disk read-only memory (CD-
ROM), digital versatile disc (DVD), memory stick, floppy disk, mechanical coding equipment, the punch card for being for example stored thereon with instruction or
Groove internal projection structure and above-mentioned any appropriate combination.Readable storage medium storing program for executing used herein above is not interpreted wink
When signal itself, the electromagnetic wave of such as radio wave or other Free propagations propagated by waveguide or other transmission mediums
Electromagnetic wave (for example, the light pulse for passing through fiber optic cables) or the electric signal transmitted by electric wire.
Readable program instructions as described herein can download to each electronic equipment from readable storage medium storing program for executing, or pass through
Network, such as internet, local area network, wide area network and/or wireless network download to external electronic device or External memory equipment.Network
It may include copper transmission cable, optical fiber transmission, wireless transmission, router, firewall, interchanger, gateway computer and/or edge
Server.Adapter or network interface in each electronic equipment receive readable program instructions from network, and forwarding should
Readable program instructions, in the readable storage medium storing program for executing that is stored in each calculating/processing equipment.
Program instruction for executing operation of the present invention can be assembly instruction, instruction set architecture (ISA) instructs, machine refers to
It enables, machine-dependent instructions, microcode, firmware instructions, condition setup data or with any group of one or more programming languages
The source code or object code write are compiled in collaboration with, the programming language includes programming language-such as Smalltalk, C+ of object-oriented
+ etc., and conventional procedural programming languages-such as " C " language or similar programming language.Readable program instructions can be complete
Execute on consumer electronic devices, partly executed on consumer electronic devices entirely, being executed as an independent software package,
Part part on consumer electronic devices executes on the remote computer or holds on a remote computer or server completely
Row.In situations involving remote computers, remote computer can include local area network (LAN) by the network-of any kind
Or wide area network (WAN)-is connected to consumer electronic devices, or, it may be connected to outer computer (such as taken using internet
Provider be engaged in connect by internet).In some embodiments, by the status information using readable program instructions come individual character
Change customization electronic circuit, such as programmable logic circuit, field programmable gate array (FPGA) or programmable logic array
(PLA), which can execute computer-readable program instructions, to realize various aspects of the invention.
Referring herein to according to the method for the embodiment of the present invention, the flowchart and or block diagram of equipment describe it is of the invention each
A aspect.It should be appreciated that the combination of each box in each box and flowchart and or block diagram of flowchart and or block diagram, all
It can be realized by readable program instructions.
These readable program instructions can be supplied to the processor of electronic equipment, so that a kind of machine is produced, so that this
A little instructions produce the one or more side in implementation flow chart and/or block diagram when executing by the processor of electronic equipment
The device of function action specified in frame.These readable program instructions can also be stored in readable storage medium storing program for executing, these refer to
It enables so that electronic equipment works in a specific way, thus, the readable medium for being stored with instruction then includes a manufacture comprising
The instruction of the various aspects of function action specified in one or more boxes in implementation flow chart and/or block diagram.
Readable program instructions can also be loaded on electronic equipment, so that executing sequence of operations step on an electronic device
Suddenly, to generate the process that instruction is realized, so that in the instruction implementation flow chart and/or block diagram that execute on an electronic device
Function action specified in one or more boxes.
The flow chart and block diagram in the drawings show the possibility of the device and method of multiple embodiments according to the present invention realities
Existing architecture, function and operation.In this regard, each box in flowchart or block diagram can represent module, a journey
Sequence section or a part of instruction, the module, program segment or a part of instruction include one or more for realizing defined
The executable instruction of logic function.In some implementations as replacements, function marked in the box can also be to be different from
The sequence marked in attached drawing occurs.For example, two continuous boxes can actually be basically executed in parallel, they are sometimes
It can execute in the opposite order, this depends on the function involved.It is also noted that every in block diagram and or flow chart
The combination of box in a box and block diagram and or flow chart can use the dedicated base for executing defined function or movement
It realizes, or can be realized with the combination of specialized hardware and instruction in the system of hardware.Those skilled in the art are come
It says and is well known that, realized hardware mode, realized by way of software mode realization and by software and hardware combination
It is all of equal value.
Various embodiments of the present invention are described above, above description is exemplary, and non-exclusive, and
It is not limited to disclosed each embodiment.Without departing from the scope and spirit of illustrated each embodiment, for this skill
Many modifications and changes are obvious for the those of ordinary skill in art field.The selection of term used herein, purport
In the principle, practical application or improvement to the technology in market for best explaining each embodiment, or make the art
Other those of ordinary skill can understand each embodiment disclosed herein.The scope of the present invention is defined by the appended claims.
Claims (23)
1. a kind of method for determining the task schedule time, comprising:
Judge the dependence between first task and the second task；
When determining that first task depends on the second task in the step of in the judgement dependence:
Judge the relationship of the scheduling time granularity of the first task and the second task；And
When the scheduling time granularity of the first task is not equal to the scheduling time granularity of second task, with described first
The scheduling time of the thicker person of scheduling time granularity dispatches the first task in task and the second task；
When the scheduling time granularity of the first task is equal to the scheduling time granularity of second task:
Judge the relationship of the scheduling time for the first time of the first task and the second task；And
With the scheduling time of scheduling time later person dispatches the first task for the first time in the first task and the second task.
2. according to the method described in claim 1, further include:
Before dispatching the first task, the step of whether second task runs succeeded judged.
3. according to the method described in claim 1, wherein:
The scheduling time granularity is according to task using year, month, day, hour or minute as the calculating list of task schedule time granularity
Position, only using the task schedule number on the unit of account of most coarseness present in the first and second tasks as the tune of the task
Spend time granularity.
4. a kind of method for determining task execution time, comprising:
The execution time for the first time of this task is calculated according to the scheduling time of this task and current time；
It is respective to obtain other tasks respective execution time and other tasks for the first time that this task directly or indirectly relies on
Scheduling time granularity；
Judge the scheduling time granularity of described task and the relationship of the respective scheduling time granularity of other described tasks, and sentences
Described task of breaking executes time and the respective relationship for executing the time for the first time of other tasks for the first time, with scheduling time granularity
Execute the task of time the latest in most thick task for the first time executes execution time of the time as described task for the first time.
5. according to the method described in claim 4, wherein:
Described each the step of executing the time for the first time for obtaining other tasks that this task is relied on includes according to other described tasks
Respective scheduling time and current time calculate the respective of other tasks and execute the time for the first time.
6. according to the method described in claim 4, further include:
Before executing this task, the step of whether other tasks for judging that described task is relied on run succeeded respectively.
7. according to the method described in claim 4, wherein:
The scheduling time granularity is according to task using year, month, day, hour or minute as the calculating list of task schedule time granularity
Position, only using the task schedule number on the unit of account of most coarseness present in the task as the scheduling time of task grain
Degree.
8. according to the method described in claim 4, further include:
The scheduling time granularity for executing time and this task for the first time of calculated task is notified to dependent on this task
The step of other tasks.
9. a kind of method for determining task execution time for each task in a network includes multiple tasks in the network
Assembly line, each task pipeline include start node task and dependent on the start node task it is one or more other
Task, task scheduling time having the same and scheduling time granularity in the task pipeline, comprising:
For determining the dependence of the dependence between the task in each assembly line and the task between assembly line
Step；
For calculating the execution time for the first time of task in assembly line according to the scheduling time of task in each assembly line and current time
The step of；
For the scheduling time granularity for executing task in time and assembly line for the first time of task in identified assembly line to be distinguished
It is sent to the step of depending directly or indirectly on the task in assembly line in other assembly lines of each task step by step；
For judging between the scheduling time granularity of the task and the scheduling time granularity of acquired task for each task
Relationship and the step of judge the relationship for executing the time for the first time for executing time and acquired task for the first time of the task；With
And
For executing time of execution for the first time of the task of time the latest for the first time using in the most thick task of scheduling time granularity as institute
The step of stating the execution time of the task.
10. according to the method described in claim 9, wherein:
The scheduling time granularity is according to task using year, month, day, hour or minute as the calculating list of task schedule time granularity
Position, only using the task schedule number on the unit of account of most coarseness present in the task as the scheduling time of task grain
Degree.
11. a kind of equipment for determining the task schedule time, comprising:
First judgment means, for judging the dependence between first task and the second task；
Second judgment means, for judging institute when first judgment means determine first task dependent on the second task
The relationship for stating the scheduling time granularity of first task and the second task, when the scheduling time granularity of the first task is not equal to institute
Judging result is sent to dispatching device when stating the scheduling time granularity of the second task, and when the scheduling of the first task
Between granularity when being equal to the scheduling time granularity of second task, when judging the scheduling for the first time of the first task and the second task
Between relationship, and judging result is sent to dispatching device；
Dispatching device is not equal to the scheduling time granularity of second task for the scheduling time granularity when the first task
When the first task dispatched with the scheduling time of the thicker person of scheduling time granularity in the first task and the second task, and
When for being equal to the scheduling time granularity of second task when the scheduling time granularity of the first task, with described first
The scheduling time of scheduling time later person dispatches the first task for the first time in business and the second task.
12. equipment according to claim 11, further includes:
Third judgment means, for judging whether second task runs succeeded before dispatching the first task.
13. equipment according to claim 11, in which:
The scheduling time granularity is according to task using year, month, day, hour or minute as the calculating list of task schedule time granularity
Position, only using the task schedule number on the unit of account of most coarseness present in the task as the scheduling time of task grain
Degree.
14. a kind of programmable device, including memory and processor, wherein the memory for storing instruction, described instruction
It is operated for controlling the processor to execute the method according to claim 11.
15. a kind of equipment for determining task execution time, comprising:
This mission bit stream acquisition device calculates the execution for the first time of this task for the scheduling time and current time according to this task
Time；
Dependence task information acquisition device, for obtaining, other tasks that this task directly or indirectly relies on are respective to be held for the first time
Row time and the respective scheduling time granularity of other tasks；
Judgment means, for judging the scheduling time granularity and the respective scheduling time granularity of other described tasks of described task
Relationship, and judge the respective relationship for executing the time for the first time for executing time and other tasks for the first time of described task；
Dispatching device, when for executing the execution for the first time of the task of time the latest for the first time in the most thick task of scheduling time granularity
Between execution time as described task.
16. equipment according to claim 15, in which:
The dependence task information acquisition device is also used to according to other tasks respective scheduling time and current time count
It calculates the respective of other tasks and executes the time for the first time.
17. equipment according to claim 15, further includes:
For judging before executing this task, device that whether other tasks that described task is relied on run succeeded respectively.
18. equipment according to claim 15, in which:
The scheduling time granularity is according to task using year, month, day, hour or minute as the calculating list of task schedule time granularity
Position, only using the task schedule number on the unit of account of most coarseness present in the task as the scheduling time of task grain
Degree.
19. equipment according to claim 15, further includes:
Notify device, for by the scheduling time granularity for executing time and this task for the first time of calculated task notify to according to
Other tasks of Lai Yuben task.
20. a kind of programmable device, including memory and processor, wherein the memory for storing instruction, described instruction
It is operated for controlling the processor to execute the method according to claim 11.
21. a kind of equipment for determining task execution time for each task in a network includes multiple in the network
Be engaged in assembly line, each task pipeline include start node task and dependent on the start node task it is one or more its
His task, task scheduling time having the same and scheduling time granularity in the task pipeline, comprising:
For determining the dependence of the dependence between the task in each assembly line and the task between assembly line
Device；
For calculating the execution time for the first time of task in assembly line according to the scheduling time of task in each assembly line and current time
Device；
For the scheduling time granularity for executing task in time and assembly line for the first time of task in identified assembly line to be distinguished
It is sent to the device for depending directly or indirectly on the task in assembly line in other assembly lines of each task step by step；
For judging between the scheduling time granularity of the task and the scheduling time granularity of acquired task for each task
Relationship and the device for executing time with the relationship for executing the time for the first time of acquired task for the first time for judging the task；With
And
For executing time of execution for the first time of the task of time the latest for the first time using in the most thick task of scheduling time granularity as institute
State the device of the execution time of the task.
22. equipment according to claim 21, in which:
The scheduling time granularity is according to task using year, month, day, hour or minute as the calculating list of task schedule time granularity
Position, only using the task schedule number on the unit of account of most coarseness present in the task as the scheduling time of task grain
Degree.
23. a kind of programmable device, including memory and processor, wherein the memory for storing instruction, described instruction
It is operated for controlling the processor to execute the method according to claim 11.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510876021.4A CN106814993B (en) | 2015-12-01 | 2015-12-01 | It determines the method for task schedule time, determine the method and apparatus of task execution time |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510876021.4A CN106814993B (en) | 2015-12-01 | 2015-12-01 | It determines the method for task schedule time, determine the method and apparatus of task execution time |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN106814993A CN106814993A (en) | 2017-06-09 |
| CN106814993B true CN106814993B (en) | 2019-04-12 |
Family
ID=59106495
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510876021.4A Active CN106814993B (en) | 2015-12-01 | 2015-12-01 | It determines the method for task schedule time, determine the method and apparatus of task execution time |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN106814993B (en) |
Families Citing this family (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109992307B (en) * | 2017-12-29 | 2020-05-05 | 上海寒武纪信息科技有限公司 | Instruction list scheduling method and device, computer equipment and storage medium |
| CN109471708B (en) * | 2018-10-12 | 2023-10-31 | 北京奇虎科技有限公司 | Task processing method, device and system |
| CN110109740B (en) * | 2019-05-08 | 2021-08-10 | 宜人恒业科技发展（北京）有限公司 | Crontab command execution method and device |
| CN111190725A (en) * | 2019-08-09 | 2020-05-22 | 腾讯科技（深圳）有限公司 | Task processing method and device, storage medium and server |
| CN112396274A (en) * | 2019-08-16 | 2021-02-23 | 阿里巴巴集团控股有限公司 | Task scheduling method |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104714838A (en) * | 2013-12-12 | 2015-06-17 | 中国移动通信集团四川有限公司 | Task scheduling method and device |
| CN104765640A (en) * | 2014-01-02 | 2015-07-08 | 中国科学院声学研究所 | Intelligent service scheduling method |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| EP2751684A4 (en) * | 2011-09-02 | 2015-07-08 | Freescale Semiconductor Inc | Data processing system and method for task scheduling in a data processing system |
-
2015
- 2015-12-01 CN CN201510876021.4A patent/CN106814993B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104714838A (en) * | 2013-12-12 | 2015-06-17 | 中国移动通信集团四川有限公司 | Task scheduling method and device |
| CN104765640A (en) * | 2014-01-02 | 2015-07-08 | 中国科学院声学研究所 | Intelligent service scheduling method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN106814993A (en) | 2017-06-09 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106814993B (en) | It determines the method for task schedule time, determine the method and apparatus of task execution time | |
| Storey et al. | Disrupting developer productivity one bot at a time | |
| US9736199B2 (en) | Dynamic and collaborative workflow authoring with cloud-supported live feedback | |
| CN108711030A (en) | The end-to-end project management platform integrated with artificial intelligence | |
| US20190392369A1 (en) | Cognitive scheduling for cooperative tasks | |
| US11093904B2 (en) | Cognitive scheduling platform | |
| US11321634B2 (en) | Minimizing risk using machine learning techniques | |
| US10616165B2 (en) | Enabling wearables to cognitively alter notifications and improve sleep cycles | |
| US10249167B2 (en) | Intelligent alarm customization | |
| US11405264B2 (en) | Predictive analytics and device tracking to facilitate minimization of alert events | |
| US11171825B2 (en) | Context-based resource allocation with extended user concepts | |
| US20210216972A1 (en) | System and Method for Managing Events | |
| US11782808B2 (en) | Chaos experiment execution for site reliability engineering | |
| US11443112B2 (en) | Outcome of a natural language interaction | |
| US20170161683A1 (en) | Identifying participants and measuring performance for online collaborations | |
| CN110313010A (en) | The structuring of electronic information responds summary | |
| Maciel | Performance, reliability, and availability evaluation of computational systems, volume I: performance and background | |
| US20140172488A1 (en) | Synthesis of a schedule representation from a process model | |
| US20220164233A1 (en) | Activity assignment based on resource and service availability | |
| US20160307166A1 (en) | Person is a resource for a calendar invite | |
| US20170178050A1 (en) | Work schedule creation based on predicted and detected temporal and event based individual risk to maintain cumulative workplace risk below a threshold | |
| WO2017148508A1 (en) | Multi-phase high performance business process management engine | |
| US10534866B2 (en) | Intelligent persona agents for design | |
| US11403552B2 (en) | Collaborative cognition platform for creating and hosting social machines | |
| CN105975356A (en) | Memory error detection method, memory management system and apparatus as well as server |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20200527 Address after: 310051 room 508, floor 5, building 4, No. 699, Wangshang Road, Changhe street, Binjiang District, Hangzhou City, Zhejiang Province Patentee after: Alibaba (China) Co.,Ltd. Address before: 510627 Guangdong city of Guangzhou province Whampoa Tianhe District Road No. 163 Xiping Yun Lu Yun Ping B radio 16 floor tower square Patentee before: GUANGZHOU SHENMA MOBILE INFORMATION TECHNOLOGY Co.,Ltd. |