Harmonic-Aware Multi-Core Scheduling for Fixed-Priority Real-Time Systems

Abstract

This paper presents a new semipartitioned approach to schedule sporadic tasks on multicore platforms based on the Rate Monotonic Scheduling policy. To improve the schedulability, our approach exploits the fact that the utilization bound of a task set increases as task periods become closer to harmonic on single processor platforms. The challenge for our approach, however, is how to take advantage of this fact to assign and split appropriate tasks on different processors in the semipartitioned approach, and how to guarantee the schedulability of real-time tasks. We formally prove that our scheduling approach can successfully schedule any task set with a system utilization bounded by Liu&Layland's bound for $N$ tasks, that is, $N(2^{1/N} - 1)$ . Our extensive experimental results demonstrate that the proposed algorithm can significantly improve the scheduling performance compared with the previous work.