loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
2006 First International Multi-Symposiums on Computer and Computational Sciences
Job Scheduling for Campus-scale Global Computing with Machine Availability Constraints
Hangzhou, Zhejiang, China
June 20-June 24
ISBN: 0-7695-2581-4
ASCII Text
x 
 
Guangzhong Sun, Jiulong Shan, Guoliang Chen, "Job Scheduling for Campus-scale Global Computing with Machine Availability Constraints," Computer and Computational Sciences, International Multi-Symposiums on, vol. 1, pp. 385-388, 2006 First International Multi-Symposiums on Computer and Computational Sciences, 2006.
 
 
BibTex
x
 
@article{ 10.1109/IMSCCS.2006.82,
author = {Guangzhong Sun and Jiulong Shan and Guoliang Chen},
title = {Job Scheduling for Campus-scale Global Computing with Machine Availability Constraints},
journal ={Computer and Computational Sciences, International Multi-Symposiums on},
volume = {1},
year = {2006},
isbn = {0-7695-2581-4},
pages = {385-388},
doi = {http://doi.ieeecomputersociety.org/10.1109/IMSCCS.2006.82},
publisher = {IEEE Computer Society},
address = {Los Alamitos, CA, USA},
}
 
 
RefWorks Procite/RefMan/Endnote
x 
 
TY - CONF
JO - Computer and Computational Sciences, International Multi-Symposiums on
TI - Job Scheduling for Campus-scale Global Computing with Machine Availability Constraints
SN - 0-7695-2581-4
SP385
EP388
A1 - Guangzhong Sun,
A1 - Jiulong Shan,
A1 - Guoliang Chen,
PY - 2006
KW - null
VL - 1
JA - Computer and Computational Sciences, International Multi-Symposiums on
ER -
 
Guangzhong Sun, University of Science and Technology of China
Jiulong Shan, University of Science and Technology of China
Guoliang Chen, University of Science and Technology of China
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.
Citation:
Guangzhong Sun, Jiulong Shan, Guoliang Chen, "Job Scheduling for Campus-scale Global Computing with Machine Availability Constraints," imsccs, vol. 1, pp.385-388, 2006 First International Multi-Symposiums on Computer and Computational Sciences, 2006
Usage of this product signifies your acceptance of the Terms of Use.