Affiliation:
1. University of Mysore, Mysore, India
Abstract
Cloud computing is the latest in distributed computing technology. The delivery mechanism between the service provider and users depends on Service Level Agreement (SLA). SLA contains Quality of Service (QoS), which has some constraints such as deadline to achieve user satisfaction. In this article, the authors propose a Deadline-Aware Priority Scheduling (DAPS) model to minimize the average makespan, and maximize resource utilization under deadline constraint. In the proposed model, the tasks are sorted based on length priority in ascending order and labeling the VM's state as successful which achieves the deadline constraint, and then mapping the tasks to the suitable VM that has minimum processing time. The authors compared their proposed model to the existing algorithms GA, Min-Min, SJF and Round Robin. The proposed model outperforms other algorithms by reducing the average of makespan, mean of total average response time, number of violations, violation ratio, and failure ratio, while increasing resource utilization, and guarantee ratio for tasks that meet deadline constraint.
Subject
Computer Networks and Communications
Reference36 articles.
1. Masdari, M., Salehi, F., Jalali, M., & Bidaki, M. (2016). A Survey of PSO-Based Scheduling Algorithms in Cloud Computing.Journal of Network and Systems Management.
2. Shen, Y., Bao, Z., Qin, X., & Shen, J. (2016). Adaptive task scheduling strategy in cloud: When energy consumption meets performance guarantee.World Wide Web, 20(2), 155-173.
3. A review energy-efficient task scheduling algorithms in cloud computing
4. Development and Analysis of a New Cloudlet Allocation Strategy for QoS Improvement in Cloud
5. Dynamic Task Scheduling Algorithm based on Ant Colony Scheme.;K. N.Baxodirjonovich;IACSIT International Journal of Engineering and Technology,2015
Cited by
13 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献