Login / Signup

A High Performance, Low Complexity Algorithm for Compile-Time Job Scheduling in Homogeneous Computing Environments.

Tarek HagrasJan Janecek
Published in: ICPP Workshops (2003)
Keyphrases
  • low complexity
  • computational complexity
  • computing environments
  • optimal solution
  • dynamic programming
  • worst case
  • lower complexity
  • np hard
  • job scheduling
  • multi agent
  • wireless networks
  • mobile agents