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

First Page		Document Content
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.se Add to Reading List Source URL: user.it.uu.se Download Document from Source Website File Size: 282,56 KB Share Document on Facebook