Fixed-Priority Schedulability of Sporadic Tasks on Uniprocessors is NP-Hard | IEEE Conference Publication | IEEE Xplore