By Topic

An adaptive rescheduling scheme based heuristic algorithm for cloud services applications

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

2 Author(s)
Yee-Ming Chen ; Dept. of Ind. Eng. & Manage., Yuan Ze Univ., Taoyuan, Taiwan ; Wen-Chien Wang

Maximizing resource provider service and satisfying user requirements at the same time is a challenging problem in cloud computing environments. The resource provider scheduler can automatically modify the number of resources and usage time of allocation requests. By using rescheduling, resource provider are able to prioritize the most profitable requests dynamically and still satisfy the requirements of the rush requests. In this paper, we propose a novel rescheduling scheme to resolve rush requests with the minimum change in the existing service assignments from graph coloring perspective. We evaluate our proposed scheme under different cloud services task assignment scenarios through computer simulations. The simulation results show that the proposed scheme produces effective contention resolution and better quality-of-service (QoS).

Published in:

Machine Learning and Cybernetics (ICMLC), 2011 International Conference on  (Volume:3 )

Date of Conference:

10-13 July 2011