A Near-Optimal Algorithm for Scheduling Soft-Aperiodic Requests in Dynamic Priority Systems.
Hyungill KimSungyoung LeeJongwon LeeDougyoung SuhPublished in: RTS (1996)
Keyphrases
- optimal solution
- computational cost
- experimental evaluation
- np hard
- high accuracy
- objective function
- detection algorithm
- theoretical analysis
- linear programming
- significant improvement
- learning algorithm
- scheduling policies
- resource allocation
- classification algorithm
- optimization algorithm
- simulated annealing
- probabilistic model
- k means
- search space
- expert systems
- preprocessing
- similarity measure
- cost function
- input data
- expectation maximization
- computationally efficient
- lower bound
- matching algorithm
- times faster
- neural network
- optimal scheduling