Worst Case Behavior of List Algorithms for Dynamic Scheduling of Non-unit Execution Time Tasks with Arbitrary Precedence Constrains

Andrei TCHERNYKH; Klaus ECKER

doi:10.1093/ietfec/e91-a.8.2277

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences

Online ISSN : 1745-1337
Print ISSN : 0916-8508

Regular Section

Worst Case Behavior of List Algorithms for Dynamic Scheduling of Non-unit Execution Time Tasks with Arbitrary Precedence Constrains

Andrei TCHERNYKH, Klaus ECKER

Author information

Keywords: list scheduling, worst case analysis, on-line scheduling

JOURNAL RESTRICTED ACCESS

2008 Volume E91.A Issue 8 Pages 2277-2280

DOI https://doi.org/10.1093/ietfec/e91-a.8.2277

Details

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 comnared with known results.

Content from these authors

Favorites & Alerts

Corresponding author

Register with J-STAGE for free!