Fixed-Priority Schedulability of Sporadic Tasks on Uniprocessors is NP-hard Pontus Ekberg and Wang Yi Uppsala University, Sweden Email: {pontus.ekberg | yi - Fixed - Document - PDFSEARCH.IO

First Page	Meta Content
	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.se Add to Reading List Document Date: 2017-12-22 08:57:43 Open Document File Size: 282,56 KB Share Result on Facebook

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 List