A Polynomial-Time Algorithm for Computing Response Time Bounds in Static Priority Scheduling Employing Multi-linear Workload Bounds.
Steffen SteinMatthias IversJonas DiemerRolf ErnstPublished in: ECRTS (2010)
Keyphrases
- worst case
- response time
- lower and upper bounds
- k means
- computational complexity
- upper bound
- error bounds
- learning algorithm
- lower bound
- confidence bounds
- expectation maximization
- priority scheduling
- upper and lower bounds
- dynamic programming
- np hard
- distributed systems
- average case
- mistake bound
- objective function
- error tolerance
- search space