R-DLS: An Improved DLS Algorithm

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.