Fixed-Priority Schedulability of Sporadic Tasks on Uniprocessors is NP-Hard.

Pontus Ekberg, Wang Yi

Browse the full RTSS paper archive.