Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Distance-Constrained Scheduling and Its Applications to Real-Time Systems
IEEE Transactions on Computers
A better polynomial-time schedulability test for real-time fixed-priority scheduling algorithms
RTSS '97 Proceedings of the 18th IEEE Real-Time Systems Symposium
Static-Priority Scheduling on Multiprocessors
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
An EDF-based Scheduling Algorithm for Multiprocessor Soft Real-Time Systems
ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
Real-Time Scheduling with Task Splitting on Multiprocessors
RTCSA '07 Proceedings of the 13th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
Scheduling Arbitrary-Deadline Sporadic Task Systems on Multiprocessors
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
Global Static-Priority Preemptive Multiprocessor Scheduling with Utilization Bound 38%
OPODIS '08 Proceedings of the 12th International Conference on Principles of Distributed Systems
Semi-partitioned Fixed-Priority Scheduling on Multiprocessors
RTAS '09 Proceedings of the 2009 15th IEEE Symposium on Real-Time and Embedded Technology and Applications
Rock: A High-Performance Sparc CMT Processor
IEEE Micro
Partitioned Fixed-Priority Preemptive Scheduling for Multi-core Processors
ECRTS '09 Proceedings of the 2009 21st Euromicro Conference on Real-Time Systems
Fixed-Priority Multiprocessor Scheduling with Liu and Layland's Utilization Bound
RTAS '10 Proceedings of the 2010 16th IEEE Real-Time and Embedded Technology and Applications Symposium
Is Semi-Partitioned Scheduling Practical?
ECRTS '11 Proceedings of the 2011 23rd Euromicro Conference on Real-Time Systems
DFTS: A dynamic fault-tolerant scheduling for real-time tasks in multicore processors
Microprocessors & Microsystems
| Hi-index | 0.00 |
This paper presents a new semi-partitioned approach to schedule sporadic tasks on multi-core platform based on the Rate Monotonic Scheduling (RMS) policy. Our approach exploits the well known fact that harmonic tasks have better schedulablility than non-harmonic ones on a single processor. 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 semi-partitioned approach. We formally prove that our scheduling approach can successfully schedule any task sets with system utilizations bounded by the Liu&Layland's bound. Our extensive experiment results demonstrate that the proposed algorithm can significantly improve the scheduling performance compared with the previous work.