LSTF: a new scheduling policy for complex real-time tasks in multiple processor systems
Automatica (Journal of IFAC)
Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Deadline-based scheduling of periodic task systems on multiprocessors
Information Processing Letters
An EDF-based Scheduling Algorithm for Multiprocessor Soft Real-Time Systems
ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
Improved Schedulability Analysis of EDF on Multiprocessor Platforms
ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
IEICE - Transactions on Information and Systems
Multiprocessor Scheduling with Few Preemptions
RTCSA '06 Proceedings of the 12th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
An Optimal Real-Time Scheduling Algorithm for Multiprocessors
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Response-Time Analysis for Globally Scheduled Symmetric Multiprocessor Platforms
RTSS '07 Proceedings of the 28th IEEE International Real-Time Systems Symposium
Sporadic Multiprocessor Scheduling with Few Preemptions
ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
Work-Conserving Optimal Real-Time Scheduling on Multiprocessors
ECRTS '08 Proceedings of the 2008 Euromicro Conference on Real-Time Systems
Real-Time Systems
Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms
IEEE Transactions on Parallel and Distributed Systems
Implementation of a Speedup-Optimal Global EDF Schedulability Test
ECRTS '09 Proceedings of the 2009 21st Euromicro Conference on Real-Time Systems
Optimal virtual cluster-based multiprocessor scheduling
Real-Time Systems
DP-FAIR: A Simple Model for Understanding Optimal Multiprocessor Scheduling
ECRTS '10 Proceedings of the 2010 22nd Euromicro Conference on Real-Time Systems
Multiprocessor real-time scheduling considering concurrency and urgency
ACM SIGBED Review - Special Issue on the Work-in-Progress (WIP) Session at the 2009 IEEE Real-Time Systems Symposium (RTSS)
LLF Schedulability Analysis on Multiprocessor Platforms
RTSS '10 Proceedings of the 2010 31st IEEE Real-Time Systems Symposium
Euromicro-RTS'00 Proceedings of the 12th Euromicro conference on Real-time systems
Maximizing Contention-Free Executions in Multiprocessor Scheduling
RTAS '11 Proceedings of the 2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium
RTAS '11 Proceedings of the 2011 17th IEEE Real-Time and Embedded Technology and Applications Symposium
Contention-free executions for real-time multiprocessor scheduling
ACM Transactions on Embedded Computing Systems (TECS) - Special Section ESFH'12, ESTIMedia'11 and Regular Papers
Demand-based schedulability analysis for real-time multi-core scheduling
Journal of Systems and Software
| Hi-index | 0.00 |
Abstract: It has been widely studied how to schedule real-time tasks on multiprocessor platforms. Several studies have developed optimal scheduling policies for implicit deadline task systems. So far however, studies have failed to develop effective scheduling strategies for more general task systems such as constrained deadline tasks. We argue that a narrow focus on deadline satisfaction (urgency) is the primary reason for this lack of success. In particular, few studies have considered the impact on scheduling of the restriction that a job cannot simultaneously execute on more than one core (parallelism). In this paper we look at one such simple, but effective, characterization of urgency and parallelism - the zero laxity first policy (ZL policy). We study in detail how beneficial the ZL policy is to schedulability. We then develop an improved schedulability test for any algorithm that employs the ZL policy, and prove that the test dominates previously known tests. Our simulation results show that the improved ZL schedulability test outperforms the existing ones.