An effective approximation algorithm for the Malleable Parallel Task Scheduling problem.
Liya FanFa ZhangGongming WangZhiyong LiuPublished in: J. Parallel Distributed Comput. (2012)
Keyphrases
- scheduling problem
- np hard
- computationally efficient
- dynamic programming
- significant improvement
- cost function
- theoretical analysis
- learning algorithm
- detection algorithm
- high accuracy
- computational cost
- experimental evaluation
- objective function
- optimal solution
- recognition algorithm
- parallel implementation
- computational complexity
- error bounds
- similarity measure
- matching algorithm
- branch and bound algorithm
- parallel processing
- times faster
- parallel machines
- parallel genetic algorithm
- expectation maximization
- particle swarm optimization
- worst case
- probabilistic model
- k means
- preprocessing
- image sequences
- decision trees