Login / Signup

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

Andrei TchernykhKlaus Ecker
Published in: IEICE Trans. Fundam. Electron. Commun. Comput. Sci. (2008)
Keyphrases
  • worst case
  • dynamic scheduling
  • np hard
  • lower bound
  • end users
  • average case
  • real time
  • upper bound