Welcome to the InfoSci Platform
Improvement in Task Scheduling Capabilities for SaaS Cloud Deployments Using Intelligent Schedulers

Improvement in Task Scheduling Capabilities for SaaS Cloud Deployments Using Intelligent Schedulers

Supriya Sawwashere
Copyright: © 2021 |Volume: 6 |Issue: 2 |Pages: 12
ISSN: 2379-738X|EISSN: 2379-7371|EISBN13: 9781799862994|DOI: 10.4018/IJBDAH.287104
Cite Article Cite Article

MLA

Sawwashere, Supriya. "Improvement in Task Scheduling Capabilities for SaaS Cloud Deployments Using Intelligent Schedulers." IJBDAH vol.6, no.2 2021: pp.1-12. http://doi.org/10.4018/IJBDAH.287104

APA

Sawwashere, S. (2021). Improvement in Task Scheduling Capabilities for SaaS Cloud Deployments Using Intelligent Schedulers. International Journal of Big Data and Analytics in Healthcare (IJBDAH), 6(2), 1-12. http://doi.org/10.4018/IJBDAH.287104

Chicago

Sawwashere, Supriya. "Improvement in Task Scheduling Capabilities for SaaS Cloud Deployments Using Intelligent Schedulers," International Journal of Big Data and Analytics in Healthcare (IJBDAH) 6, no.2: 1-12. http://doi.org/10.4018/IJBDAH.287104

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

Task scheduling on the cloud involves processing a large set of variables from both the task side and the scheduling machine side. This processing often results in a computational model that produces efficient task to machine maps. The efficiency of such models is decided based on various parameters like computational complexity, mean waiting time for the task, effectiveness to utilize the machines, etc. In this paper, a novel Q-Dynamic and Integrated Resource Scheduling (DAIRS-Q) algorithm is proposed which combines the effectiveness of DAIRS with Q-Learning in order to reduce the task waiting time, and improve the machine utilization efficiency. The DAIRS algorithm produces an initial task to machine mapping, which is optimized with the help of a reward & penalty model using Q-Learning, and a final task-machine map is obtained. The performance of the proposed algorithm showcases a 15% reduction in task waiting time, and a 20% improvement in machine utilization when compared to DAIRS and other standard task scheduling algorithms.