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 TCHERNYKHKlaus ECKER
Author information
JOURNALS RESTRICTED ACCESS

2008 Volume E91.A Issue 8 Pages 2277-2280

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.

Information related to the author
© 2008 The Institute of Electronics, Information and Communication Engineers
Previous article
feedback
Top