A linear-time online task assignment scheme for multiprocessor systems
Almut Burchard, Yingfeng Oh, Jörg Liebeherr, Sang Hyuk Son · 2002
A new online task assignment scheme is presented for multiprocessor systems where individual processors execute the rate-monotonic scheduling algorithm. The computational complexity of the task assignment scheme grows linearly with the number of tasks, and its performance is shown to be significantly better than previously existing schemes. The superiority of the assignment scheme is achieved by a new schedulability condition derived for the rate-monotonic scheduling discipline.>