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
- Summary
- Abstract
- Description
- Claims
- Application Information
AI Technical Summary
Problems solved by technology
Method used
Image
Examples
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...
PUM
Login to View More Abstract
Description
Claims
Application Information
Login to View More - R&D
- Intellectual Property
- Life Sciences
- Materials
- Tech Scout
- Unparalleled Data Quality
- Higher Quality Content
- 60% Fewer Hallucinations
Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic, Popular Technical Reports.
© 2025 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap|About US| Contact US: help@patsnap.com



