A 3/2-Approximation Algorithm for Rate-Monotonic Multiprocessor Scheduling of Implicit-Deadline Tasks.
Andreas KarrenbauerThomas RothvoßPublished in: WAOA (2010)
Keyphrases
- approximation ratio
- objective function
- detection algorithm
- dynamic programming
- significant improvement
- optimal solution
- improved algorithm
- computational complexity
- k means
- np hard
- search algorithm
- experimental evaluation
- computational cost
- recognition algorithm
- optimization algorithm
- search space
- approximation algorithms
- times faster
- ant colony optimization
- theoretical analysis
- computationally efficient
- expectation maximization
- worst case
- clustering method
- monte carlo
- path planning
- particle swarm optimization
- preprocessing
- single pass
- learning algorithm