Cooperative Coevolutionary Genetic Programming Hyper-Heuristic for Budget Constrained Dynamic Multi-workflow Scheduling in Cloud Computing

1Citations
Citations of this article
5Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Dynamic Multi-workflow Scheduling (DMWS) in cloud computing is a well-known combinatorial optimisation problem. It is a great challenge to tackle this problem by scheduling multiple workflows submitted at different times and meet user-defined quality of service objectives. Scheduling with user-defined budget constraints is becoming increasingly important due to cloud dynamics associated with on-demand provisioning, instance types, and pricing. To address the Budget-Constrained Dynamic Multi-workflow Scheduling (BC-DMWS) problem, a novel Cooperative Coevolution Genetic Programming (CCGP) approach is proposed. Two heuristic rules, namely VM Selection/Creation Rule (VMR) and Budget Alert Rule (BAR), are learned automatically by CCGP. VMR is used to allocate ready tasks to either existing or newly rented VM instances, while BAR makes decisions to downgrade VM instances so as to meet the budget constraint. Experiments show significant performance and success rate improvement compared to state-of-the-art algorithms.

Cite

CITATION STYLE

APA

Escott, K. R., Ma, H., & Chen, G. (2023). Cooperative Coevolutionary Genetic Programming Hyper-Heuristic for Budget Constrained Dynamic Multi-workflow Scheduling in Cloud Computing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 13987 LNCS, pp. 146–161). Springer Science and Business Media Deutschland GmbH. https://doi.org/10.1007/978-3-031-30035-6_10

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free