CN101237469B - Method for optimizing multi-QoS grid workflow based on ant group algorithm - Google Patents

Method for optimizing multi-QoS grid workflow based on ant group algorithm Download PDF

Info

Publication number
CN101237469B
CN101237469B CN2008100264875A CN200810026487A CN101237469B CN 101237469 B CN101237469 B CN 101237469B CN 2008100264875 A CN2008100264875 A CN 2008100264875A CN 200810026487 A CN200810026487 A CN 200810026487A CN 101237469 B CN101237469 B CN 101237469B
Authority
CN
China
Prior art keywords
ant
service processes
heuristic
time
qos
Prior art date
Application number
CN2008100264875A
Other languages
Chinese (zh)
Other versions
CN101237469A (en
Inventor
张军
陈伟能
黄韬
Original Assignee
中山大学
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by 中山大学 filed Critical 中山大学
Priority to CN2008100264875A priority Critical patent/CN101237469B/en
Publication of CN101237469A publication Critical patent/CN101237469A/en
Application granted granted Critical
Publication of CN101237469B publication Critical patent/CN101237469B/en

Links

Abstract

The invention discloses a method for optimizing a plurality of QoS grid workflows by adopting an ACO, wherein, three kinds of QoS parameters are considered. The method can not only satisfy the QoS constraint given by a user but also optimize one QoS parameter given by the user. The method comprises the following steps that: firstly, ants are initialized, each ant can select a structural direction in random and establishes a task sequence in accordance with the preference constraint; next, each ant selects a kind of heuristic information on the basis of the pheromone by adopting the selection method of roulette and updates local pheromone. After the heuristic information is selected, the ants map tasks in a task list to the service process in sequence on the basis of the pheromone and the heuristic information. When all the ants complete the construction of solutions, each scheduling solution is evaluated and all the pheromone is updated.

Description

The utilization ant group algorithm is optimized the method for multi-QoS grid workflow

Technical field:

The present invention relates to grid computing and intelligent algorithm two big fields, relate generally to a kind of method of using ant group algorithm to optimize multiple QoS QoS grid work flow.

Technical background:

Grid computing can be supported parallel on a large scale and Distributed Calculation, is considered to potential computing platform of future generation.(electrical power grid) is similar with electrical network, and computing grid makes the sharing of the various various computing resources be distributed in diverse geographic location, selection and Collaboration become possibility.Grid can satisfy science and coml computation requirement, and provides understanding to have decided to calculate the feasible method of intensive problem.

The computing application of handling in grid is commonly referred to workflow.In the environment of grid, workflow defining is: a specific task sequence of finishing complex target.In grid computing, how traffic control stream is an important problems to reach higher performance.Usually, workflow provides with the form of directed acyclic graph (DAG), and wherein node is represented individual task and oriented arrow is represented the dominance relation between task.Task dispatch need handle to Task Distribution different Distributed Calculation websites, to satisfy requirement and the computation optimization performance of user to service quality (QoS).Generally speaking, the scheduling problem in DAG be Np-completely, so workflow schedule is a very complicated problems.

The existing research major part of the workflow schedule problem in the grid concentrated on only have the qos parameter problem of (total duration).Wherein, the most frequently used method is based on the dynamic or static list scheduling algorithm of different heuristic informations, OLB algorithm for example, MET algorithm, MCT algorithm, Min-min algorithm, Max-min algorithm, Duplex algorithm, Sufferage algorithm and HEFT algorithm etc.These basic idea are to come scheduler task successively according to heuristic information.In addition, also has some Asias heuristic (meta-heuristic) algorithm, genetic algorithm (GA) for example, simulated annealing (SA) and genetic mimic anneal (GSA) etc.Generally speaking, inferior heuritic approach has more performance, but needs longer computing time.

Recently, the proposition of Open Grid Service architecture (OGSA) makes grid computing technology obtain reinforcement.OGSA is incorporated into the network service in the grid model, and becomes prevailing technology rapidly.Under new structural system, the traditional scheduler algorithm that more than provides is no longer suitable.This be because: the first, the main trend of OGSA is the various mesh services work station (GSPs) that computational resource is provided to occur.Therefore, task executions no longer is subject to the quantity of computational resource.Under new system, can finish by a series of service processes that the different operating station provides.So scheduler program just need connect each task and its corresponding service processes.The second, total duration no longer is unique qos parameter that the user is concerned about.Accordingly, other qos parameter, expense for example, reliability and fail safe etc., it is more and more important to seem in grid performance.Therefore, scheduler program need be considered the balance between the different QoS parameter, with demand that satisfies the user and the performance of optimizing whole application program.

In order to solve this more difficult scheduling problem, Yuan etc. have proposed a dynamic lattice point dispatching algorithm with consideration expense and the balance between the time [1].But this algorithm can only carry out the optimization of duration and ignore the selection of user to other parameter.Yu etc. have proposed the workflow schedule algorithm [2] of a kind of Deadline-MDP of being called.In this algorithm, the task in the workflow is divided into different branches, and each branch is endowed a sub-time limit.Use Markov decision process (MDP) to seek the scheduling that each branch has least cost and satisfies time-constrain then, but this algorithm still can only be used to solve the Cost Optimization problem of band time limit constraint.

Along with the continuous development of grid computing, the scale of workflow problem becomes bigger and bigger.And user's also can be workflow application according to the demand of self set a series of QoS constraint.Therefore, a good scheduler program should have the ability to find out optimum scheduling scheme, satisfies the qos parameter of user-defined constraints and optimization user's request.In order to solve this complicated scheduling problem, this paper has proposed a kind of method of using ant group algorithm to optimize the multi-QoS grid workflow.Ant group algorithm is a kind of inferior heuritic approach that is proposed by Dorigo.It is worked by the foraging behavior that imitates true ant, and has successfully applied in the optimization of various complex combination problems.The main advantage that ant group algorithm is used for the workflow schedule problem is that it can make full use of heuristic information based on process.

List of references:

[1]Y.Yuan,X.Li,and?Q.Wang:Time-cost?trade-off?dynamic?scheduling?algorithmfor?workflows?in?grids.Proceedings?of?the?10 th?International?Conference?on?ComputerSupported?Cooperative?Work?in?Design,2006.

[2]J.Yu,R.Buyya,and?C.K.Tham:Cost-based?scheduling?of?scientific?workflowapplications?on?utility?grids.Proceedings?of?the?1 st?International?Conference?one-Science?and?Grid?Computing(e-Science’05),pp.140-147,2005.

Summary of the invention:

The present invention mainly concentrates on the large-scale multiple QoS QoS workflow schedule problem that solves.Three basic qos parameters of main consideration in the model of setting up: reliability, time and expense.These parameters are crucial in grid application, and their characteristic also has nothing in common with each other.The user can specify the requirement to QoS when submitting workflow application: the lower bound of reliability, working life and expense budget etc.In addition, the user also may need to optimize one of them qos parameter.Therefore, the target of the method for proposition is to find out a feasible dispatching method, satisfies user-defined all qos parameters, and one of them is optimized.In order to finish this task, designed the search behavior that seven kinds of heuristic informations based on process are used to guide ant.In the algorithm of invention, use adaptive method to handle these heuristic informations, in construction solution, allow ant usually select heuristic information according to information.The concrete steps of algorithm comprise:

(1) initiation parameter.For different QoS demands, the initial value τ of pheromones 0Provide according to following formula

Wherein, min_Reliability represents the least reliability of all service processes, and max_Reliability=100.Min_Makespan is the minimum duration of estimating of workflow, and max_Makespan is the maximum duration of estimating.These two estimated values can be by calculating each duty mapping to having in the minimum service processes of (perhaps maximum) time of implementation.Same, min_Cost and max_Cost are least cost and the costs on the higher scale that workflow is estimated.They can be by calculating each duty mapping in the service processes that has minimum (perhaps maximum) execution cost.

(2) all ants of initialization.In when beginning circulation each time, every ant all can be selected a structural grain (forward direction or back to) at random.The forward direction ant can be according to given dominance relation construction solution in work flow network.Opposite, the back will begin search from end node to ant, and all arrows is reverse.Make algorithm can search for how different separating since the scheduling strategy of two kinds of directions.In addition, every ant all will be set up a task sequence that meets precedence constraint.And task is mapped in the service processes successively based on this task sequence.Task sequence is to set up by the task of selecting at random to satisfy precedence constraint.

(3) every ant is at first selected a kind of heuristic information based on the system of selection of pheromones utilization roulette.After ant has been selected a kind of heuristic information, heuristic information A for example, the pheromones on this heuristic information will be carried out local renewal

τ A=(1-ρ)·τ A+ρ·τ 0

Wherein, ρ ∈ (0,1) is a parameter.

(4) selected a kind of heuristic information after, ant just can begin to construct separating of scheduling problem.In each step of construction solution, ant can be selected a service processes based on pheromones and heuristic information, and with first unmapped duty mapping in the task queue in this service processes.Selection is with task T iBe mapped to j item service processes Method be

In this system of selection, generate a random number q ∈ [0,1], and with itself and a parameter q 0∈ [0,1] relatively.If q≤q 0, ant will be with T so iBe mapped to and contain maximum In the service processes of value.Otherwise,, just select the system of selection of utilization roulette Possibility with Size is directly proportional.τ wherein IjAnd η IjRepresent T respectively iBe mapped to process Pheromones and heuristic information, β 〉=1st, the parameter of decision pheromones relative influence with heuristic information.When ant with a task T iBe mapped to a service processes After, carry out the renewal of local pheromones at once.The plain method for updating of local message is given by the following formula

τ ij=(1-ρ)·τ ij+ρ·τ 0

In circulation each time, every ant recycles this selection mode N time, separates thereby N duty mapping formed a complete scheduling in N the service processes.

(5) after all ants are all finished the structure of separating, each scheduling separated estimate.

(6) renewal of execution global information element.The globally optimal solution that only has high evaluation value just can carry out the renewal of global information element.Suppose that globally optimal solution is K (K 1..., K n), overall update strategy is given as follows

τ i K i = ( 1 - ρ ) · τ iK i + ρ · K . score , i=1,2,...,n

Wherein K.score is the evaluation of estimate of optimal solution K;

(7), otherwise get back to step (2) if reach termination condition then termination routine.

The method of invention has the following advantages: 1, considered three kinds of qos parameters, except the constraint of satisfying QoS, algorithm can also be optimized one of them qos parameter.2, make full use of the characteristics of ant group algorithm, designed the search that seven kinds of heuristic informations are used to guide ant, made the search efficiency to have obtained effective raising.

Description of drawings

Fig. 1 workflow application process schematic diagram

The process schematic diagram of a global solution of Fig. 2 ant structure

Fig. 3 algorithm overall flow figure

Embodiment:

Below in conjunction with accompanying drawing, further the method to invention is described.

Problem at science or a lot of computation-intensives of coml can be classified as the workflow problem.The process that workflow is used as shown in Figure 1.The user at first can provide the abstract language that workflow is used in the abstractdesription aspect.Grid system just needs to select and application component is set to form abstract workflow, the order that the formulation task is carried out in abstract workflow then.In OSGA, the task in the workflow is to be carried out by the network service processes that work station provides.The different processes that provided by the different operating station can be used to carry out same task, and have different qos parameters.So, the task of the 3rd aspect be exactly with the duty mapping in the abstract workflow in service processes, to generate concrete workflow.For example in Fig. 1, each the task T in abstract workflow iAll corresponding a series of service processes At rectangle S iIn with circle expression.m iBe task T iThe sum of pairing service processes.The service processes of representing with gray circles is the process of last this task of execution of selecting, has so just constituted concrete workflow.At last, at application, different work stations may be carried out same program with different structures.In this model, abstract workflow is mapped as the step that concrete workflow is a most critical in the grid application.Target of the present invention is exactly to propose an effective algorithm to generate concrete workflow for large-scale workflow application problem.

Intuitively, the effect of workflow schedule algorithm be with all duty mapping in the abstract workflow to service processes, generating optimum concrete workflow, and satisfy the performance of user-defined QoS constraint and maximization user's request.At the DAG of abstract workflow, (V A) in the model, makes that n is the quantity of task in the workflow to G=.The set V={T of node 1, T 2..., T nTask in the corresponding workflow.The set A of arrow is represented the order of priority relation between the task.Article one, arrow is with (T i, T j) expression, wherein T iBe called T jFather's task, and T jBe called T iThe subtask.Under normal circumstances, a subtask can only could begin to carry out after its all father's tasks are all finished.T iThe set of father's task with Pred (T i) expression, and T iThe set of subtask then use Succ (T i) expression.

Each task T i(1≤i≤n) has an execution scope Wherein (1≤j≤m i) service processes providing by work station of expression, m iExpression T iThe quantity of available service processes.The attribute of a service processes can be represented with one group of four variable Wherein, Expression Affiliated work station is With Representative respectively Reliability, time of implementation and expense.

Precedence constraint has been included in the DAG model, and it has specified a task execution order that feasible solution must satisfy.

In addition, in Work flow model, also there are some user-defined QoS constraints.Since considered three kinds of qos parameters in this article, therefore to there being three types QoS to retrain:

(1) reliability constraint:

The reliability of the concrete workflow that generates can not be less than a user-defined variables L imitedReliability.In other words, a given scheduling scheme K (K 1..., K n) (K iExpression T iBy Carry out), if K.reliability is the reliability of this scheduling, the condition that scheduling K satisfies reliability constraint is

K . reliability = min 1 ≤ i ≤ n s i K i . r ≥ LimitedReliability

(2) total duration constraint:

Total time of implementation of workflow can not be greater than a user-defined variables D eadline.In other words, if K.makespan is total time of implementation of K, K should satisfy so

K.makespan≤Deadline

(3) expense restriction:

For given scheduling scheme K (K 1..., K n), the total cost of K (K.cost) can not be greater than a user-defined variable Budget.Just

K . cos t = Σ i = 1 n s i K i . c ≤ Budget

Except constraints, the user also can define the qos parameter that needs optimization.

(1) reliability optimization:

The user tends to the reliability of optimization application.In this case, the user tends to be provided with the constraint of duration and expense, and the target of dispatching algorithm then is to seek a scheduling scheme K who satisfies all constraintss, and the value of maximization K.reliability.

(2) duration is optimized:

The user tends to the duration of optimization application.In this case, the user tends to be provided with the constraint of reliability and expense, and the target of dispatching algorithm then is to seek a scheduling scheme K who satisfies all constraintss, and minimizes the value of K.makespan.

(3) Cost Optimization:

The user tends to the expense of optimization application.In this case, the user tends to be provided with the constraint of reliability and duration, and the target of dispatching algorithm then is to seek a scheduling scheme K who satisfies all constraintss, and minimizes the value of K.cost.

Below describe the ant group algorithm that is used to solve this scheduling problem in detail:

1. the definition of pheromones and heuristic information

For ant group algorithm, pheromones and heuristic information are most important factors.Because scheduling problem is therefore to establish task T with all duty mapping in the abstract workflow in service processes iBe mapped to process Pheromones be τ Ij, heuristic information is η Ij

When algorithm began, establishing all pheromones was an initial value τ 0, just

τ ij=τ 0(1≤i≤n,1≤j≤m i)

In addition, owing in the model of considering, have a plurality of qos parameters, so designed seven kinds of heuristic informations in the algorithm.

(1) heuristic information A: reliability greediness (RG)

The RG heuristic information makes artificial ant be more prone to select to have the more process of high reliability.That suppose the ant use is RG heuristic information, T so iBe mapped to Heuristic information (use RG IjExpression) is

η ij = RG ij = s i j . r - min _ reliabilit y i + 1 max _ reliabilit y i - min _ reliabilit y i + 1

Wherein, According to formula, one has more that the process of high reliability will have higher heuristic information.Simultaneously, this formula has also guaranteed η Ij∈ (0,1].

(2) heuristic information B: time greediness (TG)

The TG heuristic information makes artificial ant be more prone to select shorter process of time of implementation.That suppose the ant use is TG heuristic information, T so iBe mapped to Heuristic information (use TG IjExpression) is

η ij = RG ij = max _ tim e i - s i j . t + 1 max _ tim e i - min _ time i + 1

Wherein, According to formula, a shorter process of time of implementation will have higher heuristic information, and η Ij∈ (0,1].

(3) heuristic information C: expense greediness (CG)

The CG heuristic information makes artificial ant be more prone to select required expense process still less.What suppose the ant use is the CG heuristic information, and Ti is mapped to so Heuristic information (use CG IjExpression) is

η ij = CG ij = max _ cos t i - s i t . t + 1 max _ cos t i - min _ cos t i + 1

Wherein, According to formula, required expense process still less will have higher heuristic information, and η Ij∈ (0,1].

(4) heuristic information D: the time limit of suggestion (SD)

Between qos parameter, always exist and accept or reject balance.For example, short process of time of implementation may need higher expense and reliability lower.Consider the such balance and the constraint in time limit, the SD heuristic information makes artificial ant be more prone to select the service processes of just on time finishing.In order to reach this target,, give the time limit of a suggestion to each task in abstract workflow based on the user-defined time limit.

In order to calculate the SD heuristic information of each task, at first need to calculate the earliest start time of each task and back to earliest start time.

Task T iEarliest start time (EST i): with each task T iBe mapped in the shortest service processes of time of implementation EST iEqual task T under this mapping iTime started.In addition, the workflow under this mapping method is carried out minimum total duration that total duration can be counted as estimating, and represents with min_Makespan.

Task T iBack to earliest start time (BEST i): by with the start node among the DAG as end node, with end node node to start with, and with the direction counter-rotating of all arrows, just DAG can be converted to one after to network.For each task T i, the EST in the back in network iValue is exactly BEST i

Based on above two times, just can calculation task T iThe on average the shortest time of implementation

avg _ min _ time i = ( min ∀ T j ∈ succ ( T i ) { EST j } - EST i ) + ( min ∀ T j ∈ pred ( T i ) BES T j - BEST i ) 2

According to avg_min_time iCalculate SD iMethod be

That suppose the ant use is SD heuristic information, T so iBe mapped to Heuristic information be

η ij = max { | max _ time i - SD i | , | SD i - min _ time i | } - ( s i j . t - SD i ) + 1 max { | max _ time i - SD i | , | SD i - min _ time i | } + 1

According to formula, a time of implementation is more near SD iProcess will have higher heuristic information, and η Ij∈ (0,1].

(5) heuristic information E: the budget of suggestion (SB)

Similar to the SD heuristic information, the SB heuristic information makes ant be more prone to select just to reach the service processes of estimated cost.In order to reach this target,, give the budget of a suggestion to each task in abstract workflow based on user-defined master budget.

By with all duty mapping in the service processes of minimum charge, obtain the least cost min_Cost of whole workflow.Just, Task T iSuggestion budget SB iFollowing calculating

SB i = min _ cos t i · BUsget min _ Cost

What suppose the ant use is the SB heuristic information, so with T iBe mapped to Heuristic information be

η ij = max { | max _ cos t i - SB i | , | SB i - min _ cos t i | } - ( s i j . c - SB i + 1 ) max { | max _ cos t i - SB i | , | SB i - min _ cos t i | } + 1

According to formula, expense is more near SB iService processes will have higher heuristic information, and η Ij∈ (0,1].

(6) heuristic information F: time/expense (TC)

The TC heuristic information is taken all factors into consideration the time and the cost element of a service processes.It combines TG and two kinds of heuristic informations of CG.What suppose the ant use is the TC heuristic information, so task T iBe mapped to Heuristic information be

η ij = 1 2 · ( TG ij + CG ij )

According to formula, the service processes with shorter time of implementation and lower expense will have higher heuristic information, and η Ij∈ (0,1].

(7) heuristic information G: overall performance (OP)

In the OP heuristic information, taken all factors into consideration the effect (comprising reliability, time and expense) of all qos parameters.It combines TG, CG and RG heuristic information.What suppose the ant use is the OP heuristic information, so task T iBe mapped to Heuristic information be

η ij = 1 3 · ( TG ij + CG ij + RG ij )

According to formula, have the shorter time of implementation, lower expense and more the service processes of high reliability will have higher heuristic information, and η Ij∈ (0,1].

Based on different user's requests, algorithm will use different heuristic informations.1) if target is to optimize reliability, algorithm will use seven kinds of all heuristic informations so.Wherein, RG and OP heuristic information are used to seek the service processes of high reliability, and other heuristic information then is used for guarantee fee with satisfying the QoS constraint with the duration.2) if target is to optimize the duration, so just only use heuristic information TG, CG, SB and TC.TG and TC heuristic information are used to seek the service processes of the shortest time of implementation, and CG and SB then are used to search for the service processes that satisfies expense restriction.In this case, the constraints of reliability can reach by the service processes of not selecting to be lower than reliability constraint, does not therefore need RG and OP heuristic information.Because the target of algorithm is to minimize the duration, so also do not need the SD heuristic information.3) if target is the optimization expense, based on similar reason, required heuristic information is TG, CG, SD and TC.

Use adaptive method in algorithm, to manage this seven kinds of heuristic informations.Before artificial ant begins construction solution at every turn, at first can select the used heuristic information of this structure based on pheromones.Wherein, the pheromones τ of corresponding heuristic information A AExpression, the pheromones τ of corresponding heuristic information B BExpression, by that analogy.When algorithm began, the pheromones on all heuristic informations that need will be set to initial value τ 0, the pheromones of other no heuristic information then is made as 0.

2. the structure of separating

In each circulation of algorithm, the ant that all can to use one group of number be M comes construction problem to separate.The constructor of separating can be divided into following two steps.

(1) initialization of ant

In when beginning circulation each time, every ant all can be selected a structural grain (forward direction or back to) at random.The forward direction ant can be according to given dominance relation construction solution in work flow network.Opposite, the back will begin search from the end node of DAG to ant, and all arrows is reverse, as calculating the back to the earliest start time.Make algorithm can search for how different separating since the scheduling strategy of two kinds of directions.

In addition, every ant all will be set up a task sequence that meets precedence constraint.And task is mapped in the service processes successively based on this task sequence.For convenience's sake, the task sequence with the forward direction ant is expressed as The back is expressed as to the task sequence of ant Task sequence is to set up by the task of selecting at random to satisfy precedence constraint.

(2) the structure scheduling is separated

In this step, M ant M of construction problem respectively separated.The process of a global solution of ant structure as shown in Figure 2.When beginning, each ant can use the system of selection of roulette to select a kind of heuristic information based on pheromones.Just, select probability and the pheromones τ of heuristic information A AShared ratio is directly proportional.

After having selected a kind of heuristic information, ant just begins to construct having separated of scheduling problem.In each step of construction solution, ant can be selected a service processes based on pheromones and heuristic information, and with first unmapped duty mapping in the task queue in this service processes.Selection is with task T iBe mapped to Method be

In this system of selection, generate a random number q ∈ [0,1], and with itself and a parameter q 0∈ [0,1] relatively.If q≤q 0, ant will be with T so iBe mapped to and contain maximum In the service processes of value.Otherwise,, just select the system of selection of utilization roulette Possibility with Size is directly proportional.Wherein, β 〉=1st, the parameter of the relative influence of decision pheromones with heuristic information.

In circulation each time, every ant recycles this selection mode N time, separates thereby N duty mapping formed a complete scheduling in N the service processes.

3. the processing of pheromones

(1) pheromones initialization

In this article, for different QoS demands, the initial value τ of pheromones 0Provide according to following formula

Wherein, min_Reliability represents the least reliability of all service processes, and max_Reliability=100.Min_Makespan is the minimum duration of estimating of workflow, and max_Makespan is the maximum duration of estimating.These two estimated values can be by calculating each duty mapping to having in the minimum service processes of (perhaps maximum) time of implementation.Same, min_Cost and max_Cost are least cost and the costs on the higher scale that workflow is estimated.They can be by calculating each duty mapping in the service processes that has minimum (perhaps maximum) execution cost.

(2) local message is plain upgrades

The invention method in, when ant with a task T iBe mapped to a service processes After, carry out the renewal of local pheromones at once.The plain method for updating of local message is given by the following formula

τ ij=(1-ρ)·τ ij+ρ·τ 0

Wherein, ρ ∈ (0,1) is a parameter.Because τ 0Also be the minimum of pheromones simultaneously, so the plain effect of upgrading of local message is to reduce τ IjValue to increase the diversity of algorithm.

Pheromones on the heuristic information equally also will be carried out the renewal of local message element.After ant has been selected a kind of heuristic information, heuristic information A for example, the pheromones on this heuristic information will change according to following formula

τ A=(1-ρ)·τ A+ρ·τ 0

(3) global information is plain upgrades

All constructed the renewal of carrying out the global information element after separating when all ants.Algorithm at first can be separated in the present age circulation all and compare.The quality that K is separated in scheduling can calculate according to following three formulas.For the reliability optimization problem, the evaluation of estimate of K is

Wherein, the evaluation of estimate of K is made up of two parts: the firstth, satisfy the evaluation of estimate that QoS retrains, and the secondth, the evaluation of estimate of the quality of the qos parameter that need optimize.The interval of each part evaluation be (0,1], thus the interval of K.score be (0,2].If K has satisfied all QoS constraints, the evaluation of estimate of corresponding QoS constraint will be made as 1, and the evaluation of estimate of the qos parameter that the user need optimize is then set according to the reliability of K.On the other hand, if K can not satisfy all QoS constraints, the evaluation of estimate of QoS constraint will be set according to the degree that satisfies constraint, and the evaluation of estimate of the qos parameter that the user need optimize then can be set to minimum value.

Similarly, in duration optimization, the evaluation of estimate of K is

For Cost Optimization, the evaluation of estimate of K is

The globally optimal solution that only has high evaluation value just can carry out the renewal of global information element.Suppose that globally optimal solution is K (K 1..., K n), overall update strategy is given as follows

τ i K i = ( 1 - ρ ) · τ iK i + ρ · K . score , i=1,2,...,n

The flow chart of whole algorithm as shown in Figure 3.

Algorithm according to user-defined QoS constraint and the extensive grid work flow of demand optimization is very rare, in existing document, has only the Deadline-MDP algorithm of proposition such as Yu can be used for finding the solution of similar problem.Therefore, method and the Deadline-MDP algorithm with invention compares.Be noted that the Deadline-MDP algorithm can only be used to solve the Cost Optimization problem of band time limit constraint.10 examples that the utilization grid work flow is used come these two kinds of methods are tested.Wherein, preceding 3 examples are the workflow problems in the reality, comprise e-Economic application problem, Neuscience application problem and e-protein workflow problem.Remaining example then generates according to the PSPLIB storehouse.Because Deadline-MDP is a kind of deterministic algorithm, so it can only provide one of problem to separate.The ant group algorithm that proposes then is a kind of random algorithm of tape guide.In order to compare all sidedly, the method independent operating of inventing is obtained 100 results for 100 times.In 10 all problems, the mean value that ant group algorithm obtains all is better than the result that Deadline-MDP obtains.In addition, in or (have 30 above tasks) in the extensive problem, even the poorest result that ant group algorithm obtains also is better than the result of Deadline-MDP.Generally speaking, ant group algorithm can reduce the expense of workflow 10-20%, and this method that has proved invention is effective.

Claims (4)

1. method of using ant group algorithm to optimize the grid work flow of multiple QoS QoS is characterized in that this method may further comprise the steps:
(1) initiation parameter: for different QoS demands, the initial value τ of pheromones 0Provide according to following formula
Wherein, min_Reliability represents the least reliability of all service processes, and max_Reliability=100; Min_Makespan is the minimum duration of estimating of workflow, and max_Makespan is the maximum duration of estimating; These two estimated values are by calculating each duty mapping in the service processes that has minimum or maximum execution time; Same, min_Cost and max_Cost are least cost and the costs on the higher scale that workflow is estimated; They are by calculating each duty mapping in the service processes that has minimum or maximum execution cost;
(2) all ants of initialization: in when beginning circulation each time, every ant all can select forward direction or back to as structural grain at random; The forward direction ant can be according to given dominance relation construction solution in work flow network; Opposite, the back will begin search from end node to ant, and all arrows is reverse; In addition, every ant all will be set up a task sequence that meets precedence constraint, and based on this task sequence task is mapped in the service processes successively, and task sequence is to set up by the task of selecting at random to satisfy precedence constraint;
(3) every ant is at first selected a kind of heuristic information based on the system of selection of pheromones utilization roulette, after ant has been selected a kind of heuristic information, by following formula the pheromones on this heuristic information is carried out local updating
τ A=(1-ρ)·τ A+ρ·τ 0
Wherein, the heuristic information of establishing selection is heuristic information A, τ ABe the pheromones on the heuristic information A, ρ ∈ (0,1) is a parameter;
(4) selected a kind of heuristic information by above-mentioned steps after, ant begins to construct separating of scheduling problem; In each step of construction solution, ant can be selected a service processes based on pheromones and heuristic information, and with first unmapped duty mapping in the task queue in this service processes; Selection is with task T iBe mapped to j item service processes Method be
In this system of selection, generate a random number q ∈ [0,1], and with itself and a parameter q 0∈ [0,1] relatively; If q≤q 0, ant will be with T so iBe mapped to and contain maximum In the service processes of value; Otherwise,, just select the system of selection of utilization roulette Possibility with Size is directly proportional; τ wherein IjAnd η IjRepresent T respectively iBe mapped to process Pheromones and heuristic information, β 〉=1st, the parameter of decision pheromones relative influence with heuristic information; When ant with a task T iBe mapped to a service processes After, carry out the renewal of local pheromones at once; The plain method for updating of local message is given by the following formula
τ ij=(1-ρ)·τ ij+ρ·τ 0
In circulation each time, every ant recycles this selection mode N time, separates thereby N duty mapping formed a complete scheduling in N the service processes;
(5) after all ants are all finished the structure of separating, each scheduling separated estimate;
(6) renewal of execution global information element; The globally optimal solution that only has high evaluation value just can carry out the renewal of global information element; Suppose that globally optimal solution is K (K 1..., K n), overall update strategy is given as follows
τ i K i = ( 1 - ρ ) · τ iK i + ρ · K . score , i=1,2,...,n
Wherein K.score is the evaluation of estimate of optimal solution K;
(7), otherwise get back to step (2) if reach termination condition then termination routine.
2. based on the described a kind of method of using ant group algorithm to optimize multiple QoS QoS grid work flow of claim 1, it is characterized in that this method has been considered three basic qos parameters: reliability, time and expense; This method allows the user to provide required QoS constraint, and the qos parameter of specifying needs to optimize.
3. based on the described a kind of method of using ant group algorithm to optimize multiple QoS QoS grid work flow of claim 1, it is characterized in that, designed the search behavior that seven kinds of heuristic informations based on process are used to guide ant, comprising:
(1) the reliability greediness is heuristic: one has more that the service processes of high reliability will have higher heuristic information, and artificial ant will have higher probability and select the high service processes of reliability;
(2) greediness is heuristic the time: the service processes with shorter time of implementation will have higher heuristic information, and artificial ant will have higher probability and select short service processes of time of implementation;
(3) the expense greediness is heuristic: the service processes with lower expense will have higher heuristic information, and artificial ant will have the higher lower service processes of probability sorting charge;
(4) Jian Yi time limit is heuristic: based on the user-defined time limit, give the time limit of a suggestion to each task in abstract workflow, a time of implementation will have higher heuristic information with advising more approaching service processes of time limit, and artificial ant will have higher probability and select the service processes of time of implementation near the suggestion time limit;
(5) Jian Yi budget is heuristic: based on user-defined master budget, give the budget of a suggestion to each task in abstract workflow, an execution cost service processes more approaching with advising budget will have higher heuristic information, and artificial ant will have higher probability and select the service processes of execution cost near the suggestion budget;
(6) time/expense is heuristic: the service processes with shorter time of implementation and lower expense will have higher heuristic information, and artificial ant will have higher probability and select the short and lower service processes of expense of time of implementation;
(7) overall performance is heuristic: one has more that the service processes of high reliability, shorter time of implementation and lower expense will have higher heuristic information, and artificial ant will have higher probability and select that reliability is higher, the time of implementation is short and the lower service processes of expense;
Ant at first needs to select a kind of heuristic information to guide this construction process according to pheromones when construction solution.
4. based on the described a kind of method of using ant group algorithm to optimize multiple QoS QoS grid work flow of claim 1, it is characterized in that the evaluation of estimate K.score that separates K calculates according to following formula, for the reliability optimization problem, the evaluation of estimate of K is
For the duration optimization problem, the evaluation of estimate of K is
For the Cost Optimization problem, the evaluation of estimate of K is
In these three formulas, K.cost is the total cost of K, the K reliability that K.reliability is, and K.makespan is total time of implementation of K, and Budget is user-defined costs on the higher scale constraint, and Deadline is the user-defined time limit constraint of finishing.
CN2008100264875A 2008-02-27 2008-02-27 Method for optimizing multi-QoS grid workflow based on ant group algorithm CN101237469B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2008100264875A CN101237469B (en) 2008-02-27 2008-02-27 Method for optimizing multi-QoS grid workflow based on ant group algorithm

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2008100264875A CN101237469B (en) 2008-02-27 2008-02-27 Method for optimizing multi-QoS grid workflow based on ant group algorithm

Publications (2)

Publication Number Publication Date
CN101237469A CN101237469A (en) 2008-08-06
CN101237469B true CN101237469B (en) 2011-07-20

Family

ID=39920826

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2008100264875A CN101237469B (en) 2008-02-27 2008-02-27 Method for optimizing multi-QoS grid workflow based on ant group algorithm

Country Status (1)

Country Link
CN (1) CN101237469B (en)

Families Citing this family (15)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101616179B (en) * 2009-07-24 2012-12-26 北京工业大学 Dynamic member service selection method based on descending factors in service combination
CN101753450B (en) * 2009-12-21 2012-09-05 西安电子科技大学 Method for joint optimization of resources in three-layered network
CN101944157B (en) * 2010-08-19 2014-09-03 中国船舶重工集团公司第七0九研究所 Biological intelligence scheduling method for simulation grid system
CN101957777B (en) * 2010-09-09 2012-11-21 西北工业大学 Method for scheduling data processing procedure
CN102254223A (en) * 2011-06-29 2011-11-23 西安交通大学 Ant colony algorithm-based self-adapting stochastic resonance system parameter selecting method
CN102508935A (en) * 2011-09-22 2012-06-20 南京大学 On-chip network mapping method based on ant-colony chaos genetic algorithm
CN102497495B (en) * 2011-12-21 2013-10-09 北京航空航天大学深圳研究院 Target association method for multi-camera monitoring system
CN102774376B (en) * 2012-06-14 2014-03-12 北京理工大学 Task allocation method of distributed control system of hybrid power vehicle
CN102745192B (en) * 2012-06-14 2014-03-12 北京理工大学 Task allocation system for distributed control system of hybrid vehicle
CN103246938A (en) * 2013-04-25 2013-08-14 中山大学 Self-adaptive ant colony optimization based flexible workshop dispatching technology
CN103226759A (en) * 2013-04-25 2013-07-31 中山大学 Dynamic cloud workflow scheduling method based on genetic algorithm
CN105739979B (en) * 2016-01-28 2018-11-02 上海大学 A kind of workflow choosing method based on probability service procedure
CN105912409A (en) * 2016-06-30 2016-08-31 天脉聚源(北京)传媒科技有限公司 Task scheduling method and device
CN106228265B (en) * 2016-07-18 2019-12-03 中山大学 Phase transport project dispatching method is always dragged based on Modified particle swarm optimization
CN108737569B (en) * 2018-06-22 2020-04-28 浙江大学 Service selection method facing mobile edge computing environment

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1731761A (en) * 2005-08-05 2006-02-08 武汉理工大学 QoS multicast routing method based on the combination of ant algorithm
CN101043444A (en) * 2007-04-26 2007-09-26 浙江大学 Distributed quality of service multicast routing process based on ant group optimization

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN1731761A (en) * 2005-08-05 2006-02-08 武汉理工大学 QoS multicast routing method based on the combination of ant algorithm
CN101043444A (en) * 2007-04-26 2007-09-26 浙江大学 Distributed quality of service multicast routing process based on ant group optimization

Non-Patent Citations (2)

* Cited by examiner, † Cited by third party
Title
John G. Vlachogiannis, Nikos D. Hatziargyriou.Ant Colony System-Based Algorithm for Constrained Load Flow Problem.IEEE TRANSACTIONS ON POWER SYSTEMS.2005,20(3),1241-1249. *
蒋玲艳,张军,钟树鸿.蚁群算法的参数分析.计算机工程与应用.2007,(20),31-36. *

Also Published As

Publication number Publication date
CN101237469A (en) 2008-08-06

Similar Documents

Publication Publication Date Title
Kaur et al. Container-as-a-service at the edge: Trade-off between energy efficiency and service availability at fog nano data centers
CN104657221B (en) The more queue flood peak staggered regulation models and method of task based access control classification in a kind of cloud computing
Fard et al. A multi-objective approach for workflow scheduling in heterogeneous environments
Taghaddos et al. Simulation-based multiagent approach for scheduling modular construction
CN101957780B (en) Resource state information-based grid task scheduling processor and grid task scheduling processing method
Xu et al. A multiple QoS constrained scheduling strategy of multiple workflows for cloud computing
Arabnejad et al. Low-time complexity budget–deadline constrained workflow scheduling on heterogeneous resources
CN101719931B (en) Multi-intelligent body-based hierarchical cloud computing model construction method
Liu et al. Resource preprocessing and optimal task scheduling in cloud computing environments
CN101067758B (en) Energy consumption management method for inserting system
CN104657220B (en) Scheduling model and method based on deadline and expense restriction in mixed cloud
CN104317658A (en) MapReduce based load self-adaptive task scheduling method
CN100570569C (en) Operation cross-domain control method under the grid computing environment
Chen et al. Optimal deadline scheduling with commitment
Jiang et al. Task allocation for undependable multiagent systems in social networks
Li et al. Subtask scheduling for distributed robots in cloud manufacturing
CN106155791B (en) A kind of workflow task dispatching method under distributed environment
Kumar et al. Maximizing business value by optimal assignment of jobs to resources in grid computing
Ali et al. Grouped tasks scheduling algorithm based on QoS in cloud computing network
CN102521056B (en) Task allocation device and task allocation method
CN100576177C (en) Bidirectional grade gridding resource scheduling method based on the QoS constraint
Patel et al. Priority based job scheduling techniques in cloud computing: a systematic review
CN103699446A (en) Quantum-behaved particle swarm optimization (QPSO) algorithm based multi-objective dynamic workflow scheduling method
CN103473134B (en) A kind of dependence task dispatching method of heterogeneous multi-nucleus processor
JPH0883115A (en) Device and method for performing control and scheduling of process machine

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
C17 Cessation of patent right
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20110720

Termination date: 20120227