By Topic

A dynamic priority scheduling algorithm on service request scheduling in cloud computing

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
$33 $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)
Zhongyuan Lee ; State Key Lab. of Networking & Switching Technol., Beijing Univ. of Posts & Telecommun., Beijing, China ; Ying Wang ; Wen Zhou

With the popularity of cloud computing, more and more business are operated in the cloud computing. In this paper, we address the problem of service request scheduling in cloud computing systems. We consider the three-tier cloud structure, which consists of resource providers, service providers and consumers. The service request scheduling strategies in this scenario should satisfy the objectives of the service providers and consumers. We propose a new strategy dynamic priority scheduling algorithm (DPSA) to solve this problem. The algorithm is more efficient and optimal than the FCFS and SPSA.

Published in:

Electronic and Mechanical Engineering and Information Technology (EMEIT), 2011 International Conference on  (Volume:9 )

Date of Conference:

12-14 Aug. 2011