Worst Case Behavior of List Algorithms for Dynamic Scheduling of Non-unit Execution Time Tasks with Arbitrary Precedence Constrains
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Fundamentals Vol.E91-A No.8 pp.2277-2280
- Publication Date
- 2008/08/01
- Publicized
- Online ISSN
- 1745-1337
- DOI
- 10.1093/ietfec/e91-a.8.2277
- Type of Manuscript
- LETTER
- Category
- Concurrent Systems
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
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.
Cite this
Copy
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
Copy
@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},}
Copy
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 -
English
