Comparison of Multi-Criteria Scheduling Techniques

KLUSÁČEK, Dalibor, Hana RUDOVÁ, Ranieri BARAGLIA, Marco PASQUALI and Gabriele CAPANNI. Comparison of Multi-Criteria Scheduling Techniques. In Grid Computing Achievements and Prospects. Heidelberg: Springer, 2008, p. 173-184. ISBN 978-0-387-09456-4.

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

Heidelberg, Grid Computing Achievements and Prospects, p. 173-184, 12 pp. 2008

Publisher

Springer

---

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:00024727

Organization unit

Faculty of Informatics

ISBN

978-0-387-09456-4

UT WoS

000258329500015

Keywords in English

Grid; Scheduling; Dispatching Rule; Local Search; Backfilling

Tags

Backfilling, Dispatching Rule, GRID, Local Search, scheduling

Tags

International impact, Reviewed

---

Abstract

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. 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	Name: Dynamické aspekty rozvrhování Investor: Czech Science Foundation, Dynamic Aspects of Scheduling
MSM0021622419, plan (intention)	Name: Vysoce paralelní a distribuované výpočetní systémy Investor: Ministry of Education, Youth and Sports of the CR, Highly Parallel and Distributed Computing Systems