JOURNAL ARTICLE

Multi-core partitioned scheduling for fixed-priority periodic real-time tasks with enhanced RBound

Abstract

This paper presents a new partitioned scheduling approach to schedule fixed-priority periodic real-time tasks on multi-core platforms under Rate Monotonic Scheduling (RMS) policy. We first develop a novel method to scale task periods, as well as execution times, to improve the utilization bound (i.e. RBound [7]). We further apply the task set scaling method and the enhanced utilization bound to multi-core scheduling to improve the system utilization and at the same time guarantees the satisfaction of all timing constraints. We empirically evaluate the proposed techniques and the results show clear evidence of the proposed approach outperforming earlier work existed in the literature.

Keywords:
Computer science Scheduling (production processes) Processor scheduling Scaling Distributed computing Dynamic priority scheduling Schedule Earliest deadline first scheduling Monotonic function Upper and lower bounds Fixed-priority pre-emptive scheduling Deadline-monotonic scheduling Task analysis Real-time computing Rate-monotonic scheduling Task (project management) Parallel computing Mathematical optimization Mathematics

Metrics

6
Cited By
1.66
FWCI (Field Weighted Citation Impact)
24
Refs
0.86
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Real-Time Systems Scheduling
Physical Sciences →  Computer Science →  Hardware and Architecture
Distributed systems and fault tolerance
Physical Sciences →  Computer Science →  Computer Networks and Communications
Parallel Computing and Optimization Techniques
Physical Sciences →  Computer Science →  Hardware and Architecture
© 2026 ScienceGate Book Chapters — All rights reserved.