{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T04:13:42Z","timestamp":1746159222755,"version":"3.40.4"},"reference-count":0,"publisher":"SAGE Publications","issue":"2","license":[{"start":{"date-parts":[[2011,5,1]],"date-time":"2011-05-01T00:00:00Z","timestamp":1304208000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/journals.sagepub.com\/page\/policies\/text-and-data-mining-license"}],"content-domain":{"domain":["journals.sagepub.com"],"crossmark-restriction":true},"short-container-title":["Journal of Embedded Computing"],"published-print":{"date-parts":[[2011,5]]},"abstract":"<jats:p> This paper studies static-priority preemptive scheduling on a multiprocessor using partitioned scheduling. We propose a new scheduling algorithm and prove that if the proposed algorithm is used and if less than 50% of the capacity is requested then all deadlines are met. It is known that for every static-priority multiprocessor scheduling algorithm, there is a task set that misses a deadline although the requested capacity is arbitrary close to 50%. <\/jats:p>","DOI":"10.3233\/jec-2009-0107","type":"journal-article","created":{"date-parts":[[2025,1,24]],"date-time":"2025-01-24T12:26:12Z","timestamp":1737721572000},"page":"47-54","update-policy":"https:\/\/doi.org\/10.1177\/sage-journals-update-policy","source":"Crossref","is-referenced-by-count":0,"title":["The utilization bound of static-priority preemptive partitioned multiprocessor scheduling is 50%"],"prefix":"10.1177","volume":"4","author":[{"given":"Bj\u00f6rn","family":"Andersson","sequence":"first","affiliation":[{"name":"Department of Computer Engineering, Chalmers University of Technology, SE-412 96 G\u00f6teborg, Sweden"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"179","published-online":{"date-parts":[[2011,5,1]]},"container-title":["Journal of Embedded Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JEC-2009-0107","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/journals.sagepub.com\/doi\/pdf\/10.3233\/JEC-2009-0107","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T17:36:37Z","timestamp":1746120997000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/10.3233\/JEC-2009-0107"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,5]]},"references-count":0,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["10.3233\/JEC-2009-0107"],"URL":"https:\/\/doi.org\/10.3233\/jec-2009-0107","relation":{},"ISSN":["1740-4460","1875-9025"],"issn-type":[{"type":"print","value":"1740-4460"},{"type":"electronic","value":"1875-9025"}],"subject":[],"published":{"date-parts":[[2011,5]]}}}