Scheduling Algorithms for Multiprogramming in a Hard-Real-Time Environment
Journal of the ACM (JACM)
Techniques for Multiprocessor Global Schedulability Analysis
RTSS '07 Proceedings of the 28th 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
Real-Time Systems
New Schedulability Test Conditions for Non-preemptive Scheduling on Multiprocessor Platforms
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
A Unified Hard/Soft Real-Time Schedulability Test for Global EDF Multiprocessor Scheduling
RTSS '08 Proceedings of the 2008 Real-Time Systems Symposium
Schedulability Analysis of Global Scheduling Algorithms on Multiprocessor Platforms
IEEE Transactions on Parallel and Distributed Systems
New Response Time Bounds for Fixed Priority Multiprocessor Scheduling
RTSS '09 Proceedings of the 2009 30th IEEE Real-Time Systems Symposium
Schedulability analysis for non-preemptive fixed-priority multiprocessor scheduling
Journal of Systems Architecture: the EUROMICRO Journal
Controlling Preemption for Better Schedulability in Multi-Core Systems
RTSS '12 Proceedings of the 2012 IEEE 33rd Real-Time Systems Symposium
RTSS '12 Proceedings of the 2012 IEEE 33rd Real-Time Systems Symposium
| Hi-index | 0.00 |
Schedulability analysis has been widely studied to provide offline timing guarantees for a set of real-time tasks. The so-called limited carry-in technique, which can be orthogonally incorporated into many different multi-core schedulability analysis methods, was originally introduced for Earliest Deadline First (EDF) scheduling to derive a tighter bound on the amount of interference of carry-in jobs at the expense of investigating a pseudo-polynomial number of intervals. This technique has been later adapted for Fixed-Priority (FP) scheduling to obtain the carry-in bound efficiently by examining only one interval, leading to a significant improvement in multi-core schedulability analysis. However, such a successful result has not yet been transferred to any other non-FP scheduling algorithms. Motivated by this, this paper presents a generic limited carry-in technique that is applicable to any work-conserving algorithms. Specifically, this paper derives a carry-in bound in an algorithm-independent manner and demonstrates how to apply the bound to existing non-FP schedulability analysis methods for better schedulability.