Reference Hub3
QoS Based Efficient Resource Allocation and Scheduling in Cloud Computing

QoS Based Efficient Resource Allocation and Scheduling in Cloud Computing

Harvinder Chahal, Anshu Bhasin, Parag Ravikant Kaveri
Copyright: © 2019 |Volume: 15 |Issue: 4 |Pages: 17
ISSN: 1548-3908|EISSN: 1548-3916|EISBN13: 9781522564171|DOI: 10.4018/IJTHI.2019100102
Cite Article Cite Article

MLA

Chahal, Harvinder, et al. "QoS Based Efficient Resource Allocation and Scheduling in Cloud Computing." IJTHI vol.15, no.4 2019: pp.13-29. http://doi.org/10.4018/IJTHI.2019100102

APA

Chahal, H., Bhasin, A., & Kaveri, P. R. (2019). QoS Based Efficient Resource Allocation and Scheduling in Cloud Computing. International Journal of Technology and Human Interaction (IJTHI), 15(4), 13-29. http://doi.org/10.4018/IJTHI.2019100102

Chicago

Chahal, Harvinder, Anshu Bhasin, and Parag Ravikant Kaveri. "QoS Based Efficient Resource Allocation and Scheduling in Cloud Computing," International Journal of Technology and Human Interaction (IJTHI) 15, no.4: 13-29. http://doi.org/10.4018/IJTHI.2019100102

Export Reference

Mendeley
Favorite Full-Issue Download

Abstract

The Cloud environment is a large pool of virtually available resources that perform thousands of computational operations in real time for resource provisioning. Allocation and scheduling are two major pillars of said provisioning with quality of service (QoS). This involves complex modules such as: identification of task requirement, availability of resource, allocation decision, and scheduling operation. In the present scenario, it is intricate to manage cloud resources, as Service provider aims to provide resources to users on productive cost and time. In proposed research article, an optimized technique for efficient resource allocation and scheduling is presented. The proposed policy used heuristic based, ant colony optimization (ACO) for well-ordered allocation. The suggested algorithm implementation done using simulation, shows better results in terms of cost, time and utilization as compared to other algorithms.

Request Access

You do not own this content. Please login to recommend this title to your institution's librarian or purchase it from the IGI Global bookstore.