Andersson, Björn2014-02-212014-02-2120061740-44601875-9025http://hdl.handle.net/10400.22/4014This 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%.engReal-time schedulingPartitioningBin-packing algorithmsStatic-priority schedulingPreemptive schedulingMultiprocessorsjournal article10.3233/JEC-2009-0107