The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
Propriedades de desempenho de algoritmos de escalonamento de lista sob várias suposições dinâmicas são analisadas. O foco está nos limites para agendar gráficos acíclicos direcionados com restrições de precedência arbitrárias e tempos de processamento de tarefas arbitrários, sujeitos à minimização do makepan. Novos limites de desempenho são derivados e comparados com resultados conhecidos.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copiar
Andrei TCHERNYKH, Klaus ECKER, "Worst Case Behavior of List Algorithms for Dynamic Scheduling of Non-unit Execution Time Tasks with Arbitrary Precedence Constrains" in IEICE TRANSACTIONS on Fundamentals,
vol. E91-A, no. 8, pp. 2277-2280, August 2008, doi: 10.1093/ietfec/e91-a.8.2277.
Abstract: Performance properties of list scheduling algorithms under various dynamic assumptions are analyzed. The focus is on bounds for scheduling directed acyclic graphs with arbitrary precedence constrains and arbitrary task processing times subject to minimizing the makespan. New performance bounds are derived and compared with known results.
URL: https://global.ieice.org/en_transactions/fundamentals/10.1093/ietfec/e91-a.8.2277/_p
Copiar
@ARTICLE{e91-a_8_2277,
author={Andrei TCHERNYKH, Klaus ECKER, },
journal={IEICE TRANSACTIONS on Fundamentals},
title={Worst Case Behavior of List Algorithms for Dynamic Scheduling of Non-unit Execution Time Tasks with Arbitrary Precedence Constrains},
year={2008},
volume={E91-A},
number={8},
pages={2277-2280},
abstract={Performance properties of list scheduling algorithms under various dynamic assumptions are analyzed. The focus is on bounds for scheduling directed acyclic graphs with arbitrary precedence constrains and arbitrary task processing times subject to minimizing the makespan. New performance bounds are derived and compared with known results.},
keywords={},
doi={10.1093/ietfec/e91-a.8.2277},
ISSN={1745-1337},
month={August},}
Copiar
TY - JOUR
TI - Worst Case Behavior of List Algorithms for Dynamic Scheduling of Non-unit Execution Time Tasks with Arbitrary Precedence Constrains
T2 - IEICE TRANSACTIONS on Fundamentals
SP - 2277
EP - 2280
AU - Andrei TCHERNYKH
AU - Klaus ECKER
PY - 2008
DO - 10.1093/ietfec/e91-a.8.2277
JO - IEICE TRANSACTIONS on Fundamentals
SN - 1745-1337
VL - E91-A
IS - 8
JA - IEICE TRANSACTIONS on Fundamentals
Y1 - August 2008
AB - Performance properties of list scheduling algorithms under various dynamic assumptions are analyzed. The focus is on bounds for scheduling directed acyclic graphs with arbitrary precedence constrains and arbitrary task processing times subject to minimizing the makespan. New performance bounds are derived and compared with known results.
ER -