Andersson, Björn2014-02-182014-02-182008978-3-540-92221-60302-9743http://hdl.handle.net/10400.22/3938Consider the problem of scheduling real-time tasks on a multiprocessor with the goal of meeting deadlines. Tasks arrive sporadically and have implicit deadlines, that is, the deadline of a task is equal to its minimum inter-arrival time. Consider this problem to be solved with global static-priority scheduling. We present a priority-assignment scheme with the property that if at most 38% of the processing capacity is requested then all deadlines are met.engbook part10.1007/978-3-540-92221-6_7