A hyper-heuristic selector algorithm for cloud computing scheduling based on workflow features

Abdolreza Rasouli Kenari () and Mahboubeh Shamsi ()
Additional contact information
Abdolreza Rasouli Kenari: Qom University of Technology
Mahboubeh Shamsi: Qom University of Technology

OPSEARCH, 2021, vol. 58, issue 4, No 5, 852-868

Abstract: Abstract This study focuses on the presentation of a new algorithm for scheduling workflows on heterogeneous distributed systems such as cloud computing. Since heterogeneous distributed systems deal with different types of resources, scheduling of applications on cloud resources plays an important role in the computing environment. Due to being heterogeneous and dynamic properties of resources as well as large numbers of tasks with different characteristics and dependencies among tasks, scheduling tasks on cloud computing is referred to as an NP-hard problem. Heuristic methods are one of the common approaches to solve this problem. Heuristic algorithms according to the specifications of resources and workflow structure could be superior to the rule-based methods. However, it is difficult to define which heuristic algorithm is performed better than the rest. Therefore, the choice of appropriate heuristic algorithms based on the circumstances can be effective. Moreover, the hyper-heuristic algorithm obtains higher performance. In this study, a new method is presented to improve the Hyper-Heuristic Scheduling Algorithm for the cloud using the decision tree method to select a convenient heuristic algorithm based on the characteristics of resources and workflows by considering evaluation criteria such as cost and Makespan. Finally, the presented algorithm is evaluated by Workflowsim and using RapidMiner. The simulation results demonstrate that our proposed algorithm outperforms existing approaches in terms of Makespan and Accuracy.

Keywords: Cloud computing; Workflow; Heuristic algorithm; Heterogeneous distributed systems; Decision tree; Makespan (search for similar items in EconPapers)
Date: 2021
References: View references in EconPapers View complete reference list from CitEc
Citations:

Downloads: (external link)
http://link.springer.com/10.1007/s12597-021-00508-6 Abstract (text/html)
Access to the full text of the articles in this series is restricted.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:opsear:v:58:y:2021:i:4:d:10.1007_s12597-021-00508-6

Ordering information: This journal article can be ordered from
http://www.springer. ... search/journal/12597

DOI: 10.1007/s12597-021-00508-6

Access Statistics for this article

OPSEARCH is currently edited by Birendra Mandal

More articles in OPSEARCH from Springer, Operational Research Society of India
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().