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
Hill Climbing-Based Decentralized Job Scheduling on Computational Grids
Hangzhou, Zhejiang, China
June 20-June 24
ISBN: 0-7695-2581-4
ASCII Text
x 
 
Qingjiang Wang, Yun Gao, Peishun Liu, "Hill Climbing-Based Decentralized Job Scheduling on Computational Grids," Computer and Computational Sciences, International Multi-Symposiums on, vol. 1, pp. 705-708, 2006 First International Multi-Symposiums on Computer and Computational Sciences, 2006.
 
 
BibTex
x
 
@article{ 10.1109/IMSCCS.2006.75,
author = {Qingjiang Wang and Yun Gao and Peishun Liu},
title = {Hill Climbing-Based Decentralized Job Scheduling on Computational Grids},
journal ={Computer and Computational Sciences, International Multi-Symposiums on},
volume = {1},
year = {2006},
isbn = {0-7695-2581-4},
pages = {705-708},
doi = {http://doi.ieeecomputersociety.org/10.1109/IMSCCS.2006.75},
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 - Hill Climbing-Based Decentralized Job Scheduling on Computational Grids
SN - 0-7695-2581-4
SP705
EP708
A1 - Qingjiang Wang,
A1 - Yun Gao,
A1 - Peishun Liu,
PY - 2006
VL - 1
JA - Computer and Computational Sciences, International Multi-Symposiums on
ER -
 
Qingjiang Wang, Ocean University of China, China
Yun Gao, Ocean University of China, China
Peishun Liu, Ocean University of China, China
De-centralized job scheduling is implemented by job migrations between neighboring grid nodes. To optimize node selection of a new-submitted job, the job may be migrated many times. Here, the hill climbing method is used to determine the migration route. Experiments simulate de-centralized job scheduling, including node adjacencies, local scheduling of grid nodes, and grid workload. Compared with k-distributed and auction methods, hill climbing-based scheduling usually can enhance processor utilization, and can reduce bounded slowdown.
Citation:
Qingjiang Wang, Yun Gao, Peishun Liu, "Hill Climbing-Based Decentralized Job Scheduling on Computational Grids," imsccs, vol. 1, pp.705-708, 2006 First International Multi-Symposiums on Computer and Computational Sciences, 2006
Usage of this product signifies your acceptance of the Terms of Use.