An Ant Colony Optimization Algorithm for the Time-varying Workflow Scheduling Problem in Grids
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chen, Wei-neng | - |
dc.contributor.author | Shi, Yuan | - |
dc.contributor.author | Zhang, Jun | - |
dc.date.accessioned | 2023-12-08T09:34:28Z | - |
dc.date.available | 2023-12-08T09:34:28Z | - |
dc.date.issued | 2009-05 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/erica/handle/2021.sw.erica/116043 | - |
dc.description.abstract | Grid workflow scheduling problem has been a research focus in grid computing in recent years. Various deterministic or meta-heuristic scheduling approaches have been proposed to solve this NP-complete problem. These existing algorithms, however, are not suitable to tackle a class of workflows, namely the time-varying workflow, in which the topologies change over time. In this paper, we propose an ant colony optimization (ACO) approach to tackle such kind of scheduling problems. The algorithm evaluates the overall performance of a schedule by tracing the sequence of its topologies in a period. Moreover, integrated pheromone information is designed to balance the workflow's cost and makespan. In the case study, a 9-task grid workflow with four topologies is used to test our approach. Experimental results demonstrate the effectiveness and robustness of the proposed algorithm. | - |
dc.format.extent | 6 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | IEEE | - |
dc.title | An Ant Colony Optimization Algorithm for the Time-varying Workflow Scheduling Problem in Grids | - |
dc.type | Article | - |
dc.publisher.location | 미국 | - |
dc.identifier.doi | 10.1109/CEC.2009.4983037 | - |
dc.identifier.scopusid | 2-s2.0-70449737241 | - |
dc.identifier.wosid | 000274803100115 | - |
dc.identifier.bibliographicCitation | 2009 IEEE Congress on Evolutionary Computation, pp 875 - 880 | - |
dc.citation.title | 2009 IEEE Congress on Evolutionary Computation | - |
dc.citation.startPage | 875 | - |
dc.citation.endPage | 880 | - |
dc.type.docType | Proceedings Paper | - |
dc.description.isOpenAccess | N | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Artificial Intelligence | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Interdisciplinary Applications | - |
dc.relation.journalWebOfScienceCategory | Engineering, Multidisciplinary | - |
dc.subject.keywordPlus | INDEPENDENT TASKS | - |
dc.subject.keywordAuthor | grid computing | - |
dc.subject.keywordAuthor | time-varying workflow | - |
dc.subject.keywordAuthor | scheduling problem | - |
dc.subject.keywordAuthor | ant colony optimization (ACO) | - |
dc.identifier.url | https://ieeexplore.ieee.org/document/4983037 | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
55 Hanyangdeahak-ro, Sangnok-gu, Ansan, Gyeonggi-do, 15588, Korea+82-31-400-4269 sweetbrain@hanyang.ac.kr
COPYRIGHT © 2021 HANYANG UNIVERSITY. ALL RIGHTS RESERVED.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.