A Near Lower-Bound Complexity Algorithm for Compile-Time Task-Scheduling in Heterogeneous Computing Systems.
Tarek HagrasJan JanecekPublished in: ISPDC/HeteroPar (2004)
Keyphrases
- computing systems
- worst case
- lower bound
- np hard
- space complexity
- optimal solution
- computational complexity
- learning algorithm
- upper bound
- query processing
- objective function
- open source
- computer systems
- branch and bound
- branch and bound algorithm
- database systems
- real world
- parallel implementation
- image processing algorithms