An optimal algorithm for scheduling soft-aperiodic tasks in fixed-priority preemptive systems.
John P. LehoczkyS. Ramos-ThuelPublished in: RTSS (1992)
Keyphrases
- dynamic programming
- optimal solution
- worst case
- globally optimal
- learning algorithm
- experimental evaluation
- np hard
- scheduling problem
- scheduling policies
- preprocessing
- search space
- high accuracy
- computational complexity
- priority queue
- optimal scheduling
- significant improvement
- scheduling algorithm
- closed form
- matching algorithm
- optimization algorithm
- expectation maximization
- scheduling strategy
- lower bound
- k means
- cost function
- locally optimal
- markov random field
- fixed size
- optimal path
- optimal parameters
- exhaustive search
- times faster
- resource allocation
- detection algorithm
- simulated annealing
- response time
- computational cost
- search algorithm
- objective function