Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F61989100%3A27240%2F09%3A00020950" target="_blank" >RIV/61989100:27240/09:00020950 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments

Popis výsledku v původním jazyce

Scheduling is one of the core steps to efficiently exploit the capabilities of heterogeneous distributed computing systems and is an NP-complete problem. Therefore using. meta-heuristic. algorithms is a suitable approach in order to cope with its difficulty. In meta-heuristic algorithms, generating individuals in the initial step has an important effect on the convergence behavior of the algorithm and final solutions. Using some heuristics for generating one or more near-optimal individuals in the initial step can improve the final solutions obtained by meta-heuristic algorithms. Different criteria can be used for evaluating the efficiency of scheduling algorithms, the most important of which are makespan and flowtime. In this paper we propose an efficient heuristic method and then we will compare with five popular heuristics for minimizing makespan and flowtime in heterogeneous distributed computing systems.

Název v anglickém jazyce

Comparison of Heuristics for Scheduling Independent Tasks on Heterogeneous Distributed Environments

Popis výsledku anglicky

Scheduling is one of the core steps to efficiently exploit the capabilities of heterogeneous distributed computing systems and is an NP-complete problem. Therefore using. meta-heuristic. algorithms is a suitable approach in order to cope with its difficulty. In meta-heuristic algorithms, generating individuals in the initial step has an important effect on the convergence behavior of the algorithm and final solutions. Using some heuristics for generating one or more near-optimal individuals in the initial step can improve the final solutions obtained by meta-heuristic algorithms. Different criteria can be used for evaluating the efficiency of scheduling algorithms, the most important of which are makespan and flowtime. In this paper we propose an efficient heuristic method and then we will compare with five popular heuristics for minimizing makespan and flowtime in heterogeneous distributed computing systems.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GA102%2F09%2F1494" target="_blank" >GA102/09/1494: Nové metody přenosu dat založené na turbo kódech</a><br>

Návaznosti

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Rok uplatnění

2009

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název statě ve sborníku

INTERNATIONAL JOINT CONFERENCE ON COMPUTATIONAL SCIENCES AND OPTIMIZATION

ISBN

978-0-7695-3605-7

ISSN

—

e-ISSN

—

Počet stran výsledku

5

Strana od-do

—

Název nakladatele

IEEE Computer Society

Místo vydání

Los Alamitos, California

Místo konání akce

Sanya, CHINA

Datum konání akce

24. 4. 2009

Typ akce podle státní příslušnosti

WRD - Celosvětová akce

Kód UT WoS článku

000273548200002