Static-Priority Real-Time Scheduling: Response Time Computation Is NP-Hard.
Friedrich EisenbrandThomas RothvoßPublished in: RTSS (2008)
Keyphrases
- response time
- np hard
- higher priority
- scheduling algorithm
- optimal solution
- scheduling problem
- worst case
- query execution
- special case
- storage space
- prefetching
- closely related
- quality of service
- lower bound
- computational complexity
- efficient computation
- network latency
- disk access
- routing decisions
- energy efficiency
- approximation algorithms
- np complete
- linear programming
- sensor networks
- information retrieval
- data sets