CN105094971B - A kind of fault-tolerant method for scheduling task moved in cloud after task based access control - Google Patents
A kind of fault-tolerant method for scheduling task moved in cloud after task based access control Download PDFInfo
- Publication number
- CN105094971B CN105094971B CN201510422559.8A CN201510422559A CN105094971B CN 105094971 B CN105094971 B CN 105094971B CN 201510422559 A CN201510422559 A CN 201510422559A CN 105094971 B CN105094971 B CN 105094971B
- Authority
- CN
- China
- Prior art keywords
- task
- dependence
- group
- physical host
- virtual machine
- 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
Landscapes
- Hardware Redundancy (AREA)
Abstract
The invention discloses the fault-tolerant method for scheduling task moved after task based access control in a kind of cloud, it is characterised in that obtains the dependence task group information and the physical host information of virtualization cloud reached；The use of PB models is each task creation key plate sheet and subedition in dependence task group；An earliest start time and a Late Finish are specified for each version of each task in dependence task group；Multiple virtual machines are marked off on each physical host being activated, each virtual machine information on the physical host being each activated is obtained；Each version of each task in dependence task group is loaded on the specified period in each virtual machine on each physical host being activated；Each version of each task in the dependence task group being loaded according to specified arrangement of time operation；The earliest start time that the scheduled task of multitask method adjustment is moved after use provides time window for the task in newly arrived dependence task group.
Description
Technical field
The present invention relates to field of cloud calculation, especially, it is related to the fault-tolerant task scheduling side moved in a kind of cloud after task based access control
Method.
Background technology
Due to the unpredictability that computer system malfunctions, the support to fault-tolerance is added when designing dispatching algorithm and is extremely closed
It is important.Fault-Tolerant Scheduling Algorithm can generally be divided into two classes, i.e., static fault-tolerant scheduling and dynamic fault-tolerant scheduling：Static fault-tolerant scheduling
Decision-making is scheduled before task submission, commonly used to property dispatching cycle task；Dynamic fault-tolerant scheduling is non-commonly used to dispatch
Periodic task, its task arrival time does not know.
At present, mainly there are two kinds of main fault-tolerant scheduling means in a distributed computing environment, that is, bring up again friendship and replicate.Weight
Submit and refer to that the task is resubmited after the calculate node that a task is distributed breaks down.Using weight way of submission
The deadline of some tasks will be caused to postpone, in some instances it may even be possible to the off period of task can be unsatisfactory for.Duplication refers to by by one
Individual Task Duplication is afterwards assigned to the version of each duplication different calculate nodes into multiple versions, even if to ensure in money
In the case that source is broken down, task remains to successfully complete before the off period.The version that task is replicated is more, system it is fault-tolerant
Ability is stronger, but this will inevitably result in substantial amounts of resource consumption.Therefore, using the copy mode of two versions, that is, lead
Version turns into the appearance widely used at present with subedition model (primary-backup model, hereinafter referred to as PB models)
Wrong means.
In order to improve system schedulability and resource utilization on the premise of guarantee is fault-tolerant, there are many scholars using PB
It has studied during model and how overhead reduced by overlap technique.Mainly there is two kinds of overlap scheme at present：Subedition-pair version
This overlapping (backup-backup overlapping, abbreviation BB is overlapping), i.e., multiple different subeditions can be calculated same
Carried out on unit overlapping；Key plate sheet-subedition is overlapping (primary-backup overlapping, abbreviation PB is overlapping), i.e., and one
Individual key plate originally can with the subeditions of other tasks on same computing unit it is overlapping.In PB models, subedition can enter one
Step is divided into two types, i.e., passive subedition (passive backup) and active subedition (active backup).It is passive secondary
Version only starts to perform when its corresponding key plate originally can not be successfully completed, if key plate is originally successfully completed, subedition will be removed
Pin.Although the above method can reduce resource occupation, it cannot be guaranteed that all tasks can be completed within the off period；On the contrary, main
Dynamic subedition allow the key plate sheet and subedition of task upon execution between on have overlapping, using active subedition executive mode
The probability that task misses the off period can be reduced, but resource utilization can also be decreased simultaneously.Exist in the prior art
The technical scheme of overlap processing is carried out to real-time task, but these technical schemes do not consider the virtualization of system, therefore only fit
For traditional distributed system, it is not appropriate for virtualizing cloud computing environment.
Recently, also there is the research of dependence task scheduling aspect in some clouds.But these work are not all examined in scheduling
Consider the situation of system fault, it is impossible to solve Fault-Tolerant Problems in cloud.For lacking fault-tolerant task under cloud computing environment in the prior art
The problem of dispatching method, not yet there is effective solution at present.
The content of the invention
The problem of for lacking fault-tolerant method for scheduling task under cloud computing environment in the prior art, it is an object of the invention to
The fault-tolerant method for scheduling task moved in a kind of cloud after task based access control is proposed, can be held under cloud computing environment using PB models
The scheduling of wrong task, improves the schedulability of resource utilization and fault-tolerant task.
Based on above-mentioned purpose, the technical scheme that the present invention is provided is as follows：
According to an aspect of the invention, there is provided the fault-tolerant method for scheduling task moved in a kind of cloud after task based access control, bag
Include：
Obtain the dependence task group information and the physical host information of virtualization cloud reached；
The use of PB models is each task creation key plate sheet and subedition in dependence task group；
One is specified according to dependence task group information for each version of each task in dependence task group to open earliest
Time beginning and a Late Finish；
Multiple physical hosts are activated according to dependence task group information, and marked off on each physical host being activated many
Individual virtual machine, obtains each virtual machine information on the physical host being each activated；
The earliest start time of each version of each task in dependence task group and Late Finish and
Each virtual machine information on the physical host being each activated, each version of each task in dependence task group is being referred to
It is loaded on the fixed period in each virtual machine on each physical host being activated；
It is loaded in each virtual machine on each physical host being activated according to specified arrangement of time operation
Each version of each task in dependence task group；
Newly arrived dependence task group is obtained, and the earliest start time that multitask method adjusts scheduled task is moved after use
Time window is provided for the task in newly arrived dependence task group, and does not influence the performance of scheduled task；
Complete whole tasks of dependence task group and return to task result.
Wherein, dependence task group information includes set of relationship and task deadline between set of tasks, task, set of tasks note
Carried set of relationship between the size of each task in dependence task group, task describe in dependence task group any two task it
Between dependence, task deadline be dependence task group Late Finish；Physical host information includes physical host collection
Close, physical host set describes the size of each physical host disposal ability；Virtual machine information includes the thing being each activated
The virtual machine set on main frame is managed, virtual machine set is described at physical host and each virtual machine where each virtual machine
The size of reason ability.
Also, the use of PB models is each task creation key plate sheet and subedition in dependence task group, is to appoint in dependence
Specify each task in business group successively, and be appointed one key plate sheet of task creation and subedition, wherein, it is same
The key plate sheet of task repeats identical work with subedition.
Also, there is propagation delay time between multiple physical hosts being activated；Appointed according to dependence task group information to rely on
Each version of each task in business group specifies an earliest start time to include with a Late Finish：
For the key plate sheet of any subtask, its earliest start time is the completion of each father's task in its multiple father's task
Time is plus the maximum in the propagation delay time sum between physical host where physical host where father's task and subtask；
For the subedition of any subtask, its earliest start time is the completion of each father's task in its multiple father's task
Time is plus the propagation delay time sum and same task between physical host where physical host where father's task and subtask
Key plate this task length thereof higher value；
For the key plate sheet of any non-subtask, its earliest start time is this place of the key plate of task physical host
Place virtual machine for perform the task key plate sheet and the ready time arrives with the dependence task group information where the task
Up to the higher value in the time；
For the subedition of any non-subtask, its earliest start time physical host where the subedition of the task
Place virtual machine for perform the task subedition and the ready time arrives with the dependence task group information where the task
Up to the higher value in the time；
For any version of any task, its Late Finish is the deadline of the task；
Wherein, a subtask and father's task are a dependence task pair, and subtask depends on father's task, and subtask must be obtained
Obtaining the implementing result of father's task could perform.
Meanwhile, each version of each task in dependence task group is loaded on the specified period and each swashed
In each virtual machine on physical host living, including：
According to set of relationship and task deadline between the task of dependence task group information, estimate each in dependence task group
The off period of task；
The subtask that a non-subtask or all father's tasks be all scheduled is specified in dependence task group；
The key plate sheet of appointed task is dispatched in the designated virtual machine of given host；
The subedition of appointed task is dispatched in the designated virtual machine of given host；
Continue to specify and dispatch next task.
Also, when the key plate sheet and subedition of appointed task are all completed before the off period of the task, it is considered as this
Business successful dispatch；If the task will recalculate the possible time started earliest of its subtask and make not by successful dispatch
The influence that the time is suitably caused with eliminating the task to be delayed in advance；If by the subtask of the task also not by successful dispatch,
Stop calculating all tasks of the dependence task group, reclaim the computing resource of all dependence task groups occupancy and returning to task mistake
Lose information.
Meanwhile, newly arrived dependence task group is obtained, and after use at the beginning of the scheduled task of shifting multitask method adjustment
Between provide time window for the task in newly arrived dependence task group, to calculate all scheduled tasks in dependence task group
The rear shift time redundancy of all versions, and obtain newly arrived dependence task group, by between rear move at the beginning of scheduled task
Time window is provided for the task in newly arrived dependence task group；Wherein, during the rear shifting of the key plate sheet of a scheduled task
Between redundancy be on the virtual machine of this place of the key plate of the scheduled task at the beginning of next task between subtract the completion of the task
Transmission between main frame where main frame where the task is subtracted between at the beginning of time, with the subtask by the task and subtask
Smaller value in the deadline that time delay subtracts the task again；The rear shift time redundancy of the subedition of one scheduled task is should
After subedition move will not on the subtask by the task at the beginning of between with perform state produce influence minimum value, it is modulated with this
Where the subedition of degree task on virtual machine at the beginning of next task between subtract the task deadline in smaller value.
From the above it can be seen that the technical scheme that the present invention is provided is by setting up real-time fault tolerance model in virtualization cloud
Instead of traditional PB models, a kind of fault-tolerant task scheduling side for making full use of idling-resource is established using strategy is moved after task
Method, improves the schedulability of the resource utilization and fault-tolerant task under fault-tolerant guarantee.
Brief description of the drawings
In order to illustrate more clearly about the embodiment of the present invention or technical scheme of the prior art, below will be to institute in embodiment
The accompanying drawing needed to use is briefly described, it should be apparent that, drawings in the following description are only some implementations of the present invention
Example, for those of ordinary skill in the art, on the premise of not paying creative work, can also be obtained according to these accompanying drawings
Obtain other accompanying drawings.
Fig. 1 is according to the fault-tolerant method for scheduling task flow chart moved after task based access control in a kind of cloud of the embodiment of the present invention；
Fig. 2 be according in the fault-tolerant method for scheduling task moved after task based access control in a kind of cloud of the embodiment of the present invention, it is strong main
The message or data transfer graph of a relation of version；
Fig. 3 is the weak master according in the fault-tolerant method for scheduling task moved after task based access control in a kind of cloud of the embodiment of the present invention
The message or data transfer graph of a relation of version；
Fig. 4 be according in the fault-tolerant method for scheduling task moved after task based access control in a kind of cloud of the embodiment of the present invention, it is strong main
Version is in the third situation, subtask this time started of key plate is later than disappearing in the case of the end time of father's task subedition
Breath or data transfer graph of a relation；
Fig. 5 be according in the fault-tolerant method for scheduling task moved after task based access control in a kind of cloud of the embodiment of the present invention, it is strong main
Version is in the third situation, subtask this time started of key plate earlier than father's task subedition end time in the case of disappear
Breath or data transfer graph of a relation.
Embodiment
For the object, technical solutions and advantages of the present invention are more clearly understood, below in conjunction with the embodiment of the present invention
Accompanying drawing, the technical scheme in the embodiment of the present invention is further carried out it is clear, complete, describe in detail, it is clear that it is described
Embodiment is only a part of embodiment of the invention, rather than whole embodiments.Based on the embodiment in the present invention, this area
The every other embodiment that those of ordinary skill is obtained, belongs to the scope of protection of the invention.
There is provided the fault-tolerant method for scheduling task moved after task based access control in a kind of cloud for embodiments in accordance with the present invention.
As shown in figure 1, the fault-tolerant task scheduling moved in a kind of cloud of offer according to embodiments of the present invention after task based access control
Method includes：
Step S101, obtains the dependence task group information and the physical host information of virtualization cloud reached；
Step S103, is each task creation key plate sheet and subedition in dependence task group using PB models；
Step S105, one is specified according to dependence task group information for each version of each task in dependence task group
Individual earliest start time and a Late Finish；
Step S107, multiple physical hosts are activated according to dependence task group information, and in each physical host being activated
On mark off multiple virtual machines, obtain each virtual machine information on the physical host being each activated；
Step S109, the earliest start time of each version of each task in dependence task group with completing the latest
Each virtual machine information on time and the physical host being each activated, by the every of each task in dependence task group
Individual version is loaded on the specified period in each virtual machine on each physical host being activated；
Run in step S111, each virtual machine on each physical host being activated according to specified arrangement of time
Each version of each task in the dependence task group being loaded；
Step S113, obtains newly arrived dependence task group, and the scheduled task of multitask method adjustment is moved after use most
The early time started provides time window for the task in newly arrived dependence task group, and does not influence the completion of scheduled task
Situation；
Step S115, completes whole tasks of dependence task group and returns to task result.
Wherein, dependence task group information includes set of relationship and task deadline between set of tasks, task, set of tasks note
Carried set of relationship between the size of each task in dependence task group, task describe in dependence task group any two task it
Between dependence, task deadline be dependence task group Late Finish；Physical host information includes physical host collection
Close, physical host set describes the size of each physical host disposal ability；Virtual machine information includes the thing being each activated
The virtual machine set on main frame is managed, virtual machine set is described at physical host and each virtual machine where each virtual machine
The size of reason ability.
Also, the use of PB models is each task creation key plate sheet and subedition in dependence task group, is to appoint in dependence
Specify each task in business group successively, and be appointed one key plate sheet of task creation and subedition, wherein, it is same
The key plate sheet of task repeats identical work with subedition.
Also, there is propagation delay time between multiple physical hosts being activated；Appointed according to dependence task group information to rely on
Each version of each task in business group specifies an earliest start time to include with a Late Finish：
For the key plate sheet of any subtask, its earliest start time is the completion of each father's task in its multiple father's task
Time is plus the maximum in the propagation delay time sum between physical host where physical host where father's task and subtask；
For the subedition of any subtask, its earliest start time is the completion of each father's task in its multiple father's task
Time is plus the propagation delay time sum and same task between physical host where physical host where father's task and subtask
Key plate this task length thereof higher value；
For the key plate sheet of any non-subtask, its earliest start time is this place of the key plate of task physical host
Place virtual machine for perform the task key plate sheet and the ready time arrives with the dependence task group information where the task
Up to the higher value in the time；
For the subedition of any non-subtask, its earliest start time physical host where the subedition of the task
Place virtual machine for perform the task subedition and the ready time arrives with the dependence task group information where the task
Up to the higher value in the time；
For any version of any task, its Late Finish is the deadline of the task；
Wherein, a subtask and father's task are a dependence task pair, and subtask depends on father's task, and subtask must be obtained
Obtaining the implementing result of father's task could perform.
Meanwhile, each version of each task in dependence task group is loaded on the specified period and each swashed
In each virtual machine on physical host living, including：
According to set of relationship and task deadline between the task of dependence task group information, estimate each in dependence task group
The off period of task；
The subtask that a non-subtask or all father's tasks be all scheduled is specified in dependence task group；
The key plate sheet of appointed task is dispatched in the designated virtual machine of given host；
The subedition of appointed task is dispatched in the designated virtual machine of given host；
Continue to specify and dispatch next task.
Also, when the key plate sheet and subedition of appointed task are all completed before the off period of the task, it is considered as this
Business successful dispatch；If the task will recalculate the possible time started earliest of its subtask and make not by successful dispatch
The influence that the time is suitably caused with eliminating the task to be delayed in advance；If by the subtask of the task also not by successful dispatch,
Stop calculating all tasks of the dependence task group, reclaim the computing resource of all dependence task groups occupancy and returning to task mistake
Lose information.
Meanwhile, newly arrived dependence task group is obtained, and after use at the beginning of the scheduled task of shifting multitask method adjustment
Between provide time window for the task in newly arrived dependence task group, to calculate all scheduled tasks in dependence task group
The rear shift time redundancy of all versions, and obtain newly arrived dependence task group, by between rear move at the beginning of scheduled task
Time window is provided for the task in newly arrived dependence task group；Wherein, during the rear shifting of the key plate sheet of a scheduled task
Between redundancy be on the virtual machine of this place of the key plate of the scheduled task at the beginning of next task between subtract the completion of the task
Transmission between main frame where main frame where the task is subtracted between at the beginning of time, with the subtask by the task and subtask
Smaller value in the deadline that time delay subtracts the task again；The rear shift time redundancy of the subedition of one scheduled task is should
After subedition move will not on the subtask by the task at the beginning of between with perform state produce influence minimum value, it is modulated with this
Where the subedition of degree task on virtual machine at the beginning of next task between subtract the task deadline in smaller value.
The technical characteristic of the present invention is expanded on further below according to specific embodiment.
Because task is reached generally without periodically, in the present embodiment, it is contemplated that the dependence task that dynamic is reached.
One group of dependence task can be expressed as a directed acyclic graph (Directed Acyclic Graph, hereinafter referred to as DAG).
One DAG can be defined as G={ T, E }, wherein, T={ t1,t2,…,tnReal-time aperiodic task set is represented, E is represented
Set of relationship between task.eij=(ti,tj) represent task tjDependent on task ti, i.e., only tjObtain tiImplementing result or
Message could be performed.Therefore, we claim tiFor tjFather's task, tjFor tiSubtask.To any task ti∈ T, P (ti) and C
(ti) task t is represented respectivelyiFather's set of tasks and subtask combine.Expression task tiThere is no father's task,Expression task tiThere is no subtask.One DAG's reaches that time and off period are expressed as a (G) and d (G).
Task tiA triple t can be described asi=(ai,di,si), wherein, ai、diAnd siTask t is represented respectivelyiReach the time,
Off period and task size.Task tiOff period diIt can be calculated and obtained by the off period d (G) of DAG where it.Task is big
It is small to be weighed with million instruction numbers (million instructions, hereinafter referred to as MI).In PB models, for any
Be engaged in ti, there are two versions, be expressed as key plate sheet in ∈ TAnd subedition WithIt is assigned on different main frames
It is fault-tolerant to realize.WithKey plate sheet is represented respectivelyAt the beginning of between and the deadline.Similarly,WithRespectively
Represent subeditionAt the beginning of between and the deadline.WithRepresent respectivelyWithFather's set of tasks,WithRepresent respectivelyWithSubtask set.
Virtualization cloud can be described as the unlimited set H={ h of a physical host1,h2,…}.Although the host number in cloud
It is unlimited, but the quantity of mobile host computers is limited.SetRepresent mobile host computers set, H-H in cloudaRepresent to close
Close host complexes.To either host hk∈ H, its disposal ability pkWith per second million instruction number (million instructions
Per second, hereinafter referred to as MIPS) weigh.Each main frame hkOn have multiple virtual machines, with setRepresent, each virtual machine vjk∈VkThere are different disposal ability pjk.For main frame hkOn void
Plan machine, its disposal ability is metvjkReady time be expressed as rjk。
In a virtualization cloud, a main frame can have one or more virtual machines to be run thereon, therefore task quilt
It is assigned to each virtual machine rather than is assigned directly to some main frame.We assume that, the disposal ability of virtual machine has isomerism, i.e.,
Virtual machine can have different disposal abilities.Execution time of the key plate sheet and subedition of one task on these virtual machines can
Matrix E is used respectivelyPAnd EBRepresent, wherein elementWithRepresent respectivelyWithIn virtual machine vjkOn the execution time.I
UseWithTask key plate sheet is represented respectivelyAnd subeditionWith virtual machine vjkBetween mapping relations：IfQuilt
It is assigned to virtual machine vjkOn thenOtherwiseSimilarly, ifIt is assigned to virtual machine vjkOn thenOtherwise WithRepresent respectivelyWithAssigned virtual machine,With
Then representWithAssigned main frame.Therefore,Mean Mean
RepresentWithBetween side, wherein X, Y ∈ { P, B }, i.e.,Can beCan also beEqually,Both can beCan also beTo each sideFromArriveData or message transmission time be expressed asIfWithWith dependence and same main frame is assigned to, thenIn addition, making dvijExpression task ti
To task tjData or message transmission quantity,Represent main frameArriveTransmission speed, it is known thatWhereinTask tjKey plate sheet and subedition earliest start time
It can be calculated as respectively：
Late FinishDetermined, therefore had by the off period of task：
The actual time startedIt isStart the time performed after scheduled.Can be placed on byWithIn the free time groove of restriction.Our regulation goal is to find suitable job start time, receives more as far as possible
Real-time DAG, improves the handling capacity of system.
It is important to note that the mistake described in technical scheme is to be malfunctioned for main frame, main frame error is led
Cause the interrupt operation of other levels such as virtual machine and application.Mistake both can be it is temporary transient can also be permanent, but each is wrong
By mistake separate, the error of a main frame does not interfere with other main frames.Simultaneously as the probability that two main frames malfunction is very simultaneously
It is small, it is therefore assumed that in any time, at most one main frame error.After one main frame error, the task of key plate originally on the host
It can be successfully completed before the error of another main frame by its subedition.Also, there is an error detection mechanism in system, can be with
Error message is provided, new task will not be scheduled on the main frame that has malfunctioned.System also uses reclaim mechanism, if i.e. key plate sheet
Successfully complete, then the execution of subedition is interrupted, shared resource is recovered.
Situation about being failed simultaneously for multiple main frames, the failure model can be extended by following two steps.It is first
First, main frame in cloud is divided into some groups；Afterwards, above-mentioned error model is used in each group.Can be by being used in each group
Proposed fault tolerant mechanism, to solve the situation of many host fails.
The fault-tolerant task scheduling algorithm using PB model realizations is given below with moving strategy after task.
For convenience of analyzing, we define strong key plate sheet and weak key plate sheet first.
Define 1, strong key plate sheet：To any one task key plate sheetIf the main frame where itDo not malfunction,
It can necessarily perform, then claimFor strong key plate sheet.
Fig. 2 gives an example of strong key plate sheet.As shown in Fig. 2 tiIt is tjFather's task, i.e. tjT must be receivedi
The message or data transmitted could start to perform, the dotted line with arrow represent messaging relationship from key plate sheet to subedition and
Direction.As shown in Figure 2, as long asThe main frame h at place3Do not malfunction,With regard to energy successful execution,His father's task biography can be received
That comes disappears or data.Therefore,It is one strong key plate sheet.
Define 2, weak key plate sheet：To any one task key plate sheetIf the main frame where itDo not malfunction,
Also it can not necessarily perform, then claimFor weak key plate sheet.
Fig. 3 gives an example of weak key plate sheet.As shown in Figure 3, it is assumed thatThe main frame h at place1 Before completion
Error, thenIt will perform.But it is due toIt can not receiveThe message or data transmitted, althoughThe main frame at place is not
Error,It can not still perform.Therefore,It is a weak key plate sheet.
According to defining 1 with defining 2, we have following proposition：
Proposition 1,If having any one establishment in following three kinds of situations,It is strong key plate sheet：
(1)
(2)
(3)
Otherwise,It is weak key plate sheet.
The first situation can be released directly according to definition 1.Second of situation can be released according to Fig. 2.For the third feelings
Condition, Fig. 4 and Fig. 5 gives two examples, and wherein key plate is originally assigned to same main frame, and subedition is assigned to different masters
Machine.Wherein, Fig. 4 is the situation for the end time for subtask this time started of key plate being later than father's task subedition, and Fig. 5 is subtask
Situation of this time started of key plate earlier than the end time of father's task subedition.
From Fig. 4 and Fig. 5, we it can be found that no matterWhether can receiveMessage or data,It can receive
ArriveMessage or data.According to defining 1, if main frame h1 Do not malfunctioned before completion, thenNecessarily can be complete with successful execution
Into.ThereforeIt is strong key plate sheet.
The present embodiment proposes dependence task dynamic fault-tolerant scheduling in real time and resource elastic supply plan in a kind of virtualization cloud
Slightly, it is referred to as FASARD.In FASARD, when one group of dependence task is reached, all tasks in the group can be all replicated to
Two versions, i.e. key plate sheet and subedition.FASARD is according to First Come First Served (First Come First Service) rule
Each group dependence task is then dispatched successively, when dispatching a task, the key plate sheet of the task is dispatched first, its secondary version is then dispatched
This.Do not necessarily mean that whole group task can not be completed before the off period more than the off period in view of a task, when appearance one
When individual task exceedes the off period, FASARD, which attempts its subtask of scheduling, allows it to complete earlier.In order to reduce algorithm complexity, if
Its subtask can not also be successfully completed before the off period, then system refuses the dependence task group.Once dependence task group is refused
Absolutely, all allocated resources will be all retracted in the task groups.
Specifically, FASARD method for scheduling task is shown in algorithm 1 in the form of false code.In algorithm 1, when one
When individual dependence task group reaches system, FASARD estimates the off period of each task according to the off period of task groups (DAG) first.
When a task does not have father's task, or father's task when being all scheduled, first dispatches the key plate sheet of the task, the rear secondary version of scheduling
This.Only when the key plate sheet and subedition of task all are scheduled for completing before the off period, the task can just be considered as
Successful dispatch.If a task is not by successful dispatch, then system will recalculate may starting earliest for its subtask
Time and the influence for making the time suitably be caused in advance to eliminate the task to be delayed.If however, its subtask again time out,
Refuse the dependence task group, and reclaim all allocated resources.
In order to improve the schedulability and resource utilization of system, FASARD, which can also be used, moves strategy after task, according to one
The key plate sheet of task and subedition are inserted into suitable time slot by fixed regulation goal.Strategy is moved after task to appoint one
Business should be inserted into the free time groove between scheduled task, can make full use of idling-resource, and perform task as early as possible.
Define 7, rear shift time redundancy：One scheduled task is not influenceing the execution time of follow-up work and is performing shape
In the case of state (execution state refers to the power of key plate sheet), the maximum duration that can be moved rearwards by.
For key plate sheetThereafter shift time redundancyIt can be calculated as follows and obtain：
Wherein, sxRepresent on same virtual machineBetween at the beginning of latter task.Section 1 ensures on the right of equation (6)
TaskAll subtasks can start to perform on time, and Section 2 avoids the influence to follow-up work on same virtual machine.
For subeditionThereafter shift time redundancyIt can be calculated as follows and obtain：
Wherein, in equation (7)Item ensure that subedition rear shifting will not to the Starting Executing Time of subtask with
Execution state produces influence.The first situation in equation (7)ShowWithout result inAs weak key plate
This, therefore,It can not be more thanOtherwise it can causeAs weak key plate sheet.Second of situationShowCauseAs weak key plate sheet, thereforeCan beComplete afterwards,It ensure thatIt can be received before starting to performResult data.
After the rear shift time redundancy of each scheduled task is obtained, scheduling system can by it is rear move scheduled task come
Feasible time insertion groove is provided for the new task that reaches, and influence is not produced on other tasks, so as to effectively improve resource
Utilization rate and schedulability.
In summary, by means of the above-mentioned technical proposal of the present invention, by setting up real-time fault tolerance model generation in virtualization cloud
For traditional PB models, strategy is moved after realizing fault-tolerant task scheduling algorithm and task, can make full use of scheduled task it
Between free time groove, improve the schedulability of the resource utilization and fault-tolerant task under fault-tolerant guarantee.
Those of ordinary skills in the art should understand that：The specific embodiment of the present invention is the foregoing is only, and
The limitation present invention is not used in, within the spirit and principles of the invention, any modification, equivalent substitution and improvements done etc.,
It should be included within protection scope of the present invention.
Claims (7)
1. the fault-tolerant method for scheduling task moved in a kind of cloud after task based access control, it is characterised in that including：
Obtain the dependence task group information and the physical host information of virtualization cloud reached；
The use of PB models is each task creation key plate sheet and subedition in the dependence task group；
According to the dependence task group information one is specified for each version of each task in the dependence task group most
Early time started and a Late Finish；
Multiple physical hosts are activated according to the dependence task group information, and on each physical host being activated
Multiple virtual machines are marked off, each virtual machine information on the physical host being each activated is obtained；
The earliest start time of each version of each task in dependence task group is with Late Finish and each
Each virtual machine information on the physical host being activated, by each of each task in the dependence task group
Version is loaded on the specified period in each virtual machine on each physical host being activated；
Added in each virtual machine on each physical host being activated according to specified arrangement of time operation
Each version of each task in the dependence task group carried；
Newly arrived dependence task group is obtained, and it is new that the earliest start time of the scheduled task of multitask method adjustment is moved after use
Task in the dependence task group of arrival provides time window, and does not influence the performance of scheduled task；
Complete whole tasks of dependence task group and return to task result.
2. the fault-tolerant method for scheduling task moved in a kind of cloud according to claim 1 after task based access control, it is characterised in that：
The dependence task group information includes set of relationship and task deadline between set of tasks, task, the set of tasks note
Set of relationship between the size of each task in the dependence task group, the task is carried and has described in the dependence task group and appointed
Dependence between two tasks of anticipating, the task deadline is the Late Finish of the dependence task group；
The physical host information includes physical host set, and the physical host set is described at each physical host
The size of reason ability；
The virtual machine information includes the virtual machine set on the physical host that is each activated, the virtual machine set note
The physical host where each virtual machine and the size of each virtual machine disposal ability are carried.
3. the fault-tolerant method for scheduling task moved in a kind of cloud according to claim 2 after task based access control, it is characterised in that institute
It is each task creation key plate sheet and subedition in the dependence task group to state using PB models, is in the dependence task group
In specify each task successively, and be appointed one key plate sheet of task creation and subedition, wherein, same task
Key plate sheet and subedition repeat identical work.
4. the fault-tolerant method for scheduling task moved in a kind of cloud according to claim 3 after task based access control, it is characterised in that many
There is propagation delay time between the individual physical host being activated；It is the dependence task group according to the dependence task group information
In each task each version specify an earliest start time include with a Late Finish：
For the key plate sheet of any subtask, its earliest start time is the deadline of each father's task in its multiple father's task
Plus the maximum in the propagation delay time sum between physical host where physical host where father's task and subtask；
For the subedition of any subtask, its earliest start time is the deadline of each father's task in its multiple father's task
Plus the propagation delay time sum and same task between physical host where physical host where father's task and subtask
Key plate this task length thereof higher value；
For the key plate sheet of any non-subtask, its earliest start time is the place of this place of the key plate of task physical host
Virtual machine for perform the key plate sheet of the task and the dependence task group information where ready time and the task reach when
Between in higher value；
For the subedition of any non-subtask, the place of its earliest start time physical host where the subedition of the task
Virtual machine for perform the subedition of the task and the dependence task group information where ready time and the task reach when
Between in higher value；
For any version of any task, its Late Finish is the deadline of the task；
Wherein, a subtask and father's task are a dependence task pair, and the subtask depends on father's task, and the son is appointed
Must must obtain the implementing result of father's task could perform.
5. the fault-tolerant method for scheduling task moved in a kind of cloud according to claim 3 after task based access control, it is characterised in that will
Each version of each task in the dependence task group is loaded into each thing being activated on the specified period
Manage in each virtual machine on main frame, including：
According to set of relationship and task deadline between the task of the dependence task group information, estimate in the dependence task group
The off period of each task；
The subtask that a non-subtask or all father's tasks be all scheduled is specified in the dependence task group；
The key plate sheet of the appointed task is dispatched to the designated virtual machine of given host；
The subedition of the appointed task is dispatched to the designated virtual machine of given host；
Continue to specify and dispatch next task.
6. the fault-tolerant method for scheduling task moved in a kind of cloud according to claim 5 after task based access control, it is characterised in that when
When the key plate sheet and subedition of the appointed task are all completed before the off period of the task, it is considered as the task and successfully adjusts
Degree；If the task will recalculate the possible time started earliest of its subtask and the time is suitably carried not by successful dispatch
The preceding influence caused with eliminating the task to be delayed；If by the subtask of the task also not by successful dispatch, stopping calculating should be according to
Rely all tasks of task groups, reclaim the computing resource of all dependence task groups occupancy and return to mission failure information.
7. the fault-tolerant method for scheduling task moved in a kind of cloud according to claim 5 after task based access control, it is characterised in that obtain
Take newly arrived dependence task group, and moved after use multitask method adjust at the beginning of scheduled task between be newly arrived dependence
Task in task groups provides time window, to calculate in the dependence task group after all versions of all scheduled tasks
Shift time redundancy, and obtain newly arrived dependence task group, by be between rear move at the beginning of scheduled task it is newly arrived according to
The task in task groups is relied to provide time window；Wherein, the rear shift time redundancy of the key plate sheet of a scheduled task for this
On the virtual machine of this place of the key plate of scheduler task at the beginning of next task between subtract deadline of the task, with by this
Propagation delay time between main frame where main frame where the task is subtracted between at the beginning of the subtask of business and subtask subtracts this again
Smaller value in the deadline of task；The rear shift time redundancy of the subedition of one scheduled task be the subedition after move not
The minimum value of influence, the secondary version with the scheduled task are produced between at the beginning of on the subtask by the task with performing state
On the virtual machine of this place at the beginning of next task between subtract the task deadline in smaller value.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510422559.8A CN105094971B (en) | 2015-07-17 | 2015-07-17 | A kind of fault-tolerant method for scheduling task moved in cloud after task based access control |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510422559.8A CN105094971B (en) | 2015-07-17 | 2015-07-17 | A kind of fault-tolerant method for scheduling task moved in cloud after task based access control |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105094971A CN105094971A (en) | 2015-11-25 |
| CN105094971B true CN105094971B (en) | 2017-09-19 |
Family
ID=54575479
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510422559.8A Active CN105094971B (en) | 2015-07-17 | 2015-07-17 | A kind of fault-tolerant method for scheduling task moved in cloud after task based access control |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105094971B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105912383A (en) * | 2016-05-05 | 2016-08-31 | 中国人民解放军国防科学技术大学 | High-reliability dependent task scheduling and resource configuration method |
| CN112835696B (en) * | 2021-02-08 | 2023-12-05 | 兴业数字金融服务（上海）股份有限公司 | Multi-tenant task scheduling method, system and medium |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102867107A (en) * | 2012-08-16 | 2013-01-09 | 中国人民解放军国防科学技术大学 | Multi-imaging satellite emergency task dynamic scheduling method |
-
2015
- 2015-07-17 CN CN201510422559.8A patent/CN105094971B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102867107A (en) * | 2012-08-16 | 2013-01-09 | 中国人民解放军国防科学技术大学 | Multi-imaging satellite emergency task dynamic scheduling method |
Non-Patent Citations (3)
| Title |
|---|
| Real-Time Fault-Tolerant Scheduling Based on Primary-Backup Approach in Virtualized Clouds;WANG,Ji等;《2013 IEEE International Conference on High Performance Computing and Communications & 2013 IEEE International Conference on Embedded and Ubiquitous Computing》;20131130;1127-1134 * |
| 异构分布式实时系统中对具有前后依赖关系任务的基于动态可变调度距离容错调度算法;刘栋等;《计算机与网络》;20140228(第3期);109-113 * |
| 虚拟化云平台中实时任务容错调度算法研究;王吉等;《通信学报》;20141031;第35卷(第10期);171-180 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105094971A (en) | 2015-11-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN106293919B (en) | A kind of the built-in tasks dispatching device and method of time trigger | |
| EP2156307B1 (en) | Distributed, fault-tolerant and highly available computing system | |
| CN105005506B (en) | Fault-tolerant resource provision method in one kind virtualization cloud | |
| CN104951367B (en) | Fault-tolerant method for scheduling task in one kind virtualization cloud | |
| Abd Latiff | A checkpointed league championship algorithm-based cloud scheduling scheme with secure fault tolerance responsiveness | |
| WO2017128961A1 (en) | Method and device for training model in distributed system | |
| CN105718244B (en) | A kind of streamlined data are shuffled Spark task schedulings and the execution method of transmission | |
| CN103780655A (en) | Message transmission interface task and resource scheduling system and method | |
| CN110187956B (en) | Layered real-time task scheduling method and system for multi-agent platform | |
| CN106201701A (en) | A kind of workflow schedule algorithm of band task duplication | |
| CN105912383A (en) | High-reliability dependent task scheduling and resource configuration method | |
| CN105094971B (en) | A kind of fault-tolerant method for scheduling task moved in cloud after task based access control | |
| McLean et al. | Mapping and scheduling automotive applications on ADAS platforms using metaheuristics | |
| Kim et al. | R-BATCH: Task partitioning for fault-tolerant multiprocessor real-time systems | |
| CN105045659B (en) | Task based access control is overlapping with the fault-tolerant method for scheduling task of virtual machine (vm) migration in a kind of cloud | |
| Wilmarth et al. | Pose: Getting over grainsize in parallel discrete event simulation | |
| Kadeed et al. | Safe online reconfiguration of mixed-criticality real-time systems | |
| CN110276152A (en) | A kind of band non-critical time management method of time remaining of parallel discrete time emulation | |
| Cich et al. | Addressing the challenges of conservative event synchronization for the SARL agent-programming language | |
| Zhang et al. | Cost-efficient and latency-aware workflow scheduling policy for container-based systems | |
| Wang et al. | Multiple DAGs dynamic workflow scheduling based on the primary backup algorithm in cloud computing system | |
| Niewiadomska-Szynkiewicz et al. | Algorithms for distributed simulation-comparative study | |
| CN109062673B (en) | Dynamic fault-tolerant flexible scheduling method | |
| Aldarmi et al. | Dynamic cpu scheduling with imprecise knowledge of computation-time | |
| Bellemans et al. | Addressing the Challenges of Conservative Event Synchronization for the SARL Agent-Programming Language |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |