Multiprocessor Online Scheduling of Hard-Real-Time Tasks
IEEE Transactions on Software Engineering
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
Static-Priority Scheduling on Multiprocessors
RTSS '01 Proceedings of the 22nd IEEE Real-Time Systems Symposium
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
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
A survey of hard real-time scheduling for multiprocessor systems
ACM Computing Surveys (CSUR)
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
Zero-laxity based real-time multiprocessor scheduling
Journal of Systems and Software
Demand-based schedulability analysis for real-time multi-core scheduling
Journal of Systems and Software
Hi-index | 0.00 |
LLF (Least Laxity First) scheduling, which assigns a higher priority to a task with a smaller laxity, has been known as an optimal preemptive scheduling algorithm on a single processor platform. However, little work has been made to illuminate its characteristics upon multiprocessor platforms. In this paper, we identify the dynamics of laxity from the system's viewpoint and translate the dynamics into LLF multiprocessor schedulability analysis. More specifically, we first characterize laxity properties under LLF scheduling, focusing on laxity dynamics associated with a deadline miss. These laxity dynamics describe a lower bound, which leads to the deadline miss, on the number of tasks of certain laxity values at certain time instants. This lower bound is significant because it represents invariants for highly dynamic system parameters (laxity values). Since the laxity of a task is dependent of the amount of interference of higher-priority tasks, we can then derive a set of conditions to check whether a given task system can go into the laxity dynamics towards a deadline miss. This way, to the author's best knowledge, we propose the first LLF multiprocessor schedulability test based on its own laxity properties. We also develop an improved schedulability test that exploits slack values. We mathematically prove that the proposed LLF tests dominate the state-of-the-art EDZL tests. We also present simulation results to evaluate schedulability performance of both the original and improved LLF tests in a quantitative manner.