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

Authors:
Andrei Tchernykh;Klaus Ecker
Affiliations:
-;-
Venue:
IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Year:
2008

Citing 9
Cited 0

Scheduling tree-structured tasks with restricted execution times

Information Processing Letters
Complexity of scheduling parallel task systems

SIAM Journal on Discrete Mathematics
Scheduling chain-structured tasks to minimize makespan and mean flow time

Information and Computation
A comparison of list schedules for parallel processing systems

Communications of the ACM
Scheduling and Automatic Parallelization

Scheduling and Automatic Parallelization
On-line Scheduling for Jobs with Arbitrary Release Times

Computing
Iterative list scheduling for heterogeneous computing

Journal of Parallel and Distributed Computing
A Note on the Complexity of Scheduling for Precedence Constrained Messages in Distributed Systems

IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences
Scheduling parallel jobs to minimize the makespan

Journal of Scheduling

Quantified Score

Hi-index	0.00

Visualization

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.