Unlock instant, AI-driven research and patent intelligence for your innovation.

Time constraint scientific workflow optimization method based on ant colony algorithm

A time-constrained, ant colony algorithm technology, applied in the research field of cloud service platform and intelligent computing, can solve problems such as insufficient

Active Publication Date: 2019-04-16
SOUTH CHINA UNIV OF TECH
View PDF3 Cites 9 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

Under such a model, the virtual computing power is either the same, or is linearly related to its price, so the cost of running a task on different virtual machines is almost the same, which is often inconsistent with the reality
In practice, when a cloud service needs to process a task, it is not enough to only consider CPU resources

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Time constraint scientific workflow optimization method based on ant colony algorithm
  • Time constraint scientific workflow optimization method based on ant colony algorithm
  • Time constraint scientific workflow optimization method based on ant colony algorithm

Examples

Experimental program
Comparison scheme
Effect test

Embodiment

[0073] A time-constrained scientific workflow optimization method based on ant colony algorithm, such as figure 1 shown, including the following steps:

[0074] workflow model

[0075] Workflow is represented as a task priority graph (TPG), represented by a directed acyclic graph, denoted as G(V,E), such as figure 2 shown. Node set V={v 1 ,v 2 ,…,v n} Indicates that there are n tasks in the workflow that need to be assigned, and the edge e between nodes ij =(v i ,v j ) represents the task v i to take precedence over task v j . In the workflow scheduling on the cloud service platform, each edge has a weight to represent the size of the data that needs to be transmitted between the previous task and the next task. In addition, each workflow has a customer preset deadline D, such as figure 2 A simple workflow is shown.

[0076] Unlike many previous models, in the present invention, in order to distinguish between computationally intensive tasks and data-intensive t...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

PUM

No PUM Login to View More

Abstract

The invention discloses a time constraint scientific workflow optimization method based on an ant colony algorithm, and the method comprises the following steps: initializing information, initializingall ants, and constructing a mapping sequence between a task and a resource through employing an initial pheromone and heuristic information; utilizing a decoding algorithm to construct a complete scheduling scheme for the information in the codes; locally updating pheromones and globally updating pheromones according to requirements; updating the heuristic information, and updating the heuristicinformation distributed to the virtual machine by the task according to the price and the cost factor. According to the invention, the ant colony algorithm is combined with time constraint. Comparedwith the prior art, the method has the advantages that the optimization result quality is guaranteed, different enlightenment information and penalty functions are adopted for different solutions, thetime constraint and the solution space diversity of the workflow can be better balanced, meanwhile, by optimizing available resources, the execution efficiency is further improved, and good performance is achieved in optimization.

Description

technical field [0001] The invention relates to the research field of cloud service platform and intelligent computing, in particular to a time-constrained scientific workflow optimization method based on ant colony algorithm. Background technique [0002] In the scientific computing environment, a workflow is defined as a series of atomic tasks, a collection of tasks formed by data or computational dependencies. Workflows have been applied in many fields such as e-commerce, bioinformatics, astronomy and physics. In these domains, tasks are typically classified as computationally intensive and data-intensive, both of which require execution within a time frame acceptable to the user. To meet quality of service, large-scale workflows are usually deployed and executed in a distributed environment. How to coordinate the requests of multiple tasks on different resources and optimize the task completion time and task cost is one of the current research hotspots. [0003] Cloud...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to View More

Application Information

Patent Timeline
no application Login to View More
Patent Type & Authority Applications(China)
IPC IPC(8): G06F9/50G06F9/455G06N3/00
CPCG06F9/45558G06F9/5016G06F9/5027G06N3/006Y02D10/00
Inventor 张军詹志辉陈伟能余维杰
Owner SOUTH CHINA UNIV OF TECH
Features
  • R&D
  • Intellectual Property
  • Life Sciences
  • Materials
  • Tech Scout
Why Patsnap Eureka
  • Unparalleled Data Quality
  • Higher Quality Content
  • 60% Fewer Hallucinations
Social media
Patsnap Eureka Blog
Learn More