Fixed-Priority Schedulability of Sporadic Tasks on Uniprocessors is NP-Hard.
Pontus EkbergWang YiPublished in: RTSS (2017)
Keyphrases
- np hard
- higher priority
- computational complexity
- scheduling problem
- optimal solution
- data mining
- priority scheduling
- high confidence
- integer programming
- multi task
- database
- special case
- case study
- worst case
- np complete
- closely related
- decision problems
- approximation algorithms
- search engine
- multiple tasks
- np hardness
- artificial intelligence