Detailed Information on Publication Record
2007
Local Search for Grid Scheduling
KLUSÁČEK, Dalibor, Luděk MATYSKA, Hana RUDOVÁ, Ranieri BARAGLIA, Gabriele CAPANNINI et. al.Basic information
Original name
Local Search for Grid Scheduling
Name (in English)
Lokální prohledávání pro rozvrhování na Gridech
Authors
KLUSÁČEK, Dalibor (203 Czech Republic, guarantor, belonging to the institution), Luděk MATYSKA (203 Czech Republic, belonging to the institution), Hana RUDOVÁ (203 Czech Republic, belonging to the institution), Ranieri BARAGLIA (380 Italy) and Gabriele CAPANNINI (380 Italy)
Edition
Doctoral Consortium at the International Conference on Automated Planning and Scheduling, 2007
Other information
Language
Czech
Type of outcome
Konferenční abstrakt
Field of Study
10201 Computer sciences, information science, bioinformatics
Country of publisher
Czech Republic
Confidentiality degree
není předmětem státního či obchodního tajemství
References:
RIV identification code
RIV/00216224:14330/07:00041549
Organization unit
Faculty of Informatics
Keywords in English
plánování; Grid; lokální prohledávání; Tabu prohledávání; dynamické rozvrhování
Tags
International impact, Reviewed
Změněno: 2/5/2011 08:35, doc. Mgr. Hana Rudová, Ph.D.
V originále
Práce studuje algoritmy lokálního prohledávání jako novou techniku pro řešení dynamických plánovacích problémů na Gridech.
In English
This work introduces local search based algorithms as a new technique for the Grid scheduling problem. Specific algorithms based on dispatching rules and local search were proposed and implemented to generate schedule for dynamically arriving jobs. Algorithm performance was compared with typical queue-based algorithms on the basis of objective function optimisation and time required to generate scheduling solutions. Grid environment was simulated by Alea Simulator which is based on modified and extended GridSim toolkit. The results showed that local search based algorithms may be promising technique with good overall performance, providing better results than queue-based approaches while still fast enough to provide solution in a reasonable time.
Links
GA201/07/0205, research and development project |
| ||
MSM0021622419, plan (intention) |
|