Harmonic-fit partitioned scheduling for fixed-priority real-time tasks on the multiprocessor platform Conference

Fan, M, Quan, G. (2011). Harmonic-fit partitioned scheduling for fixed-priority real-time tasks on the multiprocessor platform . 27-32. 10.1109/EUC.2011.41

cited authors

  • Fan, M; Quan, G

authors

abstract

  • One common approach for partitioned multiprocessor scheduling problem is to transform this problem into a traditional bin-packing problem, with the utilization of a task being the "size" of the object and the utilization bound of a processor being the "capacity" of the bin. However, this approach ignores the fact that some implicit relations among tasks may significantly affect the feasibility of the tasks allocated to a processor. In this paper, we present a novel multiprocessor partitioned scheduling algorithm for fixed-priority sporadic real-time tasks based on the Rate Monotonic Scheduling (RMS) policy. Our approach takes advantage of the fact that harmonic tasks can achieve a much higher processor utilization than that defined by a utilization bound. As demonstrated in our experiment results, when taking the task period relationship into consideration, our algorithm can achieve a significant improvement over previous work. © 2011 IEEE.

publication date

  • December 1, 2011

Digital Object Identifier (DOI)

International Standard Book Number (ISBN) 13

start page

  • 27

end page

  • 32