Abstract
The unpredictable number of task arriving at cloud datacentre and the rescaling of virtual processing elements can affect the provisioning of better Quality of Service expectations during task scheduling in cloud computing. Existing researchers have contributed several task scheduling algorithms to provide better QoS expectations but are characterized with entrapment at the local search and high dimensional breakdown due to slow convergence speed and imbalance between global and local search, resulting from lack of scalability. Dynamic task scheduling algorithms that can adjust to long-time changes and continue facilitating the provisioning of better QoS are necessary for cloud computing environment. In this study, a Cloud Scalable Multi-Objective Cat Swarm Optimization-based Simulated Annealing algorithm is proposed. In the proposed method, the orthogonal Taguchi approach is applied to enhance the SA which is incorporated into the local search of the proposed CSMCSOSA algorithm for scalability performance. A multi-objective QoS model based on execution time and execution cost criteria is presented to evaluate the efficiency of the proposed algorithm on CloudSim tool with two different datasets. Quantitative analysis of the algorithm is carried out with metrics of execution time, execution cost, QoS and performance improvement rate percentage. Meanwhile, the scalability analysis of the proposed algorithm using Isospeed-efficiency scalability metric is also reported. The results of the experiment show that the proposed CSM-CSOSA has outperformed Multi-Objective Genetic Algorithm, Multi-Objective Ant Colony and Multi-Objective Particle Swarm Optimization by returning minimum execution time and execution cost as well as better scalability acceptance rate of 0.4811−0.8990 respectively. The proposed solution when implemented in real cloud computing environment could possibly meet customers QoS expectations as well as that of the service providers.
Highlights
The evolution of cloud computing has reshaped Information Technology (IT) consumption through the provisioning of high-performance computing as well as massive resource storage that are continually channelled across a medium called the Internet
The unpredictable number of task arriving at cloud datacentre and the rescaling of virtual machine processing elements during task scheduling affects the provisioning of better Quality of Service (QoS) expectations
Dynamic task scheduling algorithms are considered to be effective for addressing this kind of problem but are truly complex to develop
Summary
The evolution of cloud computing has reshaped Information Technology (IT) consumption through the provisioning of high-performance computing as well as massive resource storage that are continually channelled across a medium called the Internet. The Platform as a Service (PaaS); providing operating systems and require services for a particular application (Furkt, 2010; Raza et al, 2015; Cui et al, 2017) All these services function within the delivery model of cloud computing such as Public cloud; that permit dynamic allocation of computing resource over the Internet through web applications. The service provider facilitates the provisioning of the required service that can meet this expectation while demanding for better pay. This problem can be referred to as a multi-objective NP-hard problem (Kalra & Singh, 2015). It is vital to design a low-complexity dynamic optimization algorithm to adapt the dynamicity of cloud tasks and resources while maintaining better QoS performance
Sign-in/Register to view highlights & summary Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callMore From: Journal of Information and Communication Technology
Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
