Detailed Information on Publication Record
2008
Comparison of Multi-Criteria Scheduling Techniques
KLUSÁČEK, Dalibor, Hana RUDOVÁ, Ranieri BARAGLIA, Marco PASQUALI, Gabriele CAPANNI et. al.Basic information
Original name
Comparison of Multi-Criteria Scheduling Techniques
Name in Czech
Porovnání plánovacích technik pro více objektivních kritérií
Authors
KLUSÁČEK, Dalibor (203 Czech Republic, guarantor), Hana RUDOVÁ (203 Czech Republic), Ranieri BARAGLIA (380 Italy), Marco PASQUALI (380 Italy) and Gabriele CAPANNI (380 Italy)
Edition
Heraklion, Integrated Research in Grid Computing, CoreGRID Integration Workshop, p. 153-164, 12 pp. 2008
Publisher
Crete University Press
Other information
Language
English
Type of outcome
Stať ve sborníku
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í
RIV identification code
RIV/00216224:14330/08:00024689
Organization unit
Faculty of Informatics
ISBN
978-960-524-260-2
UT WoS
000258329500015
Keywords in English
Grid; Scheduling; Dispatching Rule; Local Search; Backfilling
Tags
International impact, Reviewed
Změněno: 29/6/2008 23:01, doc. Mgr. Hana Rudová, Ph.D.
V originále
We propose a novel schedule-based approach for scheduling a continuous stream of batch jobs on the machines of a computational Grid. Our new solutions represented by dispatching rule Earliest Gap-Earliest Deadline First (EG-EDF) and Tabu search are based on the idea of filling gaps in the existing schedule. EG-EDF rule is able to build the schedule for all jobs incrementally by applying technique which fills earliest existing gaps in the schedule with newly arriving jobs. If no gap for a coming job is available EG-EDF rule uses Earliest Deadline First (EDF) strategy for including new job into the existing schedule. Such schedule is then optimized using the Tabu search algorithm moving jobs into earliest gaps again. Scheduling choices are taken to meet the Quality of Service (QoS) requested by the submitted jobs, and to optimize the usage of hardware resources. Proposed solution is compared with FCFS, EASY backfilling, and Flexible backfilling. Experiments shows that EG-EDF rule is able to compute good assignments, often with shorter algorithm runtime w.r.t. the other queue-based algorithms. Further Tabu search optimization results in higher QoS and machine usage.
In Czech
Publikace prezentuje nové plánovací algoritmy založené na tvorbě rozvrhu pro účely efektivního plánování na výpočetním Gridu. Algoritmy jsou založeny na řídících pravidlech a Tabu prohledávání a v prezentovaných experimentech dosahují výrazně lepších výsledků než standardní algoritmy založené na frontách.
Links
| GA201/07/0205, research and development project |
| ||
| MSM0021622419, plan (intention) |
|