loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
International Parallel and Distributed Processing Symposium (IPDPS'03)
Sub Optimal Scheduling in a Grid Using Genetic Algorithms
Nice, France
April 22-April 26
ISBN: 0-7695-1926-1
The computing GRID infrastructure could benefit of techniques that can improve the overall throughput of the system. It is possible that job submission will include different ontology in resource requests due to the generality of the GRID infrastructure. Such flexible resource request could offer the opportunity to optimize several parameter, from network load to job costs in relation to due time, more generally the quality of services. We present the result of the simulation of GRID jobs allocation. The search strategy for this input case do not converge to the optimal case inside the limited number of trial performed, in contrast with previous work on up to 24 jobs. The benefits of the usage of the Genetic Algorithms to improve the quality of the scheduling is discussed. The simulation has been obtained using a sw environment GGAS suitable to study the scheduling of jobs in a distributed group of parallel machines. The result of this paper suggest the usage of local search strategy to improve the convergence.
Citation:
Vincenzo Di Martino, "Sub Optimal Scheduling in a Grid Using Genetic Algorithms," ipdps, pp.148a, International Parallel and Distributed Processing Symposium (IPDPS'03), 2003
Usage of this product signifies your acceptance of the Terms of Use.