Cart (Loading....) | Create Account
Close category search window

R-DLS: An Improved DLS Algorithm

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

4 Author(s)
Liu Xiaoqian ; Comput. Sci. & Technol. of USTC, Heifei ; Yang Shoubao ; Wang Shuling ; Xu Jing

As dynamic-level scheduling algorithm does not consider the risk taken by resource nodes and users' demand, it proposes an analytic hierarchy process approach (AHP) based improved DLS algorithm. By such AHP approach, it manages the task provided by users, and obtains the weight value which reflects users' demand. Because the weight value contains the information about deadline, reparation duty and profit of task, it integrates DLS and the weight value to get an improved DLS, called R-DLS which contains the degree of risk taken by resource nodes. Experiments show that R-DLS receives higher average success rate of task execution and profit in one unit of time with task number increasing than DLS.

Published in:

Grid and Cooperative Computing, 2008. GCC '08. Seventh International Conference on

Date of Conference:

24-26 Oct. 2008

Need Help?

IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.