DAG Scheduling Using a Lookahead Variant of the Heterogeneous Earliest Finish Time Algorithm.
Luiz F. BittencourtRizos SakellariouEdmundo R. M. MadeiraPublished in: PDP (2010)
Keyphrases
- computational complexity
- worst case
- cost function
- np hard
- dynamic programming
- times faster
- expectation maximization
- optimal solution
- preprocessing
- k means
- significant improvement
- learning algorithm
- linear programming
- optimization algorithm
- optimal scheduling
- detection algorithm
- theoretical analysis
- probabilistic model
- computational cost
- experimental evaluation