Lower-bound complexity algorithm for task scheduling on heterogeneous grid
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21240%2F17%3A00318012" target="_blank" >RIV/68407700:21240/17:00318012 - isvavai.cz</a>
Result on the web
<a href="http://dx.doi.org/10.1007/s00607-017-0558-5" target="_blank" >http://dx.doi.org/10.1007/s00607-017-0558-5</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1007/s00607-017-0558-5" target="_blank" >10.1007/s00607-017-0558-5</a>
Alternative languages
Result language
angličtina
Original language name
Lower-bound complexity algorithm for task scheduling on heterogeneous grid
Original language description
The paper prposes a scheduling algorithm based on list scheduling and duplication-based heuristics BNCP (Best-Node based Critical-Parent).
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
—
Continuities
I - Institucionalni podpora na dlouhodoby koncepcni rozvoj vyzkumne organizace
Others
Publication year
2017
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
Name of the periodical
Computing
ISSN
0010-485X
e-ISSN
1436-5057
Volume of the periodical
99
Issue of the periodical within the volume
11
Country of publishing house
DE - GERMANY
Number of pages
21
Pages from-to
1125-1145
UT code for WoS article
000413026100005
EID of the result in the Scopus database
2-s2.0-85020070826