Překonání neurčitosti na Gridech pomocí událostmi řízeného plánování

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F00216224%3A14220%2F08%3A00025036" target="_blank" >RIV/00216224:14220/08:00025036 - isvavai.cz</a>

Výsledek na webu

—

DOI - Digital Object Identifier

—

Jazyk výsledku

angličtina

Název v původním jazyce

Dealing with uncertainties in Grids through the event-based scheduling approach

Popis výsledku v původním jazyce

This work describes the application of the schedule-based approach when dealing with the Grid scheduling problem. We present the advantages as well as the common problems related to this approach. In contrast to the classical queue-based approach, schedule-based approach is much more influenced by the natural dynamics and the uncertainty present in the Grid. Therefore, we propose some general techniques to overcome these problems while keeping the benefits of the schedule-based approach. These techniques use event-based scheduling approach which keeps the schedule up-to-date over the time according to the events appearing due to the dynamically changing state of the Grid. This approach uses only limited re-scheduling keeping the algorithm's runtime reasonable while still preserving the benefits of the general schedule-based approach as is demonstrated in the experimental evaluation.

Název v anglickém jazyce

Dealing with uncertainties in Grids through the event-based scheduling approach

Popis výsledku anglicky

This work describes the application of the schedule-based approach when dealing with the Grid scheduling problem. We present the advantages as well as the common problems related to this approach. In contrast to the classical queue-based approach, schedule-based approach is much more influenced by the natural dynamics and the uncertainty present in the Grid. Therefore, we propose some general techniques to overcome these problems while keeping the benefits of the schedule-based approach. These techniques use event-based scheduling approach which keeps the schedule up-to-date over the time according to the events appearing due to the dynamically changing state of the Grid. This approach uses only limited re-scheduling keeping the algorithm's runtime reasonable while still preserving the benefits of the general schedule-based approach as is demonstrated in the experimental evaluation.

Druh

D - Stať ve sborníku

CEP obor

IN - Informatika

OECD FORD obor

—

Projekt

<a href="/cs/project/GA201%2F07%2F0205" target="_blank" >GA201/07/0205: Dynamické aspekty rozvrhování</a><br>

Návaznosti

Z - Vyzkumny zamer (s odkazem do CEZ)

Rok uplatnění

2008

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

Fourth Doctoral Workshop on Mathematical and Engineering Methods in Computer Science (MEMICS 2008)

ISBN

978-80-7355-082-0

ISSN

—

e-ISSN

—

Počet stran výsledku

8

Strana od-do

—

Název nakladatele

Ing. Zdeněk Novotný CSc., Ondráčkova 105, 628 00 Brno

Místo vydání

Brno

Místo konání akce

Znojmo

Datum konání akce

14. 11. 2008

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

WRD - Celosvětová akce

Kód UT WoS článku

—