An utility-based job scheduling algorithm for cloud computing considering reliability factor

27Citations
Citations of this article
21Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Cloud computing' service-oriented characteristics advance a new way of service provisioning called utility based computing. However, toward the practical application of commercialized Cloud, we encounter two challenges: i) there is no well-defined job scheduling algorithm for the Cloud that considers the system state in the future, particularly under overloading circumstances; ii) the existing job scheduling algorithms under utility computing paradigm do not take hardware/software failure and recovery in the Cloud into account. In an attempt to address these challenges, we introduce the failure and recovery scenario in the Cloud computing entities and propose a Reinforcement Learning (RL) based algorithm to make job scheduling fault-tolerable while maximizing utilities attained in the long term. We carry out experimental comparison with Resource-constrained Utility Accrual algorithm (RUA), Utility Accrual Packet scheduling algorithm (UPA) and LBESA to demonstrate the feasibility of our proposed approach. © 2011 IEEE.

Cite

CITATION STYLE

APA

Yang, B., Xu, X., Tan, F., & Park, D. H. (2011). An utility-based job scheduling algorithm for cloud computing considering reliability factor. In Proceedings - 2011 International Conference on Cloud and Service Computing, CSC 2011 (pp. 95–102). https://doi.org/10.1109/CSC.2011.6138559

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free