By Topic

An Optimal Algorithm for Scheduling Tasks within Deadline and Budget Constraints

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

5 Author(s)
Hu Song ; Sch. of Comput. Sci. & Technol., Univ. of Sci. & Technol. of China, Hefei, China ; Shoubao Yang ; Bin Wu ; Xiaoqian Liu
more authors

In the market-oriented grid environment, clients make use of grid computing resources to execute many independent tasks. According to the urgency of tasks and deficiency of client' budget, not all the tasks could be completed as demanded. To maximize the number of completed tasks, a linear programming model based scheduling algorithm (LMBS) is proposed in this paper. Comparing with other algorithms, experiment results show that performance of LMBS is much better obviously.

Published in:

INC, IMS and IDC, 2009. NCM '09. Fifth International Joint Conference on

Date of Conference:

25-27 Aug. 2009