Adaptive and Convex Optimization-Inspired Workflow Scheduling for Cloud Environment

Adaptive and Convex Optimization-Inspired Workflow Scheduling for Cloud Environment

Kamlesh Lakhwani, Gajanand Sharma, Ramandeep Sandhu, Naresh Kumar Nagwani, Sandeep Bhargava, Varsha Arya, Ammar Almomani
Copyright: © 2023 |Pages: 25
DOI: 10.4018/IJCAC.324809
Article PDF Download
Open access articles are freely available for download

Abstract

Scheduling large-scale and resource-intensive workflows in cloud infrastructure is one of the main challenges for cloud service providers (CSPs). Cloud infrastructure is more efficient when virtual machines and other resources work up to their full potential. The main factor that influences the quality of cloud services is the distribution of workflow on virtual machines (VMs). Scheduling tasks to VMs depends on the type of workflow and mechanism of resource allocation. Scientific workflows include large-scale data transfer and consume intensive resources of cloud infrastructures. Therefore, scheduling of tasks from scientific workflows on VMs requires efficient and optimized workflow scheduling techniques. This paper proposes an optimised workflow scheduling approach that aims to improve the utilization of cloud resources without increasing execution time and execution cost.
Article Preview
Top

Introduction

Cloud is a challenging and highly demanding system where services are metered, reliable, and can be accessed on-demand Yang and Chen (2010), Zhang et al. (2010), Sandhu and Lakhwani (2022), Sorkhoh et al (2020). Workflows Zhao et al. (2011) have been used to model scientific applications Barker and Van Hemert (2007), Pietri et al. (2013), Gil et al. (2007). Scientific workflows like MONTAGE, LIGO, SIPHT, GENOME, etc. have millions of tasks. Zhao et al. (2011), Vöckler et al. (2011), Kouatli, I (2020). These tasks must be mapped to cloud resources as they become feasible to provide efficient scheduling with the least amount of resource consumption. There are varieties of optimization approaches that may be used to find optimal scheduling solutions (Casavant and Kuhl, 1988). To address different optimization problems numerous general-purpose meta-heuristic algorithms are available (Talbi, 2009). These algorithms provide scheduling and optimization solutions that are close to optimum (Kumar and Sivakumar, 2022; Bisht and Vampugani, 2022; Alakbarov, 2022), Farhat et al (2020) .

Meta-heuristic approaches are generally more computationally intensive than heuristic approaches and take longer to run; however, they also tend to find more desirable schedules as they explore different solutions using a guided search. In cloud systems, using meta-heuristics approach to solve the workflow scheduling problem involves many challenges such as: modeling a theoretically unbound number of resources, defining operations to avoid exploring invalid solutions (e.g., data dependency violations) to facilitate convergence, and pruning the search space by using heuristics based on the cloud resource model (Negi et al., 2013; Rajput et al., 2022; Kumar et al., 2022).

In the recent era, single-objective and multi-objective-based tasks scheduling (Vöckler et al., 2011, Vecchiola et al., 2009, Malawski et al., 2015, Hammoud et al. 2020) and mapping algorithms have been used by researchers in cloud environment (Holland, 1992, Rodriguez and Buyya, 2017, Mehta et al., 2009, Deelman et al., 2015, Verma and Kaushal, 2015). There are many promising studies that provide efficient scheduling of input tasks in cloud systems (Yu and Buyya, 2005, Calheiros et al., 2011, Arisdakessian,et al. 2020, Mishra et al. 2021). Still, research demands improvements in existing meta heuristic algorithms so that resources can be utilized at maximum.

Tasks scheduling in cloud computing is a fast and demanding area of research. In cloud computing, plenty of tasks runs concurrently and use the resources online. The scheduling reduces the computation time and processing time of tasks (Alkhanak et al., 2016, Liu et al., 2017, Reddy and Kumar, 2017, Rimal and Maier, 2016, Zhu et al., 2015, Wahab, O. A., et al. 2017). Different types of algorithms and techniques (Nasr et al., 2014, Singh and Singh, 2013, Zhang et al., 2017, Priya and Kiranbir, 2018, Huang et al., 2013, Abrishami et al., 2013, Arabnejad et al., 2016, Ghose et al., 2017, Shaw and Singh, 2014, Shi and Dongarra, 2006, Delavar and Aryan, 2014, Alkhanak and Lee, 2018, Al-Qerem et al. 2020, Kuppusamy, P., et al. 2022) used for task scheduling in the cloud system are categorized in Figure 1.

Figure 1.

Dependent task scheduling

IJCAC.324809.f01

Complete Article List

Search this Journal:
Reset
Volume 14: 1 Issue (2024)
Volume 13: 1 Issue (2023)
Volume 12: 4 Issues (2022): 2 Released, 2 Forthcoming
Volume 11: 4 Issues (2021)
Volume 10: 4 Issues (2020)
Volume 9: 4 Issues (2019)
Volume 8: 4 Issues (2018)
Volume 7: 4 Issues (2017)
Volume 6: 4 Issues (2016)
Volume 5: 4 Issues (2015)
Volume 4: 4 Issues (2014)
Volume 3: 4 Issues (2013)
Volume 2: 4 Issues (2012)
Volume 1: 4 Issues (2011)
View Complete Journal Contents Listing