![](https://www.pdfsearch.io/img/07fe8f2ecbce410b290ee5f51edc77f9.jpg) Date: 2017-12-22 08:57:43
| | Fixed-Priority Schedulability of Sporadic Tasks on Uniprocessors is NP-hard Pontus Ekberg and Wang Yi Uppsala University, Sweden Email: {pontus.ekberg | yi}@it.uu.seAdd to Reading ListSource URL: user.it.uu.seDownload Document from Source Website File Size: 282,56 KBShare Document on Facebook
|