Abstract
The evolution of cloud computing facilitates applications with varying demands to operate in a virtualized environment. For instance, applications like the healthcare system, video streaming, Internet of Things (IoT) that are moving to the cloud, demand responses within a particular time limit, i.e., deadline. However, the cloud computing system consumes a considerable amount of electric energy while providing services to these type of applications, which in turn contribute to the high operational cost. Specifically, it becomes cumbersome to offer services to deadline sensitive task while minimizing energy consumption. In this regard, efficient task scheduling is an attractive way to cut down energy usage while ensuring satisfactory services for cloud users. In this paper, the task scheduling problem is considered as a bi-objective minimization problem which includes minimization of energy consumption and makespan. First, we proposed a novel learning automata-based scheduling framework for deadline sensitive tasks in the cloud. Learning automata (LA) is an adaptive decision-making unit that helps the scheduler to select the best responses. Later, the LA-based Scheduling (LAS) algorithm is introduced which exploits the heterogeneity of tasks and virtual machines (VMs) while ensuring the timing requirements of the tasks. Extensive simulation is carried out to designate the effectiveness and applicability of LAS for deadline sensitive task scheduling in the heterogeneous cloud environment.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
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.