CN105045659B - Task based access control is overlapping with the fault-tolerant method for scheduling task of virtual machine (vm) migration in a kind of cloud - Google Patents
Task based access control is overlapping with the fault-tolerant method for scheduling task of virtual machine (vm) migration in a kind of cloud Download PDFInfo
- Publication number
- CN105045659B CN105045659B CN201510422623.2A CN201510422623A CN105045659B CN 105045659 B CN105045659 B CN 105045659B CN 201510422623 A CN201510422623 A CN 201510422623A CN 105045659 B CN105045659 B CN 105045659B
- Authority
- CN
- China
- Prior art keywords
- task
- key plate
- father
- physical host
- plate sheet
- 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
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
It is overlapping with the fault-tolerant method for scheduling task of virtual machine (vm) migration the invention discloses task based access control in a kind of cloud, it is characterised in that to 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；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, obtain each virtual machine information on the physical host being each activated；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 is run in each virtual machine on each physical host being activated according to specified arrangement of time, the operation result of each version of each task is returned simultaneously, and message and data are sent to other tasks.
Description
Technical field
The present invention relates to field of cloud calculation, especially, it is overlapping with the appearance of virtual machine (vm) migration to be related to task based access control in a kind of cloud
Wrong method for scheduling task.
Background technology
Due to the unpredictability of computer system error, 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 do 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, even if to ensure providing into multiple versions
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, it is using the copy mode of two versions, i.e., main
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-secondary version
This overlapping (backup-backup overlapping, abbreviation BB are overlapping), i.e., multiple different subeditions can be in same calculating
Carried out on unit overlapping；Key plate sheet-subedition is overlapping (primary-backup overlapping, abbreviation PB are 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 successfully complete, if key plate originally successfully completes, 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；It is on the contrary, main
Dynamic subedition allow task key plate sheet and subedition upon execution between on have it is overlapping, using active subedition executive mode
The probability that task misses the off period can be reduced, but resource utilization can also decrease 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 it is only suitable
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, there has been no 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
It is proposed in a kind of cloud that task based access control is overlapping with the fault-tolerant method for scheduling task of virtual machine (vm) migration, can be used under cloud computing environment
PB models carry out the scheduling of fault-tolerant task, improve the schedulability of resource utilization and fault-tolerant task.
Based on above-mentioned purpose, technical scheme provided by the invention is as follows：
According to an aspect of the invention, there is provided task based access control is overlapping with the fault-tolerant task of virtual machine (vm) migration in a kind of cloud
Dispatching method, 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 dependence task group；
One is specified according to each version that dependence task group information is each task in dependence task group to open earliest
Begin time and a Late Finish；
Multiple physical hosts are activated according to dependence task group information, and marked off on each physical host being activated more
Individual virtual machine, obtain 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, while the operation result of each version of each task is returned, and will disappear
Breath is sent to other tasks with data；
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 the size of each task in dependence task group, between task set of relationship 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
Each task is specified in business group successively, and is appointed one key plate sheet of task creation and a subedition, wherein, it is same
The key plate sheet of task repeats identical work with subedition.
Also, propagation delay time be present 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 between physical host where physical host where father's task and subtask and same task
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 is 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 the earliest start time of each version of each task in dependence task group and when completing the latest
Between and the physical host that is each activated on each virtual machine information, by each of each task in dependence task group
Each virtual machine that version is loaded on the specified period on each physical host being activated includes：
The key plate sheet of same subtask is distributed to the virtual machine of two different physical hosts from subedition；
It is originally the key plate sheet of weak key plate sheet and father's task that if the key plate of his father's task, which is originally strong key plate sheet, the key plate of subtask,
Originally do not run with the key plate of subtask on same physical host, then the subedition of subtask is assigned to the master with father's task
On the different physical host of physical host where version；
If the key plate of father's task is originally weak key plate sheet, the subedition of father's task is assigned to and causes the key plate of father's task
Originally as any physical host in this place of key plate physical host set of all task versions of weak key plate sheet not
On same physical host；
If the key plate of father's task is originally weak key plate sheet, the key plate of subtask be originally strong key plate sheet and the key plate sheet of father's task with
The key plate of subtask is not originally run on same physical host, then is originally assigned to and causes father's task the key plate of subtask
Key plate sheet turns into any physical host in this place of key plate physical host set of all task versions of weak key plate sheet
On different physical hosts；
If the key plate of father's task is originally weak key plate sheet, and the key plate sheet of father's task and the key plate sheet of subtask are in same thing
Run on reason main frame, then the key plate sheet for being assigned to and causing father's task by the subedition of subtask turns into all of weak key plate sheet
It is engaged on the different physical host of any physical host in this place of key plate physical host set of version；
Wherein, strong key plate sheet is the key plate sheet of place physical host surely successful execution when not malfunctioning, and weak key plate is originally
The key plate sheet of strong this condition of key plate is not met.
Also, the subedition of father's task and the key plate of subtask are originally assigned on the same virtual machine of same physical host
Operation, and it is overlapping the subedition of father's task is originally existed in time with the key plate of subtask, and the subedition of subtask is divided
It is fitted on the physical host in the absence of any overlapping task.
Meanwhile 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 of load, while the operation result of each version of each task is returned, and
Message and data are sent to other tasks, including：
If the key plate of father's task is originally successfully completed, sends message to the subedition of father's task and cancel its execution, Xiang Zi
The key plate of task this transmission data allow its execution；
If the key plate of father's task is originally strong key plate sheet, the key plate of subtask be originally strong key plate sheet and the key plate sheet of father's task with
The key plate of subtask is not originally run on same physical host, then the subedition of father's task is not sent to the subedition of subtask
Any message and data；
If the key plate of father's task is originally strong key plate sheet, the key plate of subtask be originally weak key plate sheet and the key plate sheet of father's task with
The key plate of subtask is not originally run on same physical host, then the key plate of father's task is not originally sent to the subedition of subtask
Any message and data；
If the key plate of father's task is originally strong key plate sheet, the key plate of subtask be originally strong key plate sheet and the key plate sheet of father's task with
The key plate sheet of subtask is run on same physical host, then the subedition of father's task not to the key plate of subtask, appoint by this transmission
What is the need breath and data；
If the key plate of father's task is originally strong key plate sheet, the key plate of subtask be originally weak key plate sheet and the key plate sheet of father's task with
The key plate sheet of subtask is run on same physical host, then the subedition of father's task not to the key plate of subtask, appoint by this transmission
What is the need breath and data；
If the key plate of father's task is originally weak key plate sheet, the key plate of subtask be originally strong key plate sheet, the key plate sheet of father's task with
The key plate of subtask is not originally run on same physical host, and when the key plate of subtask is originally assigned to and causes father's task
Key plate sheet turns into any physical host in this place of key plate physical host set of all task versions of weak key plate sheet
When upper, the subedition of father's task sends data to the subedition of subtask allows its execution；
If the key plate of father's task is originally weak key plate sheet, the key plate of subtask be originally strong key plate sheet, the key plate sheet of father's task with
The key plate sheet of subtask is run on same physical host, and when the subedition of subtask is assigned to and causes the master of father's task
Version turns on any physical host in this place of key plate physical host set of all task versions of weak key plate sheet
When, the subedition of father's task allows its execution to the key plate of subtask this transmission data.
Also, when a version of a task returns to operation result to fail, by where the version of the task
On all task immigrations to new physicses main frame on virtual machine, the virtual machine can not be migrated to the key plate sheet or pair for the task that is migrated
On physical host in the physical host set that version can not be distributed by above-mentioned limitation；After virtual machine (vm) migration to new physicses main frame
Virtual machine still can meet the time constraints on old physical main frame, have the thing involved by the task of dependence task in virtual machine
Reason main frame and the propagation delay time migrated where virtual machine between physical host still can meet after virtual machine (vm) migration it is above-mentioned
Require.
From the above it can be seen that technical scheme provided by the invention virtualizes real-time fault tolerance model in cloud by establishing
Instead of traditional PB models, analyze the task distribution for ensureing fault-tolerant lower real-time dependence task and message is propagated and constrained, and adopt
With task is overlapping and virtual machine migration mechanism establishes fault-tolerant method for scheduling task, improve resource utilization under fault-tolerant guarantee with
The schedulability of fault-tolerant task.
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 evident 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 overlapping with the fault-tolerant task scheduling of virtual machine (vm) migration according to task based access control in a kind of cloud of the embodiment of the present invention
Method flow diagram；
Fig. 2 is overlapping with the fault-tolerant task scheduling of virtual machine (vm) migration according to task based access control in a kind of cloud of the embodiment of the present invention
In method, the message or data transfer graph of a relation of strong key plate sheet；
Fig. 3 is overlapping with the fault-tolerant task scheduling of virtual machine (vm) migration according to task based access control in a kind of cloud of the embodiment of the present invention
In method, the message or data transfer graph of a relation of weak key plate sheet；
Fig. 4 is overlapping with the fault-tolerant task scheduling of virtual machine (vm) migration according to task based access control in a kind of cloud of the embodiment of the present invention
In method, strong key plate sheet is in the third situation, subtask this time started of key plate is later than end time of father's task subedition
In the case of message or data transfer graph of a relation；
Fig. 5 is overlapping with the fault-tolerant task scheduling of virtual machine (vm) migration according to task based access control in a kind of cloud of the embodiment of the present invention
In method, strong key plate sheet is in the third situation, subtask this time started of key plate earlier than father's task subedition end time
In the case of message or data transfer graph of a relation；
Fig. 6 is overlapping with the fault-tolerant task scheduling of virtual machine (vm) migration according to task based access control in a kind of cloud of the embodiment of the present invention
In method, father's task is with the key plate sheet of strong key plate sheet, subtask with strong key plate sheet and father's task and subtask in not jljl
Manage the message or data transfer graph of a relation under masters scenario；
Fig. 7 is overlapping with the fault-tolerant task scheduling of virtual machine (vm) migration according to task based access control in a kind of cloud of the embodiment of the present invention
In method, father's task is with the key plate sheet of strong key plate sheet, subtask with weak key plate sheet and father's task and subtask in not jljl
Manage the message or data transfer graph of a relation under masters scenario；
Fig. 8 is overlapping with the fault-tolerant task scheduling of virtual machine (vm) migration according to task based access control in a kind of cloud of the embodiment of the present invention
In method, father's task is with the key plate sheet of strong key plate sheet, subtask with strong key plate sheet and father's task and subtask in phase jljl
Manage the message or data transfer graph of a relation under masters scenario；
Fig. 9 is overlapping with the fault-tolerant task scheduling of virtual machine (vm) migration according to task based access control in a kind of cloud of the embodiment of the present invention
In method, father's task is with the key plate sheet of strong key plate sheet, subtask with weak key plate sheet and father's task and subtask in phase jljl
Manage the message or data transfer graph of a relation under masters scenario；
Figure 10 is that task based access control is overlapping in a kind of cloud according to the embodiment of the present invention to be adjusted with the fault-tolerant task of virtual machine (vm) migration
In degree method, message or data transfer graph of a relation between a subtask and its three father's tasks；
Figure 11 is that task based access control is overlapping in a kind of cloud according to the embodiment of the present invention to be adjusted with the fault-tolerant task of virtual machine (vm) migration
In degree method, father's task is with the key plate sheet of weak key plate sheet, subtask with strong key plate sheet and father's task and subtask in difference
Message or data transfer graph of a relation in the case of physical host；
Figure 12 is that task based access control is overlapping in a kind of cloud according to the embodiment of the present invention to be adjusted with the fault-tolerant task of virtual machine (vm) migration
In degree method, father's task is with the key plate sheet of weak key plate sheet, subtask with weak key plate sheet and father's task and subtask in difference
Message or data transfer graph of a relation in the case of physical host；
Figure 13 is that task based access control is overlapping in a kind of cloud according to the embodiment of the present invention to be adjusted with the fault-tolerant task of virtual machine (vm) migration
In degree method, father's task is with weak key plate sheet, subtask with weak key plate sheet or strong key plate sheet and the master of father's task and subtask
Message or data transfer graph of a relation of the version under same physical masters scenario；
Figure 14 is that task based access control is overlapping in a kind of cloud according to the embodiment of the present invention to be adjusted with the fault-tolerant task of virtual machine (vm) migration
In degree method, PB is overlapping and the key plate sheet of subtask start earlier than the subedition of father's task in the case of message or data transfer close
System's figure；
Figure 15 is that task based access control is overlapping in a kind of cloud according to the embodiment of the present invention to be adjusted with the fault-tolerant task of virtual machine (vm) migration
In degree method, PB is overlapping and the key plate of subtask be originally later than father's task subedition start in the case of message or data transfer close
System's figure；
Figure 16 is that task based access control is overlapping in a kind of cloud according to the embodiment of the present invention to be adjusted with the fault-tolerant task of virtual machine (vm) migration
In degree method, message or data transfer graph of a relation between overlapping set of tasks；
Figure 17 is that task based access control is overlapping in a kind of cloud according to the embodiment of the present invention to be adjusted with the fault-tolerant task of virtual machine (vm) migration
In degree method, message or data transfer graph of a relation in the associated host of virtual machine (vm) migration between task are carried out.
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 part of the embodiment of the present 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.
According to an embodiment of the invention, there is provided task based access control is overlapping in a kind of cloud adjusts with the fault-tolerant task of virtual machine (vm) migration
Degree method.
As shown in figure 1, task based access control is overlapping with virtual machine (vm) migration in a kind of cloud of offer according to embodiments of the present invention
Fault-tolerant method for scheduling task includes：
Step S101, obtain the dependence task group information and the physical host information of virtualization cloud reached；
Step S103, the use of PB models is each task creation key plate sheet and subedition in dependence task group；
Step S105, one is specified according to each version that dependence task group information is 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；
Step S111, run according to specified arrangement of time in each virtual machine on each physical host being activated
Each version of each task in the dependence task group being loaded, while return to the operation knot of each version of each task
Fruit, and message and data are sent to other tasks；
Step S113, 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 the size of each task in dependence task group, between task set of relationship 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
Each task is specified in business group successively, and is appointed one key plate sheet of task creation and a subedition, wherein, it is same
The key plate sheet of task repeats identical work with subedition.
Also, propagation delay time be present 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 between physical host where physical host where father's task and subtask and same task
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 is 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 the earliest start time of each version of each task in dependence task group and when completing the latest
Between and the physical host that is each activated on each virtual machine information, by each of each task in dependence task group
Each virtual machine that version is loaded on the specified period on each physical host being activated includes：
The key plate sheet of same subtask is distributed to the virtual machine of two different physical hosts from subedition；
It is originally the key plate sheet of weak key plate sheet and father's task that if the key plate of his father's task, which is originally strong key plate sheet, the key plate of subtask,
Originally do not run with the key plate of subtask on same physical host, then the subedition of subtask is assigned to the master with father's task
On the different physical host of physical host where version；
If the key plate of father's task is originally weak key plate sheet, the subedition of father's task is assigned to and causes the key plate of father's task
Originally as any physical host in this place of key plate physical host set of all task versions of weak key plate sheet not
On same physical host；
If the key plate of father's task is originally weak key plate sheet, the key plate of subtask be originally strong key plate sheet and the key plate sheet of father's task with
The key plate of subtask is not originally run on same physical host, then is originally assigned to and causes father's task the key plate of subtask
Key plate sheet turns into any physical host in this place of key plate physical host set of all task versions of weak key plate sheet
On different physical hosts；
If the key plate of father's task is originally weak key plate sheet, and the key plate sheet of father's task and the key plate sheet of subtask are in same thing
Run on reason main frame, then the key plate sheet for being assigned to and causing father's task by the subedition of subtask turns into all of weak key plate sheet
It is engaged on the different physical host of any physical host in this place of key plate physical host set of version；
Wherein, strong key plate sheet is the key plate sheet of place physical host surely successful execution when not malfunctioning, and weak key plate is originally
The key plate sheet of strong this condition of key plate is not met.
Also, the subedition of father's task and the key plate of subtask are originally assigned on the same virtual machine of same physical host
Operation, and it is overlapping the subedition of father's task is originally existed in time with the key plate of subtask, and the subedition of subtask is divided
It is fitted on the physical host in the absence of any overlapping task.
Meanwhile 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 of load, while the operation result of each version of each task is returned, and
Message and data are sent to other tasks, including：
If the key plate of father's task is originally successfully completed, sends message to the subedition of father's task and cancel its execution, Xiang Zi
The key plate of task this transmission data allow its execution；
If the key plate of father's task is originally strong key plate sheet, the key plate of subtask be originally strong key plate sheet and the key plate sheet of father's task with
The key plate of subtask is not originally run on same physical host, then the subedition of father's task is not sent to the subedition of subtask
Any message and data；
If the key plate of father's task is originally strong key plate sheet, the key plate of subtask be originally weak key plate sheet and the key plate sheet of father's task with
The key plate of subtask is not originally run on same physical host, then the key plate of father's task is not originally sent to the subedition of subtask
Any message and data；
If the key plate of father's task is originally strong key plate sheet, the key plate of subtask be originally strong key plate sheet and the key plate sheet of father's task with
The key plate sheet of subtask is run on same physical host, then the subedition of father's task not to the key plate of subtask, appoint by this transmission
What is the need breath and data；
If the key plate of father's task is originally strong key plate sheet, the key plate of subtask be originally weak key plate sheet and the key plate sheet of father's task with
The key plate sheet of subtask is run on same physical host, then the subedition of father's task not to the key plate of subtask, appoint by this transmission
What is the need breath and data；
If the key plate of father's task is originally weak key plate sheet, the key plate of subtask be originally strong key plate sheet, the key plate sheet of father's task with
The key plate of subtask is not originally run on same physical host, and when the key plate of subtask is originally assigned to and causes father's task
Key plate sheet turns into any physical host in this place of key plate physical host set of all task versions of weak key plate sheet
When upper, the subedition of father's task sends data to the subedition of subtask allows its execution；
If the key plate of father's task is originally weak key plate sheet, the key plate of subtask be originally strong key plate sheet, the key plate sheet of father's task with
The key plate sheet of subtask is run on same physical host, and when the subedition of subtask is assigned to and causes the master of father's task
Version turns on any physical host in this place of key plate physical host set of all task versions of weak key plate sheet
When, the subedition of father's task allows its execution to the key plate of subtask this transmission data.
Also, when a version of a task returns to operation result to fail, by where the version of the task
On all task immigrations to new physicses main frame on virtual machine, the virtual machine can not be migrated to the key plate sheet or pair for the task that is migrated
On physical host in the physical host set that version can not be distributed by above-mentioned limitation；After virtual machine (vm) migration to new physicses main frame
Virtual machine still can meet the time constraints on old physical main frame, have the thing involved by the task of dependence task in virtual machine
Reason main frame and the propagation delay time migrated where virtual machine between physical host still can meet after virtual machine (vm) migration it is above-mentioned
Require.
The technical characteristic of the present invention is expanded on further below according to specific embodiment.
Because task is reached generally without periodicity, in the present embodiment, it is contemplated that the dependence task that dynamic reaches.
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 perform.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 reach the time and the off period is 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 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∈ T, two versions be present, be expressed as key plate sheetAnd subeditionWithIt is assigned to different main frames
On 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 in cloud, H-HaRepresent 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 is different disposal ability pjk.For main frame hkOn it is virtual
Machine, its disposal ability meetvjkReady time be expressed as rjk。
In one virtualizes 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, make 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 finds suitable job start time, receives as far as possible more
Real-time DAG, improve 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 can be temporary transient or be permanent, but each mistake
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 simultaneously is very
It is small, it is therefore assumed that in any time, an at most 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, an error detection mechanism in system be present, 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, i.e., if key plate sheet
Successfully complete, then the execution of subedition is interrupted, and 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 more host fails.
Hereafter will to using PB models carry out it is fault-tolerant when task distribution and message transmission analyze, provide realize it is fault-tolerant
Institute's Prescribed Properties.
For convenience of analysis, 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, dotted line with the 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 can successful execution,His father's task can be received to transmit
Disappear 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 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 give 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 completing, thenNecessarily can be complete with successful execution
Into.ThereforeIt is strong key plate sheet.
Below we analyze using PB models carry out it is fault-tolerant when, the schedule constraints of key plate sheet and subedition.
Assuming that ti,tj∈ T, ti∈P(tj), tj∈C(ti), it is as follows first by a lemma：
Lemma 1, to any two dependence task tiAnd tj, tiIt is tjFather's task, ifSuccessfully complete, thenSend
Message or data must send to simultaneouslyWith
Prove：Using reduction to absurdity.Assuming thatAfter successfully completing without send message or data toWhen
Malfunction before, due toSuccessful execution is completed,It is cancelled, causesHave no chance to perform.At the same time,It can not succeed
Perform completion,Have to carry out.ButDo not receiveThe message or data of transmission, thereforeIt can not perform.With appearance
Mistake, which ensures, produces contradiction.Therefore,The message or data sent must be sent to simultaneouslyWith
Lemma 1 indicates the constraint from the transmission connection of father's task.The pact not connected from the transmission of father's task
Beam is influenceed by the type of father's task with its distribution on main frame, and this problem is discussed in detail below.
Discuss and work as firstFor the situation of strong this when of key plate.If tjIt is tiSubtask,Can be strong key plate sheet or
The weak key plate sheet of person, in additionOrThese four situations are discussed separately below.
Situation 1,It is strong key plate sheet,Fig. 6 gives an example of situation 1.
As shown in fig. 6, sideIt is redundancy.That is, it is fault-tolerant to realize,And need not be fromReceive message or
Data.According to lemma 1, sideAnd sideIt is desirable.If sideIt is also required to,It should perform.IfPerform, thenOne is scheduled onMalfunction before.According to our fault-tolerant it is assumed that not having the error of other main frames now, then only need
Pass through sideTransmit message or data to, it is ensured thatSuccessfully complete.Therefore, sideIt is redundancy.
Eliminate sideAt the beginning of between can suitably move forward, addThe probability completed within the off period.It can be recalculated as being：
Situation 2,It is weak key plate sheet,Fig. 7 gives an example of situation 2.
As shown in fig. 7, sideWithNot redundancies, otherwise can not be realized fault-tolerant.It should be noted thatMust
Must be withWithThere is side to be connected, rather thanOnly need andThere is side.Fig. 7 is shownOnly receive fromTransmit message or number
According to example (only consider tiAnd tjTwo dependence task).As shown in Figure 7, if Malfunction before,WithAll
It can not perform.Therefore,Must be withBetween exist message or data transfer connection.Therefore,Earliest start time can count
It is：
According to the analysis to situation 1 and situation 2 above, following proposition is obtained.
Proposition 2,ti∈P(tj), tj∈C(ti), ifBe strong key plate sheet and
Then：If 1)It is strong key plate sheet, thenMust be withWithHave while (i.e. whileWith),Must be withThere is side
(i.e. side)；If 2)It is weak key plate sheet, thenMust be withHave while (i.e. while),Must andWithHave
While (i.e. whileWith)。
Proposition 3,ti∈P(tj), tj∈C(ti), ifIt is strong key plate sheet,Be weak key plate sheet andSoIt can not be assigned toIn proposition 3, ifIf the main frame goes out
Mistake, due toIt is that weak key plate originally can not perform,Have to carry out, stillAllocated main frame error, causes tjHave no chance
Perform, thereforeIt can not be assigned to
Situation 3,It is strong key plate sheet,Fig. 8 gives an example of situation 3.
In fig. 8, sideIt is redundancy.According to lemma 1, sideAnd sideMust have.IfThenWithNeed to perform.AndThe condition of execution is Malfunction before, it means thatIt can not perform.Therefore, whenAfter execution, it is only necessary to transmit message or data toTherefore sideIt is redundancy.
Situation 4,It is weak key plate sheet,Fig. 9 gives an example of situation 3.
According to lemma 1, sideAnd sideMust have.In addition,During error, sideIt is desirable.
In situation 3 and situation 4Earliest start time can be calculated according to formula (5).
Based on above-mentioned analysis, we obtain following proposition：
Proposition 4,ti∈P(tj), tj∈C(ti), ifBe strong key plate sheet and
SoMust be withHave while (i.e. while),Must be withWithHave while (i.e. whileWith)。
Then discuss and work asFor the situation of weak this when of key plate.For weak this when of key plate, situation is increasingly complex, for ease of dividing
Analysis, following 3 definition are provided first：
Define 3, cause the set of tasks Δ of weak key plate sheeti{·}：Refer toHis father's task subedition biography can not be received
The message or those father's set of tasks of data come.
Define 4, cause this set of the task key plate of weak key plate sheetRefer to gather ΔiThis structure of task key plate in { }
Into set.
Define 5, cause this place of the task key plate of weak key plate sheet host complexesRefer to gatherIn
The set that this place of task key plate main frame is formed.
Figure 10 gives the example of definition 3,4,5.As shown in Figure 10, tiThere are 3 father's task ta、tbAnd tc.But only taWith
tcMakeAs weak key plate sheet.Therefore, Δi{ } is changed into Δi{ a, c }={ ta,tc}；
Lemma 2, for a weak key plate sheetIts corresponding subeditionSet can not be assigned to
In either host on.
Prove：Using reduction to absurdity.Assuming thatIt has been assigned to setIn main frame hkOn,If hk Malfunction before,Can not receive fromThe message or data sent, because
ThisHave to perform.ButIt has been assigned to hkOn, causeWithIt can not successfully complete.Produced with fault-tolerant ensure
Contradiction.
Based on defined above and lemma, it is contemplated that tiThe assignment constraints of subtask.Assuming that tj∈C(ti),It is probably strong
Key plate sheet or weak key plate sheet,OrTherefore need to carry out in the presence of 4 kinds of different situations
Analysis.
Situation 5,For strong key plate sheet, andFigure 11 gives an example of situation 5.
As shown in figure 11,For weak key plate sheet,For strong key plate sheet, andIf without side
ThenIt can not be assigned toOn.
Theorem 1,ti∈P(tj), tj∈C(ti), ifIt is weak key plate sheet,It is strong key plate sheet,Then：1)It can not be assigned toIn either host on；If 2)It is assigned toIn a certain main frame on, it is necessary to increase side
Prove：Using reduction to absurdity.Assuming thatIt is assigned toIn a certain main frame hkOn,And there is no sideIf hk Malfunction before,It can not perform.According to lemma 2,Can be with successful execution.Due toIt has been assigned to hk,It can not perform, thereforeMust send message (or data) to
But there is no sideProduce contradiction.
Situation 6,For weak key plate sheet, andFigure 12 shows an example of situation 6.
With situation 5 similarly, as shown in Figure 12, whenFor weak key plate sheet,For weak key plate sheet, and
When,It can not be assigned toOn.
Situation 7,For strong key plate sheet, and
Situation 8,For weak key plate sheet, and
Figure 13 shows an example of situation 7 and situation 8.
As shown in Figure 13, whenFor weak key plate sheet, andWhen, no matterIt is strong key plate sheet or weak master
Version,It can not be assigned toOn.
Theorem 2,ti∈P(tj), tj∈C(ti), ifIt is weak key plate sheet,And weak key plate sheet,
AndSoIt can not be assigned toIn either host on.
Prove：Using reduction to absurdity.Assuming thatIt is assigned toIn a certain main frame hkOn,If hk Malfunction before,It can not perform, thereforeIt can not perform.According to lemma
2,Perform andReceiveMessage or data after,Have to carry out.ButIt has been assigned to hkOn,
It can not perform, contradiction is produced with fault-tolerant ensure.ThereforeIt can not be assigned toIn either host on.
Theorem 3,ti∈P(tj), tj∈C(ti), ifIt is weak key plate sheet,It is strong key plate sheet, andSo 1)It can not be assigned toIn either host on；If 2)It is assigned toIn a certain main frame on, it is necessary to increase side
Prove：Using reduction to absurdity.Assuming thatIt is assigned toIn a certain main frame hkOn,And there is no sideIf hk Malfunction before,It can not perform.According to lemma 2,Perform.Have to carry out.Due to no sideHave to perform, still,It has been assigned to hkOn,
It can not perform, contradiction is produced with fault-tolerant ensure.So if do not increase sideIt can not be assigned toIn
Either host on.
Task hereafter by analysis guarantee under the premise of fault-tolerant is overlapping and virtual machine (vm) migration limits.
In systems in practice, do not performed because the task subedition of the overwhelming majority only takes up resource, therefore herein
We use overlapping mechanism to improve cloud resource utilization rate and then improve the schedulability of system.
Different from independent task, in having the fault-tolerant scheduling of dependence task, it is impossible to overlapping (i.e. using subedition-subedition
Foregoing BB is overlapping) mode, overlapping (i.e. foregoing PB the is overlapping) mode of key plate sheet-subedition can only be used.Figure 14 gives with Figure 15
Two overlapping examples of PB are gone out, wherein Figure 14 is illustrated that subedition of the key plate sheet earlier than father's task of the overlapping middle subtasks of PB
The situation of beginning, Figure 15 are illustrated that the key plate of the overlapping middle subtasks of PB is originally later than the situation that the subedition of father's task starts.
Figure 14 respectively illustrates with Figure 15WithTwo kinds of overlapping possible situations.In both cases, even exist
In the case of a certain main frame error, tiAnd tjCan be with successful execution.In fig. 14, whenAfter successfully completing,It will be cancelled,
ThereforeIt can perform；In fig.15, whenAfter successfully completing, Start to be cancelled before performing,WithNo
Temporal conflict is performed, therefore can be realized fault-tolerant.
Define 6, set OHS { }：The set that main frame assigned by overlapping task (key plate sheet or subedition) is formed.
Overlapping task refers to a certain version of the task task overlapping with a certain version of another task.Such as Figure 16 institutes
Show, task tiWith task tjIt is overlapping, task tjWith task tkIt is overlapping.This 3 tasks are overlapping task, then corresponding set OHS
{ } is { h1,h2,h4}。
Proposition 5,IfIt is overlapping with the subedition in OHS { } on a certain main frame, thenIt can not be divided
It is fitted on the either host in OHS { }.
Figure 16 gives an example of proposition 5.As shown in Figure 16,WithIt is overlapping,H can not be assigned to1、h2With
h4On.Assuming thatThe main frame h at place1 Malfunction before,Perform, thereforeIt can not perform, ultimately result inPerform.But
It is due to h1Error,It can not perform.Similar situation is in h1It can also occur during error.
On the other hand, virtual machine (vm) migration is to integrate virtual machine to improve resource utilization ratio and reduce the effective of energy consumption in cloud
Means.It should be noted that virtual machine (vm) migration must be fulfilled for above-mentioned task distribution and message transmission constraint could realize it is fault-tolerant.
Proposition 6, it is assumed that NH { } is the host complexes that task (key plate sheet or subedition) can not distribute, then the task institute
Virtual machine can not move on the either host in NH { }.
Figure 17 gives an example.As shown in figure 17,H can not be assigned to2On, thereforeThe virtual machine v at place41
H can not be migrated to2On.
After virtual machine (vm) migration, message or data transmission period may change, and a task is in an other master
Operation may not meet that the time limit requires on machine, therefore time constraints must are fulfilled for during virtual machine (vm) migration.
Proposition 7, it is assumed thatIt is migrated, WhereinWithFor new transmission time,ForThe new deadline.
The real-time fault tolerance demand of system can be ensured if above-mentioned constraint can ensure, during virtual machine (vm) migration.With it is traditional
Distributed system is compared, can effective lifting system resource utilization using virtual machine migration technology.
In summary, by means of the above-mentioned technical proposal of the present invention, real-time fault tolerance model generation in cloud is virtualized by establishing
For traditional PB models, analyze the task distribution for ensureing fault-tolerant lower real-time dependence task and message is propagated and constrained, and use
Task is overlapping and virtual machine migration mechanism establishes fault-tolerant method for scheduling task, improves resource utilization and appearance under fault-tolerant guarantee
The schedulability of wrong task.
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. task based access control is overlapping with the fault-tolerant method for scheduling task of virtual machine (vm) migration in a kind of cloud, 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；
One is specified according to each version that the dependence task group information is 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, obtain 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 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, while return to the operation knot of each version of each task
Fruit, and message and data are sent to other tasks；
Complete whole tasks of dependence task group and return to task result.
2. task based access control is overlapping with the fault-tolerant method for scheduling task of virtual machine (vm) migration in a kind of cloud according to claim 1,
It is characterized in that：
The dependence task group information includes set of relationship and task deadline between set of tasks, task, the set of tasks note
The size of each task in the dependence task group is carried, set of relationship is described in the dependence task group and appointed between the task
Dependence between two tasks of anticipating, the task deadline are 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 size of the physical host and each virtual machine disposal ability where each virtual machine is carried.
3. task based access control is overlapping with the fault-tolerant method for scheduling task of virtual machine (vm) migration in a kind of cloud according to claim 2,
Characterized in that, it is described using PB models be the dependence task group in each task creation key plate sheet and subedition, be
Each task is specified in the dependence task group successively, and is appointed one key plate sheet of task creation and a subedition,
Wherein, the key plate sheet of the same appointed task repeats identical work with subedition.
4. task based access control is overlapping with the fault-tolerant method for scheduling task of virtual machine (vm) migration in a kind of cloud according to claim 3,
Characterized in that, propagation delay time be present between multiple physical hosts being activated；It is according to the dependence task group information
Each version of each task in the dependence task group specifies an earliest start time and a Late Finish
Including：
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 between physical host where physical host where father's task and subtask and same task
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, its earliest start time is the place of 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. task based access control is overlapping with the fault-tolerant method for scheduling task of virtual machine (vm) migration in a kind of cloud according to claim 3,
Characterized in that, 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, by each in the dependence task group
Each version of business is loaded into each virtual machine on each physical host being activated on the specified period
Include：
The key plate sheet of the same subtask is distributed to the virtual machine of two different physical hosts from subedition；
It is originally the key plate sheet and son of weak key plate sheet and father's task that if the key plate of his father's task, which is originally strong key plate sheet, the key plate of subtask,
The key plate of task is not originally run on same physical host, then the subedition of subtask is assigned into the key plate sheet with father's task
On the different physical host of place physical host；
If the key plate of father's task is originally weak key plate sheet, by the subedition of father's task be assigned to and cause father's task key plate this into
It is different for any physical host in this place of key plate physical host set of all task versions of weak key plate sheet
On physical host；
If the key plate of father's task is originally weak key plate sheet, the key plate of subtask is originally strong key plate sheet and the key plate sheet of father's task is appointed with sub
The key plate of business is not originally run on same physical host, then is originally assigned to and causes the key plate of father's task the key plate of subtask
Originally as any physical host in this place of key plate physical host set of all task versions of weak key plate sheet not
On same physical host；
If the key plate of father's task is originally weak key plate sheet, and the key plate sheet of father's task and the key plate sheet of subtask are in same physics master
Run on machine, be then assigned to and cause the key plate sheet of father's task to turn into all task versions of weak key plate sheet the subedition of subtask
On the different physical host of any physical host in this this place of key plate physical host set；
Wherein, the strong key plate sheet is the key plate sheet of one surely successful execution when place physical host does not malfunction, the weak key plate
This is the key plate sheet for not meeting described this condition of strong key plate.
6. task based access control is overlapping with the fault-tolerant method for scheduling task of virtual machine (vm) migration in a kind of cloud according to claim 5,
Transported characterized in that, the subedition of father's task and the key plate of subtask are originally assigned on the same virtual machine of same physical host
OK, and the subedition of father's task is originally existed in time with the key plate of subtask overlapping, and the subedition of subtask is distributed
Onto the physical host in the absence of any overlapping task.
7. task based access control is overlapping with the fault-tolerant method for scheduling task of virtual machine (vm) migration in a kind of cloud according to claim 5,
Characterized in that, transported in 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 that row is loaded, while return to the fortune of each version of each task
Row result, and message and data are sent to other tasks, including：
If the key plate of father's task is originally successfully completed, sends message to the subedition of father's task and cancel its execution, to subtask
Key plate this transmission data allow its execution；
If the key plate of father's task is originally strong key plate sheet, the key plate of subtask is originally strong key plate sheet and the key plate sheet of father's task is appointed with sub
The key plate of business is not originally run on same physical host, then the subedition of father's task is not sent any to the subedition of subtask
Message and data；
If the key plate of father's task is originally strong key plate sheet, the key plate of subtask is originally weak key plate sheet and the key plate sheet of father's task is appointed with sub
The key plate of business is not originally run on same physical host, then subedition transmission of the key plate of father's task originally not to subtask is any
Message and data；
If the key plate of father's task is originally strong key plate sheet, the key plate of subtask is originally strong key plate sheet and the key plate sheet of father's task is appointed with sub
The key plate sheet of business is run on same physical host, then the subedition of father's task does not disappear to the key plate of subtask this transmission is any
Breath and data；
If the key plate of father's task is originally strong key plate sheet, the key plate of subtask is originally weak key plate sheet and the key plate sheet of father's task is appointed with sub
The key plate sheet of business is run on same physical host, then the subedition of father's task does not disappear to the key plate of subtask this transmission is any
Breath and data；
It is originally that strong key plate sheet, the key plate sheet of father's task and son are appointed that if the key plate of father's task, which is originally weak key plate sheet, the key plate of subtask,
The key plate of business is not originally run on same physical host, and when the key plate of subtask is originally assigned to and causes the key plate of father's task
When this is turned on any physical host in this place of key plate physical host set of all task versions of weak key plate sheet,
The subedition of father's task sends data to the subedition of subtask allows its execution；
It is originally that strong key plate sheet, the key plate sheet of father's task and son are appointed that if the key plate of father's task, which is originally weak key plate sheet, the key plate of subtask,
The key plate sheet of business is run on same physical host, and when the subedition of subtask is assigned to and causes the key plate sheet of father's task
During as on any physical host in this place of key plate physical host set of all task versions of weak key plate sheet, father
The subedition of task allows its execution to the key plate of subtask this transmission data.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510422623.2A CN105045659B (en) | 2015-07-17 | 2015-07-17 | Task based access control is overlapping with the fault-tolerant method for scheduling task of virtual machine (vm) migration in a kind of cloud |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201510422623.2A CN105045659B (en) | 2015-07-17 | 2015-07-17 | Task based access control is overlapping with the fault-tolerant method for scheduling task of virtual machine (vm) migration in a kind of cloud |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN105045659A CN105045659A (en) | 2015-11-11 |
| CN105045659B true CN105045659B (en) | 2018-01-05 |
Family
ID=54452223
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201510422623.2A Active CN105045659B (en) | 2015-07-17 | 2015-07-17 | Task based access control is overlapping with the fault-tolerant method for scheduling task of virtual machine (vm) migration in a kind of cloud |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN105045659B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN107491347B (en) * | 2016-06-12 | 2021-04-27 | 阿里巴巴集团控股有限公司 | Method and equipment for virtual machine live migration |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102591712A (en) * | 2011-12-30 | 2012-07-18 | 大连理工大学 | Decoupling parallel scheduling method for rely tasks in cloud computing |
| CN102819460A (en) * | 2012-08-07 | 2012-12-12 | 清华大学 | Budget power guidance-based high-energy-efficiency GPU (Graphics Processing Unit) cluster system scheduling algorithm |
| CN103077083A (en) * | 2013-01-09 | 2013-05-01 | 苏州亿倍信息技术有限公司 | Method and system for processing tasks |
| CN103973594A (en) * | 2014-05-09 | 2014-08-06 | 清华大学 | Task scheduling method based on multiple resources |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130318535A1 (en) * | 2010-08-11 | 2013-11-28 | Nec Corporation | Primary-backup based fault tolerant method for multiprocessor systems |
-
2015
- 2015-07-17 CN CN201510422623.2A patent/CN105045659B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102591712A (en) * | 2011-12-30 | 2012-07-18 | 大连理工大学 | Decoupling parallel scheduling method for rely tasks in cloud computing |
| CN102819460A (en) * | 2012-08-07 | 2012-12-12 | 清华大学 | Budget power guidance-based high-energy-efficiency GPU (Graphics Processing Unit) cluster system scheduling algorithm |
| CN103077083A (en) * | 2013-01-09 | 2013-05-01 | 苏州亿倍信息技术有限公司 | Method and system for processing tasks |
| CN103973594A (en) * | 2014-05-09 | 2014-08-06 | 清华大学 | Task scheduling method based on multiple resources |
Non-Patent Citations (1)
| Title |
|---|
| 虚拟化云平台中实时任务容错调度算法研究;王吉 等;《通信学报》;20141031;第35卷(第10期);第171-180页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN105045659A (en) | 2015-11-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US10764125B2 (en) | Method and device for training model in distributed system | |
| KR102161683B1 (en) | Synchronization with a host processor | |
| JP6797880B2 (en) | Synchronization in multi-tile, multi-chip processing configurations | |
| Hasan et al. | Fault tolerance in cloud computing environment: A systematic survey | |
| Marahatta et al. | Energy-aware fault-tolerant dynamic task scheduling scheme for virtualized cloud data centers | |
| CN103780655B (en) | A kind of message passing interface task and resource scheduling system and method | |
| Chakravorty et al. | Proactive fault tolerance in MPI applications via task migration | |
| US20160246653A1 (en) | Parallel hardware hypervisor for virtualizing application-specific supercomputers | |
| CN104951367B (en) | Fault-tolerant method for scheduling task in one kind virtualization cloud | |
| CN105005506B (en) | Fault-tolerant resource provision method in one kind virtualization cloud | |
| Zhang et al. | A comparison of distributed machine learning platforms | |
| Tang et al. | An effective reliability-driven technique of allocating tasks on heterogeneous cluster systems | |
| US11301299B2 (en) | Data based scheduling for horizontally scalable clusters | |
| Stankovic | Distributed real-time computing: The next generation | |
| Taskeen Zaidi | Modeling for fault tolerance in cloud computing environment | |
| CN105912383A (en) | High-reliability dependent task scheduling and resource configuration method | |
| Kim et al. | R-BATCH: Task partitioning for fault-tolerant multiprocessor real-time systems | |
| US20210390405A1 (en) | Microservice-based training systems in heterogeneous graphic processor unit (gpu) cluster and operating method thereof | |
| Soniya et al. | Dynamic fault tolerant scheduling mechanism for real time tasks in cloud computing | |
| Long et al. | A novel fault-tolerant scheduling approach for collaborative workflows in an edge-IoT environment | |
| CN105094971B (en) | A kind of fault-tolerant method for scheduling task moved in cloud after task based access control | |
| 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 | |
| RU2665246C1 (en) | Hardware computing system of virtualization and resource management in the cloud computing environment | |
| Guo et al. | Real-time fault-tolerant scheduling algorithm with rearrangement in cloud systems | |
| Srinivasan et al. | Optimizing massively parallel simulations of infection spread through air-travel for policy analysis |
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 |