Dynamic Local Scheduling of Multiple DAGs in Distributed Heterogeneous Systems
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00231038" target="_blank" >RIV/68407700:21230/15:00231038 - isvavai.cz</a>
Result on the web
<a href="http://www.cs.vsb.cz/dateso/" target="_blank" >http://www.cs.vsb.cz/dateso/</a>
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Dynamic Local Scheduling of Multiple DAGs in Distributed Heterogeneous Systems
Original language description
Heterogeneous computational platform offers a great ratio between the computational power and the price of the system. Static and dynamic scheduling methods offer a good way of how to use these systems efficiently and therefore many algorithms were proposed in the literature in past years. The aim of this article is to present the dynamic (on-line) algorithm which schedules multiple DAG applications without any central node and the schedule is created only with the knowledge of node?s network neigbourhood. The algorithm achieves great level of fairness for more DAGs and total computation time is close to the standard and well known competitors.
Czech name
—
Czech description
—
Classification
Type
D - Article in proceedings
CEP classification
IN - Informatics
OECD FORD branch
—
Result continuities
Project
—
Continuities
S - Specificky vyzkum na vysokych skolach
Others
Publication year
2015
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
DATESO 2015
ISBN
—
ISSN
1613-0073
e-ISSN
—
Number of pages
12
Pages from-to
1-12
Publisher name
MATFYZPRESS, vydavatelství Matematicko-fyzikální fakulty UK
Place of publication
Praha
Event location
Nepřívěc u Sobotky, Jičín
Event date
Apr 14, 2015
Type of event by nationality
CST - Celostátní akce
UT code for WoS article
—