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

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 harmon...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on parallel and distributed systems 2014-06, Vol.25 (6), p.1476-1488
Main Authors: Fan, Ming, Quan, Gang
Format: Article
Language:English
Subjects:
Algorithms
fixed-priority
Harmonic
Harmonic analysis
Indexes
Job shop scheduling
Microprocessors
Platforms
rate monotonic scheduling (RMS)
Real time
real-time semipartitioned scheduling
Real-time systems
Schedules
Scheduling
Scheduling algorithms
Tasks
Utilization
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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.
ISSN:1045-9219
1558-2183
DOI:10.1109/TPDS.2013.71