By Topic

Job Scheduling for Campus-scale Global Computing with Machine Availability 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

3 Author(s)
Guangzhong Sun ; Dept. of Comput. Sci. & Technol., Univ. of Sci. & Technol. of China ; Jiulong Shan ; Guoliang Chen

The rapid improvement of commodity components makes the global computing platform increasingly viable for many applications. This paper studied the problem of job scheduling for campus-scale global computing on theoretical level. Based on system modeling, we first proved the scheduling problem is a NP-hard problem, and then chose the approximation algorithm LS (list scheduling) as a solution. Finally, the theoretical analysis showed that it is a (m+1)-approximation algorithm for our model

Published in:

Computer and Computational Sciences, 2006. IMSCCS '06. First International Multi-Symposiums on  (Volume:1 )

Date of Conference:

20-24 June 2006