Comparison of Multi-Criteria Scheduling Techniques
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14330%2F08%3A00024727" target="_blank" >RIV/00216224:14330/08:00024727 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Comparison of Multi-Criteria Scheduling Techniques
Original language description
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 basedon 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 meetthe 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
Czech name
Porovnání plánovacích technik pro více objektivních kritérií
Czech description
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.
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/GA201%2F07%2F0205" target="_blank" >GA201/07/0205: Dynamic aspects of scheduling</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)
Others
Publication year
2008
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Article name in the collection
Grid Computing Achievements and Prospects
ISBN
978-0-387-09456-4
ISSN
—
e-ISSN
—
Number of pages
12
Pages from-to
—
Publisher name
Springer
Place of publication
Heidelberg
Event location
Hersonissos, Crete, Greece
Event date
Jan 1, 2008
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
000258329500015