By Topic

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Zheng Hu ; Xichang Electr. Power Bur., Sichuan Eletric Power Corp., Xichang, China ; Kaijun Wu ; Jinsong Huang

The analysis and research of power system necessitates the current computing. However, the bottleneck of current computing lies in the limited computing capacity in power system. Cloud computing's service-oriented characteristics advance a new way of service provisioning called utility based computing, which could provide powerful computing capability for current computing. However, toward the deployment of practical current computing Cloud, we encounter one challenge that the existing job scheduling algorithms under utility based computing do not take hardware/software failure and recovery in the Cloud into account. In an attempt to address this challenge, we introduce the failure and recovery scenario in the current Cloud computing entities and propose a Reinforcement Learning (RL) based algorithm to make job scheduling in the current computing Cloud fault tolerant. 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.

Published in:

Software Engineering and Service Science (ICSESS), 2012 IEEE 3rd International Conference on

Date of Conference:

22-24 June 2012