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

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• （社）電子情報通信学会の論文
• 2008-08-01

著者

• Ecker Klaus

  Ohio University

• TCHERNYKH Andrei

  CICESE Research Center

関連論文

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

スポンサーリンク