An Optimal Algorithm for Scheduling Soft Aperiodic Tasks in Dynamic-Priority Preemptive Systems.
Ismael RipollAlfons CrespoAna García-FornesPublished in: IEEE Trans. Software Eng. (1997)
Keyphrases
- worst case
- dynamic programming
- scheduling problem
- learning algorithm
- optimal solution
- scheduling algorithm
- np hard
- cost function
- experimental evaluation
- k means
- optimal path
- optimal scheduling
- times faster
- path planning
- globally optimal
- detection algorithm
- linear programming
- high accuracy
- significant improvement
- distributed systems
- simulated annealing
- optimization algorithm
- objective function
- scheduling policies
- scheduling strategy
- probabilistic model
- computational complexity
- exhaustive search
- feature selection
- competitive ratio
- priority queue
- neural network