By Topic

Budget constrained optimal time scheduling algorithm in grid

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

4 Author(s)
Lv Yi ; Communication and Information Engineering Institute, Chongqing University of Posts and Telecommunications, Chongqing 400065, China ; Liu Chuan ; Huang Sheng ; Jiang Qing

Tasks' smallest completion time is a fundamental goal of the grid scheduling, however, the completion time of tasks and cost are often anti-correlated. In this paper, A budget constrained optimal time scheduling on the grid computing platforms is discussed, where resources have different speeds of computation and prices. The task scheduling problem is converted into a linear programming problem. Each resource gains the optimal execution time and the smallest completion time of the task were obtained, under the condition of the budget constraint, using of the simplex algorithm to obtain the optimal solution. The simulation results show that the performance of the algorithm is superior to other similar algorithms.

Published in:

Broadband Network & Multimedia Technology, 2009. IC-BNMT '09. 2nd IEEE International Conference on

Date of Conference:

18-20 Oct. 2009